| 700-E |
Cool Slogans
|
string suffix structures
strings
|
3300
|
| 700-D |
Huffman Coding on Segment
|
data structures
greedy
|
3100
|
| 700-C |
Break Up
|
dfs and similar
graphs
|
2600
|
| 700-B |
Connecting Universities
|
dfs and similar
dp
graphs
+1
|
1800
|
| 700-A |
As Fast As Possible
|
binary search
math
|
1900
|
| 699-B |
One Bomb
|
implementation
|
1400
|
| 699-A |
Launch of Collider
|
implementation
|
1000
|
| 698-F |
Coprime Permutation
|
combinatorics
number theory
|
3000
|
| 698-E |
Cron
|
|
2800
|
| 698-D |
Limak and Shooting Points
|
brute force
geometry
math
|
2600
|
| 698-C |
LRU
|
bitmasks
dp
math
+1
|
2400
|
| 698-B |
Fix a Tree
|
constructive algorithms
dfs and similar
dsu
+2
|
1700
|
| 698-A |
Vacations
|
dp
|
1400
|
| 697-B |
Barnicle
|
brute force
implementation
math
+1
|
1400
|
| 697-A |
Pineapple Incident
|
implementation
math
|
900
|
| 696-F |
...Dary!
|
binary search
geometry
two pointers
|
3300
|
| 696-E |
...Wait for it...
|
data structures
dsu
trees
|
3000
|
| 696-D |
Legen...
|
data structures
dp
matrices
+1
|
2500
|
| 696-C |
PLEASE
|
combinatorics
dp
implementation
+2
|
2000
|
| 696-B |
Puzzles
|
dfs and similar
math
probabilities
+1
|
1700
|
| 696-A |
Lorenzo Von Matterhorn
|
brute force
data structures
implementation
+1
|
1500
|
| 691-F |
Couple Cover
|
brute force
dp
number theory
|
2200
|
| 691-E |
Xor-sequences
|
matrices
|
1900
|
| 691-D |
Swaps in Permutation
|
dfs and similar
dsu
math
|
1700
|
| 691-C |
Exponential notation
|
implementation
strings
|
1800
|
| 691-B |
s-palindrome
|
implementation
strings
|
1600
|
| 691-A |
Fashion in Berland
|
implementation
|
1000
|
| 690-F3 |
Tree of Life (hard)
|
trees
|
3200
|
| 690-F2 |
Tree of Life (medium)
|
constructive algorithms
hashing
trees
|
2700
|
| 690-F1 |
Tree of Life (easy)
|
|
1300
|
| 690-E2 |
Photographs (II)
|
|
2600
|
| 690-E1 |
Photographs (I)
|
|
1800
|
| 690-D3 |
The Wall (hard)
|
dp
|
2100
|
| 690-D2 |
The Wall (medium)
|
combinatorics
|
1800
|
| 690-D1 |
The Wall (easy)
|
|
1200
|
| 690-C3 |
Brain Network (hard)
|
trees
|
2200
|
| 690-C2 |
Brain Network (medium)
|
dfs and similar
graphs
trees
|
1500
|
| 690-C1 |
Brain Network (easy)
|
|
1300
|
| 690-B3 |
Recover Polygon (hard)
|
data structures
|
2600
|
| 690-B2 |
Recover Polygon (medium)
|
geometry
|
2600
|
| 690-B1 |
Recover Polygon (easy)
|
|
1700
|
| 690-A3 |
Collective Mindsets (hard)
|
|
2400
|
| 690-A2 |
Collective Mindsets (medium)
|
|
2300
|
| 690-A1 |
Collective Mindsets (easy)
|
|
1100
|
| 689-E |
Mike and Geometry Problem
|
combinatorics
data structures
dp
+2
|
2000
|
| 689-D |
Friends and Subsequences
|
binary search
data structures
|
2100
|
| 689-C |
Mike and Chocolate Thieves
|
binary search
combinatorics
math
|
1700
|
| 689-B |
Mike and Shortcuts
|
dfs and similar
graphs
greedy
+1
|
1600
|
| 689-A |
Mike and Cellphone
|
brute force
constructive algorithms
implementation
|
1400
|
| 688-B |
Lovely Palindromes
|
constructive algorithms
math
|
1000
|