| 1660-F2 |
Promising String (hard version)
|
data structures
implementation
math
+1
|
2100
|
| 1660-F1 |
Promising String (easy version)
|
brute force
implementation
math
+1
|
1700
|
| 1660-E |
Matrix and Shifts
|
brute force
constructive algorithms
greedy
+1
|
1600
|
| 1660-D |
Maximum Product Strikes Back
|
brute force
implementation
math
+1
|
1600
|
| 1660-C |
Get an Even String
|
dp
greedy
strings
|
1300
|
| 1660-B |
Vlad and Candies
|
math
|
800
|
| 1660-A |
Vasya and Coins
|
greedy
math
|
800
|
| 1659-F |
Tree and Permutation Game
|
dfs and similar
games
graphs
+1
|
3000
|
| 1659-E |
AND-MEX Walk
|
bitmasks
brute force
constructive algorithms
+3
|
2200
|
| 1659-D |
Reverse Sort Sum
|
constructive algorithms
data structures
greedy
+3
|
1900
|
| 1659-C |
Line Empire
|
binary search
brute force
dp
+3
|
1500
|
| 1659-B |
Bit Flipping
|
bitmasks
constructive algorithms
greedy
+1
|
1300
|
| 1659-A |
Red Versus Blue
|
constructive algorithms
greedy
implementation
+1
|
1000
|
| 1658-F |
Juju and Binary String
|
brute force
constructive algorithms
greedy
+1
|
2700
|
| 1658-E |
Gojou and Matrix Game
|
data structures
dp
games
+5
|
2500
|
| 1658-D2 |
388535 (Hard Version)
|
bitmasks
brute force
data structures
+1
|
2300
|
| 1658-D1 |
388535 (Easy Version)
|
bitmasks
math
|
1600
|
| 1658-C |
Shinju and the Lost Permutation
|
constructive algorithms
math
|
1700
|
| 1658-B |
Marin and Anti-coprime Permutation
|
combinatorics
math
number theory
|
800
|
| 1658-A |
Marin and Photoshoot
|
constructive algorithms
implementation
math
|
800
|
| 1657-F |
Words on Tree
|
2-sat
dfs and similar
dsu
+2
|
2600
|
| 1657-E |
Star MST
|
combinatorics
dp
graph matchings
+1
|
2200
|
| 1657-D |
For Gamers. By Gamers.
|
binary search
brute force
greedy
+2
|
2000
|
| 1657-C |
Bracket Sequence Deletion
|
greedy
implementation
|
1200
|
| 1657-B |
XY Sequence
|
greedy
|
800
|
| 1657-A |
Integer Moves
|
brute force
math
|
800
|
| 1656-I |
Neighbour Ordering
|
constructive algorithms
graphs
|
3500
|
| 1656-H |
Equal LCM Subsets
|
data structures
math
number theory
|
3200
|
| 1656-G |
Cycle Palindrome
|
constructive algorithms
graphs
math
|
3200
|
| 1656-F |
Parametric MST
|
binary search
constructive algorithms
graphs
+3
|
2600
|
| 1656-E |
Equal Tree Sums
|
constructive algorithms
dfs and similar
math
+1
|
2200
|
| 1656-D |
K-good
|
constructive algorithms
math
number theory
|
1900
|
| 1656-C |
Make Equal With Mod
|
constructive algorithms
math
number theory
+1
|
1200
|
| 1656-B |
Subtract Operation
|
data structures
greedy
math
+1
|
1100
|
| 1656-A |
Good Pairs
|
math
sortings
|
800
|
| 1654-H |
Three Minimums
|
combinatorics
constructive algorithms
divide and conquer
+3
|
3500
|
| 1654-G |
Snowy Mountain
|
data structures
dfs and similar
graphs
+3
|
2900
|
| 1654-F |
Minimal String Xoration
|
bitmasks
data structures
divide and conquer
+4
|
2800
|
| 1654-E |
Arithmetic Operations
|
brute force
data structures
graphs
+1
|
2300
|
| 1654-D |
Potion Brewing Class
|
dfs and similar
math
number theory
+1
|
2100
|
| 1654-C |
Alice and the Cake
|
data structures
greedy
implementation
+1
|
1400
|
| 1654-B |
Prefix Removals
|
strings
|
800
|
| 1654-A |
Maximum Cake Tastiness
|
brute force
greedy
implementation
+1
|
800
|
| 1651-F |
Tower Defense
|
binary search
brute force
data structures
|
3000
|
| 1651-E |
Sum of Matchings
|
brute force
combinatorics
constructive algorithms
+4
|
2600
|
| 1651-D |
Nearest Excluded Points
|
binary search
data structures
dfs and similar
+2
|
1900
|
| 1651-C |
Fault-tolerant Network
|
brute force
data structures
implementation
|
1500
|
| 1651-B |
Prove Him Wrong
|
constructive algorithms
greedy
|
800
|
| 1651-A |
Playoff
|
implementation
|
800
|
| 1650-G |
Counting Shortcuts
|
data structures
dfs and similar
dp
+2
|
2100
|