| 1234-D |
Distinct Characters Queries
|
data structures
|
1600
|
| 1234-C |
Pipes
|
dp
implementation
|
1500
|
| 1234-B2 |
Social Network (hard version)
|
data structures
implementation
|
1300
|
| 1234-B1 |
Social Network (easy version)
|
implementation
|
1000
|
| 1234-A |
Equalize Prices Again
|
math
|
800
|
| 1231-E |
Middle-Out
|
constructive algorithms
greedy
strings
|
2200
|
| 1231-C |
Increasing Matrix
|
greedy
|
1100
|
| 1230-B |
Ania and Minimizing
|
greedy
implementation
|
1000
|
| 1230-A |
Dawid and Bags of Candies
|
brute force
implementation
|
800
|
| 1228-F |
One Node is Gone
|
constructive algorithms
implementation
trees
|
2500
|
| 1228-E |
Another Filling the Grid
|
combinatorics
dp
math
|
2300
|
| 1228-D |
Complete Tripartite
|
brute force
constructive algorithms
graphs
+2
|
1900
|
| 1228-C |
Primes and Multiplication
|
math
number theory
|
1700
|
| 1228-B |
Filling the Grid
|
implementation
math
|
1400
|
| 1228-A |
Distinct Digits
|
brute force
implementation
|
800
|
| 1227-G |
Not Same
|
constructive algorithms
|
2600
|
| 1227-F2 |
Wrong Answer on test 233 (Hard Version)
|
combinatorics
math
|
2400
|
| 1227-F1 |
Wrong Answer on test 233 (Easy Version)
|
dp
|
2200
|
| 1227-E |
Arson In Berland Forest
|
binary search
graphs
shortest paths
|
2200
|
| 1227-D2 |
Optimal Subsequences (Hard Version)
|
data structures
greedy
|
1800
|
| 1227-D1 |
Optimal Subsequences (Easy Version)
|
data structures
greedy
|
1600
|
| 1227-C |
Messy
|
constructive algorithms
|
1700
|
| 1227-B |
Box
|
constructive algorithms
|
1200
|
| 1227-A |
Math Problem
|
math
|
1100
|
| 1225-G |
To Make 1
|
bitmasks
constructive algorithms
dp
+2
|
3100
|
| 1225-F |
Tree Factory
|
constructive algorithms
greedy
trees
|
2500
|
| 1225-E |
Rock Is Push
|
binary search
dp
|
2200
|
| 1225-D |
Power Products
|
hashing
math
number theory
|
1800
|
| 1225-C |
p-binary
|
bitmasks
brute force
math
|
1600
|
| 1225-B2 |
TV Subscriptions (Hard Version)
|
implementation
two pointers
|
1300
|
| 1225-B1 |
TV Subscriptions (Easy Version)
|
implementation
|
1000
|
| 1225-A |
Forgetting Things
|
math
|
900
|
| 1223-G |
Wooden Raft
|
binary search
math
number theory
|
3200
|
| 1223-F |
Stack Exterminable Arrays
|
data structures
divide and conquer
dp
+1
|
2600
|
| 1223-E |
Paint the Tree
|
dp
sortings
trees
|
2100
|
| 1223-D |
Sequence Sorting
|
dp
greedy
two pointers
|
2000
|
| 1223-C |
Save the Nature
|
binary search
greedy
|
1600
|
| 1223-B |
Strings Equalization
|
strings
|
1000
|
| 1223-A |
CME
|
math
|
800
|
| 1221-G |
Graph And Numbers
|
bitmasks
brute force
combinatorics
+2
|
2900
|
| 1221-F |
Choose a Square
|
binary search
data structures
sortings
|
2400
|
| 1221-E |
Game With String
|
games
|
2500
|
| 1221-D |
Make The Fence Great Again
|
dp
|
1800
|
| 1221-C |
Perfect Team
|
binary search
math
|
1200
|
| 1221-B |
Knights
|
constructive algorithms
greedy
|
1100
|
| 1221-A |
2048 Game
|
brute force
greedy
math
|
1000
|
| 1220-G |
Geolocation
|
geometry
|
3400
|
| 1220-F |
Gardener Alex
|
binary search
data structures
|
2700
|
| 1220-E |
Tourism
|
dfs and similar
dp
dsu
+3
|
2200
|
| 1220-D |
Alex and Julian
|
bitmasks
math
number theory
|
1900
|