| 811-A |
Vladik and Courtesy
|
brute force
implementation
|
800
|
| 810-B |
Summer sell-off
|
greedy
sortings
|
1300
|
| 810-A |
Straight <<A>>
|
implementation
math
|
900
|
| 809-E |
Surprise me!
|
divide and conquer
math
number theory
+1
|
3100
|
| 809-D |
Hitchhiking in the Baltic States
|
data structures
dp
|
2900
|
| 809-C |
Find a car
|
combinatorics
divide and conquer
dp
|
2600
|
| 809-B |
Glad to see you!
|
binary search
interactive
|
2200
|
| 809-A |
Do you want a date?
|
implementation
math
sortings
|
1500
|
| 808-G |
Anthem of Berland
|
dp
strings
|
2300
|
| 808-F |
Card Game
|
binary search
flows
graphs
|
2400
|
| 808-E |
Selling Souvenirs
|
binary search
dp
greedy
+1
|
2300
|
| 808-D |
Array Division
|
binary search
data structures
implementation
|
1900
|
| 808-C |
Tea Party
|
constructive algorithms
greedy
sortings
|
1400
|
| 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
|