| 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
|
| 1528-D |
It's a bird! No, it's a plane! No, it's AaParsa!
|
constructive algorithms
graphs
shortest paths
|
2500
|
| 1528-C |
Trees of Tranquillity
|
data structures
dfs and similar
greedy
+1
|
2300
|
| 1528-B |
Kavi on Pairing Duty
|
combinatorics
dp
math
|
1700
|
| 1528-A |
Parsa's Humongous Tree
|
dfs and similar
divide and conquer
dp
+2
|
1600
|
| 1527-E |
Partition Game
|
binary search
data structures
divide and conquer
+1
|
2500
|
| 1527-D |
MEX Tree
|
combinatorics
dfs and similar
implementation
+2
|
2400
|
| 1527-C |
Sequence Pair Weight
|
hashing
implementation
math
|
1600
|
| 1527-B2 |
Palindrome Game (hard version)
|
constructive algorithms
games
|
1900
|
| 1527-B1 |
Palindrome Game (easy version)
|
constructive algorithms
games
|
1200
|
| 1527-A |
And Then There Were K
|
bitmasks
|
800
|
| 1526-F |
Median Queries
|
constructive algorithms
interactive
probabilities
|
3000
|
| 1526-E |
Oolimry and Suffix Array
|
combinatorics
constructive algorithms
math
|
2400
|
| 1526-D |
Kill Anton
|
brute force
constructive algorithms
data structures
+2
|
2200
|