| 1103-D |
Professional layer
|
bitmasks
dp
|
3100
|
| 1103-C |
Johnny Solving
|
constructive algorithms
dfs and similar
graphs
+1
|
2700
|
| 1103-B |
Game with modulo
|
binary search
constructive algorithms
interactive
|
2000
|
| 1103-A |
Grid game
|
constructive algorithms
implementation
|
1400
|
| 1102-F |
Elongated Matrix
|
binary search
bitmasks
brute force
+2
|
2000
|
| 1102-E |
Monotonic Renumeration
|
combinatorics
sortings
|
1700
|
| 1102-D |
Balanced Ternary String
|
greedy
strings
|
1500
|
| 1102-C |
Doors Breaking and Repairing
|
games
|
1200
|
| 1102-B |
Array K-Coloring
|
greedy
sortings
|
1400
|
| 1102-A |
Integer Sequence Dividing
|
math
|
800
|
| 1101-G |
(Zero XOR Subset)-less
|
math
matrices
|
2300
|
| 1101-F |
Trucks and Cities
|
binary search
dp
|
2400
|
| 1101-E |
Polycarp's New Job
|
implementation
|
1500
|
| 1101-D |
GCD Counting
|
data structures
dfs and similar
dp
+2
|
2000
|
| 1101-C |
Division and Union
|
sortings
|
1500
|
| 1101-B |
Accordion
|
greedy
implementation
|
1300
|
| 1101-A |
Minimum Integer
|
math
|
1000
|
| 1100-F |
Ivan and Burgers
|
data structures
divide and conquer
greedy
+1
|
2500
|
| 1100-E |
Andrew and Taxi
|
binary search
dfs and similar
graphs
|
2200
|
| 1100-D |
Dasha and Chess
|
constructive algorithms
games
interactive
|
2500
|
| 1100-C |
NN and the Optical Illusion
|
binary search
geometry
math
|
1200
|
| 1100-B |
Build a Contest
|
data structures
implementation
|
1300
|
| 1100-A |
Roman and Browser
|
implementation
|
1000
|
| 1099-F |
Cookies
|
binary search
data structures
dfs and similar
+3
|
2400
|
| 1099-C |
Postcard
|
constructive algorithms
implementation
|
1200
|
| 1099-B |
Squares and Segments
|
binary search
constructive algorithms
math
|
1100
|
| 1099-A |
Snowball
|
implementation
|
800
|
| 1098-F |
Ж-function
|
string suffix structures
strings
|
3500
|
| 1098-E |
Fedya the Potter
|
binary search
implementation
math
+1
|
3400
|
| 1098-D |
Eels
|
data structures
|
2800
|
| 1098-C |
Construct a tree
|
binary search
constructive algorithms
dfs and similar
+3
|
2400
|
| 1098-B |
Nice table
|
brute force
constructive algorithms
greedy
+1
|
2100
|
| 1098-A |
Sum in the tree
|
constructive algorithms
dfs and similar
greedy
+1
|
1600
|
| 1097-H |
Mateusz and an Infinite Sequence
|
bitmasks
brute force
dp
+1
|
3400
|
| 1097-G |
Vladislav and a Great Legend
|
combinatorics
dp
trees
|
3000
|
| 1097-F |
Alex and a TV Show
|
bitmasks
combinatorics
number theory
|
2500
|
| 1097-E |
Egor and an RPG game
|
constructive algorithms
greedy
|
3400
|
| 1097-D |
Makoto and a Blackboard
|
dp
math
number theory
+1
|
2200
|
| 1097-C |
Yuhao and a Parenthesis
|
greedy
implementation
|
1400
|
| 1097-B |
Petr and a Combination Lock
|
bitmasks
brute force
dp
|
1200
|
| 1097-A |
Gennady and a Card Game
|
brute force
implementation
|
800
|
| 1096-G |
Lucky Tickets
|
divide and conquer
dp
fft
|
2400
|
| 1096-F |
Inversion Expectation
|
dp
math
probabilities
|
2300
|
| 1096-E |
The Top Scorer
|
combinatorics
dp
math
+1
|
2500
|
| 1096-D |
Easy Problem
|
dp
|
1800
|
| 1096-C |
Polygon for the Angle
|
brute force
geometry
|
1600
|
| 1096-B |
Substring Removal
|
combinatorics
math
strings
|
1300
|
| 1096-A |
Find Divisible
|
greedy
implementation
math
|
800
|
| 1095-F |
Make It Connected
|
dsu
graphs
greedy
|
1900
|
| 1095-E |
Almost Regular Bracket Sequence
|
implementation
|
1900
|