| 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
|
| 1295-C |
Obtain The String
|
dp
greedy
strings
|
1600
|
| 1295-B |
Infinite Prefixes
|
math
strings
|
1700
|
| 1295-A |
Display The Number
|
greedy
|
900
|
| 1294-F |
Three Paths on a Tree
|
dfs and similar
dp
greedy
+1
|
2000
|
| 1294-E |
Obtain a Permutation
|
greedy
implementation
math
|
1900
|
| 1294-D |
MEX maximizing
|
data structures
greedy
implementation
+1
|
1600
|
| 1294-C |
Product of Three Numbers
|
greedy
math
number theory
|
1300
|
| 1294-B |
Collecting Packages
|
implementation
sortings
|
1200
|
| 1294-A |
Collecting Coins
|
math
|
800
|
| 1293-B |
JOE is on TV!
|
combinatorics
greedy
math
|
1000
|
| 1293-A |
ConneR and the A.R.C. Markland-N
|
binary search
brute force
implementation
|
1100
|
| 1292-F |
Nora's Toy Boxes
|
bitmasks
combinatorics
dp
|
3500
|
| 1292-E |
Rin and The Unknown Flower
|
constructive algorithms
greedy
interactive
+1
|
3500
|