| 1408-D |
Searchlights
|
binary search
brute force
data structures
+4
|
2000
|
| 1408-C |
Discrete Acceleration
|
binary search
dp
implementation
+2
|
1500
|
| 1408-B |
Arrays Sum
|
constructive algorithms
greedy
math
|
1400
|
| 1408-A |
Circle Coloring
|
constructive algorithms
|
800
|
| 1407-E |
Egor in the Republic of Dagestan
|
constructive algorithms
dfs and similar
dp
+3
|
2500
|
| 1407-D |
Discrete Centrifugal Jumps
|
data structures
dp
graphs
|
2200
|
| 1407-C |
Chocolate Bunny
|
constructive algorithms
interactive
math
+1
|
1600
|
| 1407-B |
Big Vova
|
brute force
greedy
math
+1
|
1300
|
| 1407-A |
Ahahahahahahahaha
|
constructive algorithms
math
|
1100
|
| 1406-E |
Deleting Numbers
|
interactive
math
number theory
|
2600
|
| 1406-D |
Three Sequences
|
constructive algorithms
data structures
greedy
+1
|
2200
|
| 1406-C |
Link Cut Centroids
|
constructive algorithms
dfs and similar
graphs
+1
|
1700
|
| 1406-B |
Maximum Product
|
brute force
dp
greedy
+2
|
1200
|
| 1406-A |
Subset Mex
|
greedy
implementation
math
|
900
|
| 1405-B |
Array Cancellation
|
constructive algorithms
implementation
|
1000
|
| 1405-A |
Permutation Forgery
|
constructive algorithms
|
800
|
| 1404-E |
Bricks
|
flows
graph matchings
graphs
|
2800
|
| 1404-D |
Game of Pairs
|
constructive algorithms
dfs and similar
interactive
+2
|
2800
|
| 1404-C |
Fixed Point Removal
|
binary search
constructive algorithms
data structures
+2
|
2300
|
| 1404-B |
Tree Tag
|
dfs and similar
dp
games
+1
|
1900
|
| 1404-A |
Balanced Bitstring
|
implementation
strings
|
1500
|
| 1403-C |
Chess Rush
|
*special
combinatorics
dp
+2
|
3200
|
| 1403-B |
Spring cleaning
|
*special
data structures
dfs and similar
+2
|
2300
|
| 1403-A |
The Potion of Great Power
|
*special
2-sat
binary search
+5
|
2400
|
| 1402-C |
Star Trek
|
*special
combinatorics
dfs and similar
+5
|
2600
|
| 1402-B |
Roads
|
*special
geometry
sortings
|
2900
|
| 1402-A |
Fancy Fence
|
*special
data structures
dsu
+3
|
1800
|
| 1401-F |
Reverse and Swap
|
binary search
bitmasks
data structures
|
2400
|
| 1401-E |
Divide Square
|
data structures
geometry
implementation
+1
|
2400
|
| 1401-D |
Maximum Distributed Tree
|
dfs and similar
dp
greedy
+5
|
1800
|
| 1401-C |
Mere Array
|
constructive algorithms
math
number theory
+1
|
1300
|
| 1401-B |
Ternary Sequence
|
constructive algorithms
greedy
math
|
1100
|
| 1401-A |
Distance and Axis
|
constructive algorithms
math
|
900
|
| 1400-G |
Mercenaries
|
bitmasks
brute force
combinatorics
+4
|
2600
|
| 1400-F |
x-prime Substrings
|
brute force
dfs and similar
dp
+2
|
2800
|
| 1400-E |
Clear the Multiset
|
data structures
divide and conquer
dp
+1
|
2200
|
| 1400-D |
Zigzags
|
brute force
combinatorics
data structures
+2
|
1900
|
| 1400-C |
Binary String Reconstruction
|
2-sat
brute force
constructive algorithms
+1
|
1500
|
| 1400-B |
RPG Protagonist
|
brute force
greedy
math
|
1700
|
| 1400-A |
String Similarity
|
constructive algorithms
strings
|
800
|
| 1399-F |
Yet Another Segments Subset
|
data structures
dp
graphs
+1
|
2300
|
| 1399-E2 |
Weights Division (hard version)
|
binary search
dfs and similar
greedy
+3
|
2200
|
| 1399-E1 |
Weights Division (easy version)
|
data structures
dfs and similar
greedy
+1
|
2000
|
| 1399-D |
Binary String To Subsequences
|
constructive algorithms
data structures
greedy
+1
|
1500
|
| 1399-C |
Boats Competition
|
brute force
greedy
two pointers
|
1200
|
| 1399-B |
Gifts Fixing
|
greedy
|
800
|
| 1399-A |
Remove Smallest
|
greedy
sortings
|
800
|
| 1398-G |
Running Competition
|
bitmasks
fft
math
+1
|
2600
|
| 1398-F |
Controversial Rounds
|
binary search
data structures
dp
+2
|
2500
|
| 1398-E |
Two Types of Spells
|
binary search
data structures
greedy
+3
|
2200
|