| 567-F |
Mausoleum
|
dp
|
2400
|
| 567-E |
President and Roads
|
dfs and similar
graphs
hashing
+1
|
2200
|
| 567-D |
One-Dimensional Battle Ships
|
binary search
data structures
greedy
+1
|
1700
|
| 567-C |
Geometric Progression
|
binary search
data structures
dp
|
1700
|
| 567-B |
Berland National Library
|
implementation
|
1300
|
| 567-A |
Lineland Mail
|
greedy
implementation
|
900
|
| 566-G |
Max and Min
|
geometry
|
2500
|
| 566-F |
Clique in the Divisibility Graph
|
dp
math
number theory
|
1500
|
| 566-E |
Restoring Map
|
bitmasks
constructive algorithms
trees
|
3200
|
| 566-D |
Restructuring Company
|
data structures
dsu
|
1900
|
| 566-C |
Logistical Questions
|
dfs and similar
divide and conquer
trees
|
3000
|
| 566-B |
Replicating Processes
|
constructive algorithms
greedy
|
2600
|
| 566-A |
Matching Names
|
dfs and similar
strings
trees
|
2300
|
| 560-B |
Gerald is into Art
|
constructive algorithms
implementation
|
1200
|
| 560-A |
Currency System in Geraldion
|
implementation
sortings
|
1000
|
| 559-E |
Gerald and Path
|
dp
sortings
|
3000
|
| 559-D |
Randomizer
|
combinatorics
geometry
probabilities
|
2800
|
| 559-C |
Gerald and Giant Chess
|
combinatorics
dp
math
+1
|
2200
|
| 559-B |
Equivalent Strings
|
divide and conquer
hashing
sortings
+1
|
1700
|
| 559-A |
Gerald's Hexagon
|
brute force
geometry
math
|
1600
|
| 558-E |
A Simple Task
|
data structures
sortings
strings
|
2300
|
| 558-D |
Guess Your Way Out! II
|
data structures
implementation
sortings
|
2300
|
| 558-C |
Amr and Chemistry
|
brute force
graphs
greedy
+2
|
1900
|
| 558-B |
Amr and The Large Array
|
implementation
|
1300
|
| 558-A |
Lala Land and Apple Trees
|
brute force
implementation
sortings
|
1100
|
| 557-E |
Ann and Half-Palindrome
|
data structures
dp
graphs
+3
|
2300
|
| 557-D |
Vitaly and Cycle
|
combinatorics
dfs and similar
graphs
+1
|
2000
|
| 557-C |
Arthur and Table
|
brute force
data structures
dp
+3
|
1900
|
| 557-B |
Pasha and Tea
|
constructive algorithms
implementation
math
+1
|
1500
|
| 557-A |
Ilya and Diplomas
|
greedy
implementation
math
|
1100
|
| 556-B |
Case of Fake Numbers
|
brute force
implementation
|
1100
|
| 556-A |
Case of the Zeros and Ones
|
greedy
|
900
|
| 555-E |
Case of Computer Network
|
dfs and similar
graphs
trees
|
2800
|
| 555-D |
Case of a Top Secret
|
binary search
implementation
math
|
2500
|
| 555-C |
Case of Chocolate
|
data structures
|
2200
|
| 555-B |
Case of Fugitive
|
data structures
greedy
sortings
|
2000
|
| 555-A |
Case of Matryoshkas
|
implementation
|
1500
|
| 554-B |
Ohana Cleans Up
|
brute force
greedy
strings
|
1200
|
| 554-A |
Kyoya and Photobooks
|
brute force
math
strings
|
900
|
| 553-E |
Kyoya and Train
|
dp
fft
graphs
+2
|
3200
|
| 553-D |
Nudist Beach
|
binary search
graphs
greedy
|
2300
|
| 553-C |
Love Triangles
|
dfs and similar
dsu
graphs
|
2200
|
| 553-B |
Kyoya and Permutation
|
binary search
combinatorics
constructive algorithms
+3
|
1900
|
| 553-A |
Kyoya and Colored Balls
|
combinatorics
dp
math
|
1500
|
| 552-E |
Vanya and Brackets
|
brute force
dp
expression parsing
+3
|
2100
|
| 552-D |
Vanya and Triangles
|
brute force
combinatorics
data structures
+3
|
1900
|
| 552-C |
Vanya and Scales
|
brute force
dp
greedy
+3
|
1900
|
| 552-B |
Vanya and Books
|
implementation
math
|
1200
|
| 552-A |
Vanya and Table
|
implementation
math
|
1000
|
| 551-E |
GukiZ and GukiZiana
|
binary search
data structures
implementation
|
2500
|