| 2056-C |
Palindromic Subsequences
|
brute force
constructive algorithms
math
|
1200
|
| 2056-B |
Find the Permutation
|
brute force
dfs and similar
graphs
+2
|
1300
|
| 2056-A |
Shape Perimeter
|
constructive algorithms
math
|
800
|
| 2055-F |
Cosmic Divide
|
brute force
geometry
hashing
+2
|
3200
|
| 2055-E |
Haystacks
|
brute force
constructive algorithms
data structures
+2
|
2800
|
| 2055-D |
Scarecrow
|
greedy
implementation
math
|
2000
|
| 2055-C |
The Trail
|
brute force
constructive algorithms
greedy
+2
|
1400
|
| 2055-B |
Crafting
|
constructive algorithms
greedy
sortings
|
1000
|
| 2055-A |
Two Frogs
|
constructive algorithms
games
greedy
+1
|
800
|
| 2053-I2 |
Affectionate Arrays (Hard Version)
|
data structures
dp
graphs
+4
|
3500
|
| 2053-I1 |
Affectionate Arrays (Easy Version)
|
data structures
dp
greedy
|
2800
|
| 2053-H |
Delicate Anti-monotonous Operations
|
constructive algorithms
implementation
|
3500
|
| 2053-G |
Naive String Splits
|
binary search
brute force
greedy
+4
|
3400
|
| 2053-F |
Earnest Matrix Complement
|
brute force
data structures
dp
+3
|
2600
|
| 2053-E |
Resourceful Caterpillar Sequence
|
dfs and similar
dp
games
+3
|
1900
|
| 2053-D |
Refined Product Optimality
|
binary search
data structures
greedy
+3
|
1700
|
| 2053-C |
Bewitching Stargazer
|
bitmasks
divide and conquer
dp
+1
|
1500
|
| 2053-B |
Outstanding Impressionist
|
binary search
brute force
data structures
+1
|
1200
|
| 2053-A |
Tender Carpenter
|
dp
geometry
greedy
+1
|
800
|
| 2052-M |
Managing Cluster
|
dp
graphs
math
+1
|
2700
|
| 2052-L |
Legacy Screensaver
|
|
2900
|
| 2052-K |
Knowns and Unknowns
|
|
2800
|
| 2052-J |
Judicious Watching
|
binary search
greedy
sortings
|
2000
|
| 2052-I |
Incompetent Delivery Guy
|
graphs
shortest paths
|
2800
|
| 2052-H |
Hunting Hoglins in Hogwarts
|
interactive
|
3500
|
| 2052-G |
Geometric Balance
|
data structures
geometry
implementation
|
2800
|
| 2052-F |
Fix Flooded Floor
|
constructive algorithms
dp
graphs
|
1700
|
| 2052-E |
Expression Correction
|
brute force
expression parsing
strings
|
1900
|
| 2052-D |
DAG Serialization
|
brute force
graphs
|
2100
|
| 2052-C |
Cactus without Bridges
|
constructive algorithms
math
|
3500
|
| 2052-B |
BitBitJump
|
|
2400
|
| 2052-A |
Adrenaline Rush
|
constructive algorithms
|
1600
|
| 2051-G |
Snakes
|
bitmasks
dp
dsu
+1
|
2100
|
| 2051-F |
Joker
|
brute force
greedy
implementation
+1
|
2000
|
| 2051-E |
Best Price
|
binary search
brute force
data structures
+2
|
1600
|
| 2051-D |
Counting Pairs
|
binary search
sortings
two pointers
|
1200
|
| 2051-C |
Preparing for the Exam
|
constructive algorithms
implementation
|
1000
|
| 2051-B |
Journey
|
binary search
math
|
800
|
| 2051-A |
Preparing for the Olympiad
|
greedy
|
800
|
| 2050-G |
Tree Destruction
|
dfs and similar
dp
trees
|
1900
|
| 2050-F |
Maximum modulo equality
|
data structures
divide and conquer
math
+1
|
1700
|
| 2050-E |
Three Strings
|
dp
implementation
strings
|
1500
|
| 2050-D |
Digital string maximization
|
brute force
greedy
math
+1
|
1300
|
| 2050-C |
Uninteresting Number
|
brute force
dp
math
|
1200
|
| 2050-B |
Transfusion
|
brute force
greedy
math
|
1100
|
| 2050-A |
Line Breaks
|
implementation
|
800
|
| 2049-F |
MEX OR Mania
|
bitmasks
brute force
data structures
+2
|
2700
|
| 2049-E |
Broken Queries
|
binary search
bitmasks
brute force
+3
|
2400
|
| 2049-D |
Shift + Esc
|
brute force
dp
|
1900
|
| 2049-C |
MEX Cycle
|
brute force
constructive algorithms
greedy
+1
|
1500
|