| 1667-D |
Edge Elimination
|
constructive algorithms
dfs and similar
dp
+1
|
2900
|
| 1667-C |
Half Queen Cover
|
constructive algorithms
math
|
2400
|
| 1667-B |
Optimal Partition
|
data structures
dp
|
2100
|
| 1667-A |
Make it Increasing
|
brute force
greedy
math
|
1300
|
| 1666-L |
Labyrinth
|
dfs and similar
graphs
|
1800
|
| 1666-K |
Kingdom Partition
|
flows
|
3200
|
| 1666-J |
Job Lookup
|
constructive algorithms
dp
shortest paths
+1
|
2100
|
| 1666-I |
Interactive Treasure Hunt
|
brute force
constructive algorithms
geometry
+2
|
2200
|
| 1666-H |
Heroes of Might
|
math
|
3500
|
| 1666-G |
Global Warming
|
geometry
math
|
3100
|
| 1666-F |
Fancy Stack
|
combinatorics
dp
implementation
|
2200
|
| 1666-E |
Even Split
|
binary search
constructive algorithms
greedy
+1
|
2500
|
| 1666-D |
Deletive Editing
|
greedy
|
900
|
| 1666-C |
Connect the Points
|
brute force
constructive algorithms
geometry
|
1800
|
| 1666-B |
Budget Distribution
|
|
3300
|
| 1666-A |
Admissible Map
|
|
3300
|
| 1665-E |
MinimizOR
|
bitmasks
brute force
data structures
+4
|
2500
|
| 1665-D |
GCD Guess
|
bitmasks
chinese remainder theorem
constructive algorithms
+4
|
2000
|
| 1665-C |
Tree Infection
|
binary search
greedy
sortings
+1
|
1600
|
| 1665-B |
Array Cloning Technique
|
constructive algorithms
greedy
sortings
|
900
|
| 1665-A |
GCD vs LCM
|
constructive algorithms
math
|
800
|
| 1663-H |
Cross-Language Program
|
*special
constructive algorithms
|
—
|
| 1663-G |
Six Characters
|
*special
constructive algorithms
strings
|
—
|
| 1663-F |
In Every Generation...
|
*special
strings
|
—
|
| 1663-E |
Are You Safe?
|
*special
implementation
|
—
|
| 1663-D |
Is it rated - 3
|
*special
combinatorics
dp
+1
|
—
|
| 1663-C |
Pōja Verdon
|
*special
implementation
math
|
—
|
| 1663-B |
Mike's Sequence
|
*special
divide and conquer
implementation
+1
|
—
|
| 1663-A |
Who Tested?
|
*special
expression parsing
trees
|
—
|
| 1662-O |
Circular Maze
|
brute force
dfs and similar
graphs
+1
|
—
|
| 1662-N |
Drone Photo
|
combinatorics
math
sortings
|
—
|
| 1662-M |
Bottle Arrangements
|
constructive algorithms
|
—
|
| 1662-L |
Il Derby della Madonnina
|
data structures
dp
math
|
—
|
| 1662-K |
Pandemic Restrictions
|
geometry
ternary search
|
—
|
| 1662-J |
Training Camp
|
flows
graphs
|
—
|
| 1662-I |
Ice Cream Shop
|
brute force
implementation
sortings
|
—
|
| 1662-H |
Boundary
|
brute force
math
|
—
|
| 1662-G |
Gastronomic Event
|
dp
greedy
trees
|
—
|
| 1662-F |
Antennas
|
data structures
dfs and similar
graphs
+2
|
—
|
| 1662-E |
Round Table
|
math
|
—
|
| 1662-D |
Evolution of Weasels
|
greedy
implementation
strings
|
—
|
| 1662-C |
European Trip
|
dp
graphs
math
+1
|
—
|
| 1662-B |
Toys
|
greedy
strings
|
—
|
| 1662-A |
Organizing SWERC
|
brute force
implementation
|
—
|
| 1661-F |
Teleporters
|
binary search
greedy
|
2600
|
| 1661-E |
Narrow Components
|
brute force
data structures
dp
+3
|
2500
|
| 1661-D |
Progressions Covering
|
data structures
greedy
|
1900
|
| 1661-C |
Water the Trees
|
binary search
greedy
math
|
1700
|
| 1661-B |
Getting Zero
|
bitmasks
brute force
dfs and similar
+4
|
1300
|
| 1661-A |
Array Balancing
|
greedy
math
|
800
|