| 1535-E |
Gold Transfer
|
binary search
data structures
dp
+3
|
2200
|
| 1535-D |
Playoff Tournament
|
data structures
dfs and similar
dp
+2
|
1800
|
| 1535-C |
Unstable String
|
binary search
dp
greedy
+3
|
1400
|
| 1535-B |
Array Reodering
|
brute force
greedy
math
+2
|
900
|
| 1535-A |
Fair Playoff
|
brute force
implementation
|
800
|
| 1534-H |
Lost Nodes
|
constructive algorithms
dp
graphs
+3
|
3500
|
| 1534-G |
A New Beginning
|
data structures
dp
geometry
+1
|
3300
|
| 1534-F2 |
Falling Sand (Hard Version)
|
dfs and similar
dp
graphs
+1
|
3000
|
| 1534-F1 |
Falling Sand (Easy Version)
|
dfs and similar
graphs
greedy
|
2500
|
| 1534-E |
Lost Array
|
graphs
greedy
interactive
+1
|
2300
|
| 1534-D |
Lost Tree
|
constructive algorithms
interactive
trees
|
1800
|
| 1534-C |
Little Alawn's Puzzle
|
combinatorics
dp
dsu
+2
|
1300
|
| 1534-B |
Histogram Ugliness
|
greedy
implementation
math
|
1100
|
| 1534-A |
Colour the Flag
|
brute force
implementation
|
800
|
| 1533-J |
Pawns
|
*special
|
—
|
| 1533-I |
Excursions
|
*special
constructive algorithms
dfs and similar
+3
|
—
|
| 1533-H |
Submatrices
|
*special
bitmasks
data structures
+1
|
—
|
| 1533-G |
Biome Map
|
*special
constructive algorithms
dfs and similar
+1
|
—
|
| 1533-F |
Binary String Partition
|
*special
binary search
greedy
|
—
|
| 1533-E |
Chess Team Forming
|
*special
binary search
data structures
+1
|
—
|
| 1533-D |
String Searching
|
*special
hashing
|
—
|
| 1533-C |
Sweets
|
*special
data structures
implementation
|
—
|
| 1533-B |
Nearest Point Function
|
*special
implementation
|
—
|
| 1533-A |
Travel to Bertown
|
*special
implementation
math
|
—
|
| 1532-F |
Prefixes and Suffixes
|
*special
strings
|
—
|
| 1532-E |
Good Array
|
*special
|
—
|
| 1532-D |
Teams Forming
|
*special
sortings
|
—
|
| 1532-C |
Uniform String
|
*special
implementation
|
—
|
| 1532-B |
Frog Jumping
|
*special
math
|
—
|
| 1532-A |
A+B (Trial Problem)
|
*special
|
—
|
| 1531-E3 |
Сортировка слиянием
|
*special
binary search
|
—
|
| 1531-E2 |
Сортировка слиянием
|
*special
brute force
|
—
|
| 1531-E1 |
Сортировка слиянием
|
*special
|
—
|
| 1531-D |
Редактируем Зингер | color
|
*special
|
—
|
| 1531-C |
Симметричный амфитеатр
|
*special
constructive algorithms
dp
|
—
|
| 1531-B2 |
Мониторинг
|
*special
|
—
|
| 1531-B1 |
Мониторинг
|
*special
|
—
|
| 1531-A |
Зингер | color
|
*special
implementation
|
—
|
| 1530-H |
Turing's Award
|
data structures
dp
|
3400
|
| 1530-G |
What a Reversal
|
constructive algorithms
|
3300
|
| 1530-F |
Bingo
|
bitmasks
combinatorics
dp
+2
|
2600
|
| 1530-E |
Minimax
|
constructive algorithms
greedy
strings
|
2100
|
| 1530-D |
Secret Santa
|
constructive algorithms
flows
graphs
+2
|
1600
|
| 1530-C |
Pursuit
|
binary search
brute force
greedy
+1
|
1200
|
| 1530-B |
Putting Plates
|
constructive algorithms
implementation
|
800
|
| 1530-A |
Binary Decimal
|
greedy
math
|
800
|
| 1529-B |
Sifid and Strange Subsequences
|
greedy
math
sortings
|
1100
|
| 1529-A |
Eshag Loves Big Arrays
|
constructive algorithms
greedy
math
|
800
|
| 1528-F |
AmShZ Farm
|
combinatorics
fft
math
|
3300
|
| 1528-E |
Mashtali and Hagh Trees
|
combinatorics
dp
trees
|
2900
|