| 1044-F |
DFS
|
data structures
|
2700
|
| 1044-E |
Grid Sort
|
implementation
|
3100
|
| 1044-D |
Deduction Queries
|
data structures
dsu
|
2400
|
| 1044-C |
Optimal Polygon Perimeter
|
dp
geometry
|
2100
|
| 1044-B |
Intersecting Subtrees
|
dfs and similar
interactive
trees
|
1900
|
| 1044-A |
The Tower is Going Home
|
binary search
two pointers
|
1700
|
| 1043-G |
Speckled Band
|
data structures
divide and conquer
hashing
+2
|
3500
|
| 1043-F |
Make It One
|
bitmasks
combinatorics
dp
+3
|
2500
|
| 1043-E |
Train Hard, Win Easy
|
constructive algorithms
greedy
math
+1
|
1900
|
| 1043-D |
Mysterious Crime
|
brute force
combinatorics
math
+2
|
1700
|
| 1043-C |
Smallest Word
|
constructive algorithms
greedy
implementation
|
1500
|
| 1043-B |
Lost Array
|
implementation
|
1200
|
| 1043-A |
Elections
|
implementation
math
|
800
|
| 1042-F |
Leaf Sets
|
data structures
dfs and similar
dsu
+4
|
2400
|
| 1042-E |
Vasya and Magic Matrix
|
dp
math
probabilities
|
2300
|
| 1042-D |
Petya and Array
|
data structures
divide and conquer
two pointers
|
1800
|
| 1042-C |
Array Product
|
constructive algorithms
greedy
math
|
1700
|
| 1042-B |
Vitamins
|
bitmasks
brute force
dp
+1
|
1200
|
| 1042-A |
Benches
|
binary search
implementation
|
1100
|
| 1041-F |
Ray in the tube
|
data structures
divide and conquer
dp
+1
|
2500
|
| 1041-E |
Tree Reconstruction
|
constructive algorithms
data structures
graphs
+1
|
1900
|
| 1041-D |
Glider
|
binary search
data structures
two pointers
|
1700
|
| 1041-C |
Coffee Break
|
binary search
data structures
greedy
+1
|
1600
|
| 1041-B |
Buying a TV Set
|
math
|
1000
|
| 1041-A |
Heist
|
greedy
implementation
sortings
|
800
|
| 1040-B |
Shashlik Cooking
|
dp
greedy
math
|
1300
|
| 1040-A |
Palindrome Dance
|
greedy
|
1000
|
| 1039-E |
Summer Oenothera Exhibition
|
data structures
|
3400
|
| 1039-D |
You Are Given a Tree
|
data structures
dp
trees
|
2800
|
| 1039-C |
Network Safety
|
dfs and similar
dsu
graphs
+2
|
2200
|
| 1039-B |
Subway Pursuit
|
binary search
interactive
probabilities
|
2100
|
| 1039-A |
Timetable
|
constructive algorithms
data structures
greedy
+1
|
2300
|
| 1038-F |
Wrap Around
|
dp
strings
|
2900
|
| 1038-E |
Maximum Matching
|
bitmasks
brute force
dfs and similar
+2
|
2400
|
| 1038-D |
Slime
|
dp
greedy
implementation
|
1800
|
| 1038-C |
Gambling
|
greedy
sortings
|
1300
|
| 1038-B |
Non-Coprime Partition
|
constructive algorithms
math
|
1100
|
| 1038-A |
Equality
|
implementation
strings
|
800
|
| 1037-H |
Security
|
data structures
string suffix structures
|
3200
|
| 1037-G |
A Game on Strings
|
games
|
3200
|
| 1037-F |
Maximum Reduction
|
combinatorics
data structures
math
|
2500
|
| 1037-E |
Trips
|
graphs
|
2200
|
| 1037-D |
Valid BFS?
|
dfs and similar
graphs
shortest paths
+1
|
1700
|
| 1037-C |
Equalize
|
dp
greedy
strings
|
1300
|
| 1037-B |
Reach Median
|
greedy
|
1300
|
| 1037-A |
Packets
|
constructive algorithms
greedy
math
|
1300
|
| 1036-G |
Sources and Sinks
|
bitmasks
brute force
dfs and similar
|
2700
|
| 1036-F |
Relatively Prime Powers
|
combinatorics
math
number theory
|
2400
|
| 1036-E |
Covered Points
|
fft
geometry
number theory
|
2400
|
| 1036-D |
Vasya and Arrays
|
greedy
two pointers
|
1600
|