| 1304-A |
Two Rabbits
|
math
|
800
|
| 1303-G |
Sum of Prefix Sums
|
data structures
divide and conquer
geometry
+1
|
2700
|
| 1303-F |
Number of Components
|
dsu
implementation
|
2800
|
| 1303-E |
Erase Subsequences
|
dp
strings
|
2200
|
| 1303-D |
Fill The Bag
|
bitmasks
greedy
|
1900
|
| 1303-C |
Perfect Keyboard
|
dfs and similar
greedy
implementation
|
1600
|
| 1303-B |
National Project
|
math
|
1400
|
| 1303-A |
Erasing Zeroes
|
implementation
strings
|
800
|
| 1302-J |
Keep talking and nobody explodes -- hard
|
|
—
|
| 1302-I |
Deja vu
|
|
—
|
| 1302-H |
Who needs suffix structures?
|
|
—
|
| 1302-G |
Keep talking and nobody explodes -- medium
|
|
—
|
| 1302-F |
Keep talking and nobody explodes -- easy
|
bitmasks
brute force
expression parsing
|
—
|
| 1302-E |
Amazing bitset
|
|
—
|
| 1302-D |
Dijkstra
|
|
—
|
| 1302-C |
Segment tree or Fenwick?
|
data structures
|
—
|
| 1302-B |
DAG
|
constructive algorithms
|
—
|
| 1302-A |
Nash equilibrium
|
|
—
|
| 1301-F |
Super Jaber
|
dfs and similar
graphs
implementation
+1
|
2600
|
| 1301-E |
Nanosoft
|
binary search
data structures
dp
+1
|
2500
|
| 1301-D |
Time to Run
|
constructive algorithms
graphs
implementation
|
2000
|
| 1301-C |
Ayoub's function
|
binary search
combinatorics
greedy
+2
|
1700
|
| 1301-B |
Motarack's Birthday
|
binary search
greedy
ternary search
|
1500
|
| 1301-A |
Three Strings
|
implementation
strings
|
800
|
| 1300-B |
Assigning to Classes
|
greedy
implementation
sortings
|
1000
|
| 1300-A |
Non-zero
|
implementation
math
|
800
|
| 1299-E |
So Mean
|
interactive
math
|
3400
|
| 1299-D |
Around the World
|
bitmasks
combinatorics
dfs and similar
+4
|
3000
|
| 1299-C |
Water Balance
|
data structures
geometry
greedy
|
2100
|
| 1299-B |
Aerodynamic
|
geometry
|
1800
|
| 1299-A |
Anu Has a Function
|
brute force
greedy
math
|
1500
|
| 1297-I |
Falling Blocks
|
*special
data structures
|
—
|
| 1297-H |
Paint the String
|
*special
dp
strings
|
—
|
| 1297-G |
M-numbers
|
*special
dp
math
|
—
|
| 1297-F |
Movie Fan
|
*special
data structures
greedy
+2
|
—
|
| 1297-E |
Modernization of Treeland
|
*special
dfs and similar
trees
|
—
|
| 1297-D |
Bonus Distribution
|
*special
binary search
greedy
+1
|
—
|
| 1297-C |
Dream Team
|
*special
greedy
|
—
|
| 1297-B |
Cartoons
|
*special
implementation
sortings
|
—
|
| 1297-A |
Likes Display
|
*special
implementation
|
—
|
| 1296-F |
Berland Beauty
|
constructive algorithms
dfs and similar
greedy
+2
|
2100
|
| 1296-E2 |
String Coloring (hard version)
|
data structures
dp
|
2000
|
| 1296-E1 |
String Coloring (easy version)
|
constructive algorithms
dp
graphs
+2
|
1800
|
| 1296-D |
Fight with Monsters
|
greedy
sortings
|
1500
|
| 1296-C |
Yet Another Walking Robot
|
data structures
implementation
|
1500
|
| 1296-B |
Food Buying
|
math
|
900
|
| 1296-A |
Array with Odd Sum
|
math
|
800
|
| 1295-F |
Good Contest
|
combinatorics
dp
probabilities
|
2700
|
| 1295-E |
Permutation Separation
|
data structures
divide and conquer
|
2200
|
| 1295-D |
Same GCDs
|
math
number theory
|
1800
|