| 1905-B |
Begginer's Zelda
|
greedy
trees
|
1100
|
| 1905-A |
Constructive Problems
|
constructive algorithms
math
|
800
|
| 1904-F |
Beautiful Tree
|
data structures
dfs and similar
graphs
+2
|
2800
|
| 1904-E |
Tree Queries
|
data structures
dfs and similar
graphs
+2
|
2500
|
| 1904-D2 |
Set To Max (Hard Version)
|
constructive algorithms
data structures
divide and conquer
+3
|
1800
|
| 1904-D1 |
Set To Max (Easy Version)
|
brute force
constructive algorithms
greedy
|
1600
|
| 1904-C |
Array Game
|
binary search
brute force
data structures
+2
|
1400
|
| 1904-B |
Collecting Game
|
binary search
dp
greedy
+2
|
1100
|
| 1904-A |
Forked!
|
brute force
implementation
|
900
|
| 1903-F |
Babysitting
|
2-sat
binary search
data structures
+2
|
2500
|
| 1903-E |
Geo Game
|
greedy
interactive
math
|
2000
|
| 1903-D2 |
Maximum And Queries (hard version)
|
bitmasks
divide and conquer
dp
+1
|
2500
|
| 1903-D1 |
Maximum And Queries (easy version)
|
binary search
bitmasks
brute force
+1
|
1700
|
| 1903-C |
Theofanis' Nightmare
|
constructive algorithms
greedy
|
1400
|
| 1903-B |
StORage room
|
bitmasks
brute force
constructive algorithms
+1
|
1200
|
| 1903-A |
Halloumi Boxes
|
brute force
greedy
sortings
|
800
|
| 1902-F |
Trees and XOR Queries Again
|
data structures
dfs and similar
divide and conquer
+4
|
2400
|
| 1902-E |
Collapsing Strings
|
data structures
strings
trees
|
1900
|
| 1902-D |
Robot Queries
|
binary search
data structures
dp
+1
|
1900
|
| 1902-C |
Insert and Equalize
|
brute force
constructive algorithms
greedy
+2
|
1300
|
| 1902-B |
Getting Points
|
binary search
brute force
greedy
|
1100
|
| 1902-A |
Binary Imbalance
|
constructive algorithms
|
800
|
| 1901-F |
Landscaping
|
binary search
geometry
two pointers
|
2900
|
| 1901-E |
Compressed Tree
|
dfs and similar
dp
graphs
+3
|
2200
|
| 1901-D |
Yet Another Monster Fight
|
binary search
dp
greedy
+2
|
1700
|
| 1901-C |
Add, Divide and Floor
|
constructive algorithms
greedy
math
|
1400
|
| 1901-B |
Chip and Ribbon
|
greedy
math
|
1100
|
| 1901-A |
Line Trip
|
greedy
math
|
800
|
| 1900-F |
Local Deletions
|
binary search
data structures
implementation
|
2800
|
| 1900-E |
Transitive Graph
|
dfs and similar
dp
dsu
+2
|
2100
|
| 1900-D |
Small GCD
|
bitmasks
brute force
dp
+2
|
2000
|
| 1900-C |
Anji's Binary Tree
|
dfs and similar
dp
trees
|
1300
|
| 1900-B |
Laura and Operations
|
dp
math
|
900
|
| 1900-A |
Cover in Water
|
constructive algorithms
greedy
implementation
+1
|
800
|
| 1899-G |
Unusual Entertainment
|
data structures
dfs and similar
dsu
+4
|
1900
|
| 1899-F |
Alex's whims
|
constructive algorithms
graphs
greedy
+2
|
1600
|
| 1899-E |
Queue Sort
|
greedy
implementation
sortings
|
1300
|
| 1899-D |
Yarik and Musical Notes
|
hashing
math
number theory
|
1300
|
| 1899-C |
Yarik and Array
|
dp
greedy
two pointers
|
1100
|
| 1899-B |
250 Thousand Tons of TNT
|
brute force
implementation
number theory
|
1100
|
| 1899-A |
Game with Integers
|
games
math
number theory
|
800
|
| 1898-F |
Vova Escapes the Matrix
|
brute force
dfs and similar
divide and conquer
+1
|
2600
|
| 1898-E |
Sofia and Strings
|
data structures
greedy
sortings
+2
|
2200
|
| 1898-D |
Absolute Beauty
|
greedy
math
|
1900
|
| 1898-C |
Colorful Grid
|
constructive algorithms
|
1700
|
| 1898-B |
Milena and Admirer
|
greedy
math
|
1500
|
| 1898-A |
Milica and String
|
brute force
implementation
strings
|
800
|
| 1896-H2 |
Cyclic Hamming (Hard Version)
|
brute force
dp
fft
+2
|
3500
|
| 1896-H1 |
Cyclic Hamming (Easy Version)
|
brute force
divide and conquer
dp
+3
|
3400
|
| 1896-G |
Pepe Racing
|
constructive algorithms
implementation
interactive
+1
|
3200
|