| 2227-H |
Fallen Leaves
|
dfs and similar
dp
trees
|
—
|
| 2227-G |
Drowning
|
binary search
data structures
math
|
—
|
| 2227-F |
It Just Keeps Going Sideways
|
binary search
data structures
dp
+2
|
—
|
| 2227-E |
It All Went Sideways
|
binary search
data structures
dp
+1
|
—
|
| 2227-D |
Palindromex
|
binary search
brute force
constructive algorithms
+4
|
—
|
| 2227-C |
Snowfall
|
constructive algorithms
math
|
—
|
| 2227-B |
Party Monster
|
greedy
|
—
|
| 2227-A |
Koshary
|
implementation
math
|
—
|
| 2226-G |
Stop Spot
|
implementation
strings
trees
|
—
|
| 2226-F |
Inversion Invasion
|
math
number theory
|
—
|
| 2226-E |
Mental Monumental (Hard Version)
|
data structures
greedy
math
+1
|
—
|
| 2226-D |
Reserved Reversals
|
constructive algorithms
dp
greedy
+1
|
—
|
| 2226-C |
Mental Monumental (Easy Version)
|
binary search
data structures
greedy
+2
|
—
|
| 2226-B |
Everything Everywhere
|
greedy
math
number theory
|
—
|
| 2226-A |
Disturbing Distribution
|
greedy
math
|
—
|
| 2225-G |
Simple Problem
|
brute force
graphs
greedy
+1
|
—
|
| 2225-F |
String Cutting
|
binary search
brute force
greedy
+3
|
—
|
| 2225-E |
Covering Points with Circles
|
constructive algorithms
geometry
math
|
—
|
| 2225-D |
Exceptional Segments
|
bitmasks
brute force
math
|
—
|
| 2225-C |
Red-Black Pairs
|
dp
greedy
|
—
|
| 2225-B |
Alternating String
|
brute force
greedy
|
—
|
| 2225-A |
A Number Between Two Others
|
greedy
math
|
—
|
| 2224-B |
Zhily and Mex and Max
|
constructive algorithms
greedy
math
+1
|
—
|
| 2224-A |
Zhily and Array Operating
|
constructive algorithms
greedy
|
—
|
| 2223-F |
Zhily and Colorful Strings
|
divide and conquer
fft
math
|
—
|
| 2223-E |
Zhily and Permutation
|
data structures
divide and conquer
trees
|
—
|
| 2223-D |
Zhily and Cycle
|
graphs
greedy
|
—
|
| 2223-C |
Zhily and Signpost
|
binary search
brute force
chinese remainder theorem
+4
|
—
|
| 2223-B |
Zhily and Barknights
|
binary search
data structures
dp
+3
|
—
|
| 2223-A |
Zhily and Bracket Swapping
|
constructive algorithms
greedy
|
—
|
| 2222-H |
Counting Sort?
|
brute force
combinatorics
dp
|
—
|
| 2222-G |
Statistics on Tree
|
binary search
brute force
dfs and similar
+3
|
—
|
| 2222-F |
Building Tree
|
data structures
divide and conquer
dsu
+2
|
—
|
| 2222-E |
Seek the Truth
|
binary search
bitmasks
constructive algorithms
+1
|
—
|
| 2222-D |
Permutation Construction
|
constructive algorithms
data structures
sortings
|
—
|
| 2222-C |
Median Partition
|
dp
math
|
—
|