| 1639-A |
Treasure Hunt
|
graphs
interactive
|
—
|
| 1638-F |
Two Posters
|
brute force
data structures
greedy
+1
|
3200
|
| 1638-E |
Colorful Operations
|
brute force
data structures
implementation
|
2400
|
| 1638-D |
Big Brush
|
constructive algorithms
data structures
greedy
+1
|
2000
|
| 1638-C |
Inversion Graph
|
data structures
dsu
graphs
+1
|
1300
|
| 1638-B |
Odd Swap Sort
|
data structures
math
sortings
|
1100
|
| 1638-A |
Reverse
|
constructive algorithms
greedy
math
|
800
|
| 1637-H |
Minimize Inversions Number
|
data structures
greedy
math
+1
|
3500
|
| 1637-G |
Birthday
|
constructive algorithms
greedy
math
|
3000
|
| 1637-F |
Towers
|
constructive algorithms
dfs and similar
dp
+2
|
2500
|
| 1637-E |
Best Pair
|
binary search
brute force
implementation
|
2100
|
| 1637-D |
Yet Another Minimization Problem
|
dp
greedy
math
|
1800
|
| 1637-C |
Andrew and Stones
|
greedy
implementation
|
1200
|
| 1637-B |
MEX and Array
|
brute force
dp
greedy
+1
|
1100
|
| 1637-A |
Sorting Parts
|
brute force
sortings
|
800
|
| 1635-F |
Closest Pair
|
data structures
greedy
|
2800
|
| 1635-E |
Cars
|
2-sat
constructive algorithms
dfs and similar
+4
|
2200
|
| 1635-D |
Infinite Set
|
bitmasks
dp
math
+3
|
1800
|
| 1635-C |
Differential Sorting
|
constructive algorithms
greedy
|
1200
|
| 1635-B |
Avoid Local Maximums
|
greedy
|
800
|
| 1635-A |
Min Or Sum
|
bitmasks
greedy
|
800
|
| 1634-F |
Fibonacci Additions
|
brute force
data structures
hashing
+2
|
2700
|
| 1634-E |
Fair Share
|
constructive algorithms
data structures
dfs and similar
+2
|
2400
|
| 1634-D |
Finding Zero
|
constructive algorithms
interactive
math
|
2000
|
| 1634-C |
OKEA
|
constructive algorithms
|
1000
|
| 1634-B |
Fortune Telling
|
bitmasks
math
|
1400
|
| 1634-A |
Reverse and Concatenate
|
greedy
strings
|
800
|
| 1633-F |
Perfect Matching
|
data structures
divide and conquer
interactive
+1
|
2800
|
| 1633-E |
Spanning Tree Queries
|
binary search
data structures
dfs and similar
+6
|
2400
|
| 1633-D |
Make Them Equal
|
dp
greedy
|
1600
|
| 1633-C |
Kill the Monster
|
brute force
math
|
1100
|
| 1633-B |
Minority
|
greedy
|
800
|
| 1633-A |
Div. 7
|
brute force
|
800
|
| 1632-E2 |
Distance Tree (hard version)
|
binary search
dfs and similar
shortest paths
+1
|
2700
|
| 1632-E1 |
Distance Tree (easy version)
|
binary search
data structures
dfs and similar
+3
|
2400
|
| 1632-D |
New Year Concert
|
binary search
data structures
greedy
+3
|
2000
|
| 1632-C |
Strange Test
|
binary search
bitmasks
brute force
+2
|
1600
|
| 1632-B |
Roof Construction
|
bitmasks
constructive algorithms
|
1000
|
| 1632-A |
ABC
|
implementation
|
800
|
| 1631-B |
Fun with Even Subarrays
|
dp
greedy
|
1100
|
| 1631-A |
Min Max Swap
|
greedy
|
800
|
| 1630-F |
Making It Bipartite
|
flows
graph matchings
graphs
+1
|
3400
|
| 1630-E |
Expected Components
|
combinatorics
math
number theory
+1
|
2900
|
| 1630-D |
Flipping Range
|
constructive algorithms
dp
greedy
+1
|
2400
|
| 1630-C |
Paint the Middle
|
dp
greedy
sortings
+1
|
2200
|
| 1630-B |
Range and Partition
|
binary search
constructive algorithms
data structures
+2
|
1800
|
| 1630-A |
And Matching
|
bitmasks
constructive algorithms
|
1500
|
| 1629-B |
GCD Arrays
|
greedy
math
number theory
|
800
|
| 1629-A |
Download More RAM
|
brute force
greedy
sortings
|
800
|
| 1628-F |
Spaceship Crisis Management
|
binary search
data structures
geometry
+1
|
3500
|