| 1452-B |
Toy Blocks
|
binary search
greedy
math
+1
|
1400
|
| 1452-A |
Robot Program
|
math
|
800
|
| 1451-F |
Nullify The Matrix
|
constructive algorithms
games
|
2700
|
| 1451-E2 |
Bitwise Queries (Hard Version)
|
bitmasks
constructive algorithms
interactive
+1
|
2300
|
| 1451-E1 |
Bitwise Queries (Easy Version)
|
bitmasks
constructive algorithms
interactive
+1
|
2000
|
| 1451-D |
Circle Game
|
games
geometry
math
|
1700
|
| 1451-C |
String Equality
|
dp
greedy
hashing
+2
|
1400
|
| 1451-B |
Non-Substring Subsequence
|
dp
greedy
implementation
+1
|
900
|
| 1451-A |
Subtract or Divide
|
greedy
math
|
800
|
| 1450-H2 |
Multithreading (Hard Version)
|
combinatorics
implementation
math
|
3300
|
| 1450-H1 |
Multithreading (Easy Version)
|
combinatorics
fft
math
|
2900
|
| 1450-G |
Communism
|
bitmasks
dp
trees
|
3500
|
| 1450-F |
The Struggling Contestant
|
constructive algorithms
greedy
|
2400
|
| 1450-E |
Capitalism
|
constructive algorithms
dfs and similar
graphs
+1
|
2700
|
| 1450-D |
Rating Compression
|
binary search
data structures
greedy
+2
|
1800
|
| 1450-C2 |
Errich-Tac-Toe (Hard Version)
|
constructive algorithms
math
|
2300
|
| 1450-C1 |
Errich-Tac-Toe (Easy Version)
|
constructive algorithms
math
|
2100
|
| 1450-B |
Balls of Steel
|
brute force
geometry
greedy
|
1000
|
| 1450-A |
Avoid Trygub
|
constructive algorithms
sortings
|
800
|
| 1447-B |
Numbers Box
|
greedy
math
|
1000
|
| 1447-A |
Add Candies
|
constructive algorithms
math
|
800
|
| 1446-F |
Line Distance
|
binary search
data structures
geometry
|
3200
|
| 1446-E |
Long Recovery
|
constructive algorithms
dfs and similar
|
3500
|
| 1446-D2 |
Frequency Problem (Hard Version)
|
data structures
greedy
two pointers
|
3000
|
| 1446-D1 |
Frequency Problem (Easy Version)
|
data structures
greedy
|
2600
|
| 1446-C |
Xor Tree
|
binary search
bitmasks
data structures
+3
|
2100
|
| 1446-B |
Catching Cheaters
|
dp
strings
|
1800
|
| 1446-A |
Knapsack
|
constructive algorithms
greedy
sortings
|
1300
|
| 1445-B |
Elimination
|
greedy
math
|
900
|
| 1445-A |
Array Rearrangment
|
greedy
sortings
|
800
|
| 1444-E |
Finding the Vertex
|
brute force
dfs and similar
dp
+2
|
3500
|
| 1444-D |
Rectangular Polyline
|
constructive algorithms
dp
geometry
|
2900
|
| 1444-C |
Team-Building
|
data structures
dfs and similar
dsu
+1
|
2500
|
| 1444-B |
Divide and Sum
|
combinatorics
math
sortings
|
1900
|
| 1444-A |
Division
|
brute force
math
number theory
|
1500
|
| 1443-E |
Long Permutation
|
brute force
math
two pointers
|
2400
|
| 1443-C |
The Delivery Dilemma
|
binary search
greedy
sortings
|
1400
|
| 1443-B |
Saving the City
|
dp
greedy
math
+1
|
1300
|
| 1443-A |
Kids Seating
|
constructive algorithms
math
|
800
|
| 1442-F |
Differentiating Games
|
games
interactive
|
3400
|
| 1442-E |
Black, White and Grey Tree
|
binary search
constructive algorithms
dfs and similar
+3
|
3000
|
| 1442-D |
Sum
|
data structures
divide and conquer
dp
+1
|
2800
|
| 1442-C |
Graph Transpositions
|
dfs and similar
graphs
greedy
+1
|
2400
|
| 1442-B |
Identify the Operations
|
combinatorics
data structures
dsu
+2
|
1800
|
| 1442-A |
Extreme Subtraction
|
constructive algorithms
dp
greedy
|
1800
|
| 1440-B |
Sum of Medians
|
greedy
math
|
900
|
| 1440-A |
Buy the String
|
implementation
math
|
800
|
| 1439-E |
Cheat and Win
|
bitmasks
data structures
games
+1
|
3500
|
| 1439-D |
INOI Final Contests
|
combinatorics
dp
fft
|
3100
|
| 1439-C |
Greedy Shopping
|
binary search
data structures
divide and conquer
+2
|
2600
|