| 1210-C |
Kamil and Making a Stream
|
math
number theory
trees
|
2000
|
| 1210-B |
Marcin and Training Camp
|
brute force
greedy
|
1700
|
| 1210-A |
Anadi and Domino
|
brute force
graphs
|
1700
|
| 1209-H |
Moving Walkways
|
data structures
greedy
math
|
3300
|
| 1209-G2 |
Into Blocks (hard version)
|
data structures
|
3200
|
| 1209-G1 |
Into Blocks (easy version)
|
data structures
dsu
greedy
+2
|
2000
|
| 1209-F |
Koala and Notebook
|
data structures
dfs and similar
graphs
+3
|
2600
|
| 1209-E2 |
Rotate Columns (hard version)
|
bitmasks
dp
greedy
+1
|
2500
|
| 1209-E1 |
Rotate Columns (easy version)
|
bitmasks
brute force
dp
+2
|
2000
|
| 1209-D |
Cow and Snacks
|
dfs and similar
dsu
graphs
|
1700
|
| 1209-C |
Paint the Digits
|
constructive algorithms
greedy
implementation
|
1500
|
| 1209-B |
Koala and Lights
|
implementation
math
number theory
|
1300
|
| 1209-A |
Paint the Numbers
|
greedy
implementation
math
|
800
|
| 1208-H |
Red Blue Tree
|
data structures
implementation
trees
|
3500
|
| 1208-G |
Polygons
|
greedy
math
number theory
|
2800
|
| 1208-F |
Bits And Pieces
|
bitmasks
dfs and similar
dp
+1
|
2600
|
| 1208-E |
Let Them Slide
|
data structures
implementation
|
2200
|
| 1208-D |
Restore Permutation
|
binary search
data structures
greedy
+1
|
1900
|
| 1208-C |
Magic Grid
|
constructive algorithms
|
1800
|
| 1208-B |
Uniqueness
|
binary search
brute force
implementation
+1
|
1500
|
| 1208-A |
XORinacci
|
math
|
900
|
| 1207-G |
Indie Album
|
data structures
dfs and similar
hashing
+3
|
2700
|
| 1207-F |
Remainder Problem
|
brute force
data structures
implementation
|
2100
|
| 1207-E |
XOR Guessing
|
bitmasks
interactive
math
|
1900
|
| 1207-D |
Number Of Permutations
|
combinatorics
|
1800
|
| 1207-C |
Gas Pipeline
|
dp
greedy
|
1500
|
| 1207-B |
Square Filling
|
constructive algorithms
greedy
implementation
|
1200
|
| 1207-A |
There Are Two Types Of Burgers
|
brute force
greedy
implementation
+1
|
800
|
| 1206-B |
Make Product Equal One
|
dp
implementation
|
900
|
| 1206-A |
Choose Two Numbers
|
math
sortings
|
800
|
| 1205-F |
Beauty of a Permutation
|
constructive algorithms
math
|
3400
|
| 1205-E |
Expected Value Again
|
combinatorics
strings
|
3100
|
| 1205-D |
Almost All
|
constructive algorithms
trees
|
2700
|
| 1205-C |
Palindromic Paths
|
implementation
interactive
|
2400
|
| 1205-B |
Shortest Cycle
|
bitmasks
brute force
graphs
+1
|
1900
|
| 1205-A |
Almost Equal
|
constructive algorithms
greedy
math
|
1200
|
| 1204-E |
Natasha, Sasha and the Prefix Sums
|
combinatorics
dp
math
+1
|
2300
|
| 1204-D2 |
Kirk and a Binary String (hard version)
|
data structures
greedy
math
+1
|
2100
|
| 1204-D1 |
Kirk and a Binary String (easy version)
|
brute force
greedy
strings
|
2000
|
| 1204-C |
Anna, Svyatoslav and Maps
|
dp
graphs
greedy
+1
|
1700
|
| 1204-B |
Mislove Has Lost an Array
|
greedy
math
|
900
|
| 1204-A |
BowWow and the Timetable
|
math
|
1000
|
| 1203-F2 |
Complete the Projects (hard version)
|
dp
greedy
|
2300
|
| 1203-F1 |
Complete the Projects (easy version)
|
greedy
|
2100
|
| 1203-E |
Boxers
|
greedy
sortings
|
1500
|
| 1203-D2 |
Remove the Substring (hard version)
|
binary search
greedy
implementation
+1
|
1700
|
| 1203-D1 |
Remove the Substring (easy version)
|
greedy
implementation
|
1600
|
| 1203-C |
Common Divisors
|
implementation
math
|
1300
|
| 1203-B |
Equal Rectangles
|
greedy
math
|
1200
|
| 1203-A |
Circle of Students
|
implementation
|
1000
|