| 808-B |
Average Sleep Time
|
data structures
implementation
math
|
1300
|
| 808-A |
Lucky Year
|
implementation
|
900
|
| 807-B |
T-Shirt Hunt
|
brute force
implementation
|
1300
|
| 807-A |
Is it rated?
|
implementation
sortings
|
900
|
| 805-B |
3-palindrome
|
constructive algorithms
|
1000
|
| 805-A |
Fake NP
|
greedy
math
|
1000
|
| 804-F |
Fake bullions
|
combinatorics
dfs and similar
dp
+2
|
3400
|
| 804-E |
The same permutation
|
constructive algorithms
|
3100
|
| 804-D |
Expected diameter of a tree
|
binary search
brute force
dfs and similar
+3
|
2500
|
| 804-C |
Ice cream coloring
|
constructive algorithms
dfs and similar
greedy
|
2200
|
| 804-B |
Minimum number of steps
|
combinatorics
greedy
implementation
+1
|
1400
|
| 804-A |
Find Amir
|
constructive algorithms
greedy
math
|
1000
|
| 803-G |
Periodic RMQ Problem
|
data structures
|
2300
|
| 803-F |
Coprime Subsequences
|
bitmasks
combinatorics
number theory
|
2000
|
| 803-E |
Roma and Poker
|
dp
graphs
|
2000
|
| 803-D |
Magazine Ad
|
binary search
greedy
|
1900
|
| 803-C |
Maximal GCD
|
constructive algorithms
greedy
math
|
1900
|
| 803-B |
Distances to Zero
|
constructive algorithms
|
1200
|
| 803-A |
Maximal Binary Matrix
|
constructive algorithms
|
1400
|
| 802-M3 |
April Fools' Problem (hard)
|
binary search
data structures
flows
|
2900
|
| 802-M2 |
April Fools' Problem (medium)
|
binary search
flows
graphs
|
2400
|
| 802-M1 |
April Fools' Problem (easy)
|
greedy
sortings
|
1200
|
| 802-J3 |
Send the Fool Further! (hard)
|
dfs and similar
dp
math
+1
|
2400
|
| 802-J2 |
Send the Fool Further! (medium)
|
dp
trees
|
2100
|
| 802-J1 |
Send the Fool Further! (easy)
|
dfs and similar
graphs
trees
|
1400
|
| 802-G3 |
Fake News (hard)
|
string suffix structures
|
2300
|
| 802-G2 |
Fake News (medium)
|
constructive algorithms
strings
|
2200
|
| 802-G1 |
Fake News (easy)
|
implementation
strings
|
800
|
| 802-D3 |
Marmots (hard)
|
math
probabilities
|
2800
|
| 802-D2 |
Marmots (medium)
|
math
|
2200
|
| 802-D1 |
Marmots (easy)
|
math
|
2100
|
| 802-A3 |
Heidi and Library (hard)
|
flows
graphs
|
2600
|
| 802-A2 |
Heidi and Library (medium)
|
data structures
greedy
|
1800
|
| 802-A1 |
Heidi and Library (easy)
|
greedy
|
1800
|
| 801-B |
Valued Keys
|
constructive algorithms
greedy
strings
|
900
|
| 801-A |
Vicious Keyboard
|
brute force
|
1100
|
| 799-G |
Cut the pie
|
binary search
data structures
geometry
|
3500
|
| 799-F |
Beautiful fountains rows
|
data structures
|
3500
|
| 799-E |
Aquarium decoration
|
data structures
greedy
two pointers
|
2500
|
| 799-D |
Field expansion
|
brute force
dp
meet-in-the-middle
|
2100
|
| 799-C |
Fountains
|
binary search
data structures
implementation
|
1800
|
| 799-B |
T-shirt buying
|
data structures
implementation
|
1400
|
| 799-A |
Carrot Cakes
|
brute force
implementation
|
1100
|
| 798-E |
Mike and code of a permutation
|
constructive algorithms
data structures
graphs
+1
|
3000
|
| 798-D |
Mike and distribution
|
constructive algorithms
sortings
|
2400
|
| 798-C |
Mike and gcd problem
|
dp
greedy
number theory
|
1700
|
| 798-B |
Mike and strings
|
brute force
dp
strings
|
1300
|
| 798-A |
Mike and palindrome
|
brute force
constructive algorithms
strings
|
1000
|
| 797-F |
Mice and Holes
|
data structures
dp
greedy
+1
|
2600
|
| 797-E |
Array Queries
|
brute force
data structures
dp
|
2000
|