| 2211-G |
Rational Bubble Sort
|
constructive algorithms
geometry
greedy
|
2900
|
| 2211-F |
Learning Binary Search
|
combinatorics
divide and conquer
dp
+1
|
2400
|
| 2211-E |
Minimum Path Cover
|
brute force
dp
greedy
+4
|
2500
|
| 2211-D |
AND-array
|
bitmasks
combinatorics
math
|
1900
|
| 2211-C2 |
Equal Multisets (Hard Version)
|
constructive algorithms
dsu
greedy
|
1800
|
| 2211-C1 |
Equal Multisets (Easy Version)
|
binary search
brute force
greedy
+1
|
1300
|
| 2211-B |
Mickey Mouse Constructive
|
constructive algorithms
dp
greedy
+1
|
1100
|
| 2211-A |
Antimedian Deletion
|
implementation
math
|
800
|
| 2210-F |
A Simple Problem
|
binary search
data structures
greedy
+2
|
2700
|
| 2210-E |
Binary Strings are Simple?
|
constructive algorithms
implementation
interactive
+1
|
2700
|
| 2210-D |
A Simple RBS Problem
|
constructive algorithms
math
strings
+1
|
2100
|
| 2210-C2 |
A Simple GCD Problem (Hard Version)
|
dp
greedy
number theory
|
2100
|
| 2210-C1 |
A Simple GCD Problem (Easy Version)
|
greedy
number theory
|
1200
|
| 2210-B |
Simply Sitting on Chairs
|
data structures
greedy
|
900
|
| 2210-A |
A Simple Sequence
|
constructive algorithms
dp
greedy
+1
|
800
|
| 2209-F |
Dynamic Values And Maximum Sum
|
data structures
greedy
implementation
+1
|
2700
|
| 2209-E |
A Trivial String Problem
|
brute force
dp
hashing
+2
|
2200
|
| 2209-D |
Ghostfires
|
constructive algorithms
greedy
|
1800
|
| 2209-C |
Find the Zero
|
constructive algorithms
interactive
|
1400
|
| 2209-B |
Array
|
greedy
|
900
|
| 2209-A |
Flip Flops
|
greedy
|
800
|
| 2208-E |
Counting Cute Arrays
|
combinatorics
dp
|
2700
|
| 2208-D2 |
Tree Orientation (Hard Version)
|
dfs and similar
dsu
graphs
+3
|
2200
|
| 2208-D1 |
Tree Orientation (Easy Version)
|
constructive algorithms
dfs and similar
dsu
+4
|
1800
|
| 2208-C |
Stamina and Tasks
|
dp
greedy
math
|
1300
|
| 2208-B |
Cyclists
|
brute force
games
greedy
+3
|
1100
|
| 2208-A |
Bingo Candies
|
constructive algorithms
math
|
800
|
| 2207-H3 |
Bowser's Castle (Hard Version)
|
constructive algorithms
divide and conquer
interactive
+2
|
—
|
| 2207-H2 |
Bowser's Castle (Medium Version)
|
constructive algorithms
divide and conquer
interactive
+2
|
—
|
| 2207-H1 |
Bowser's Castle (Easy Version)
|
binary search
constructive algorithms
divide and conquer
+3
|
—
|
| 2207-G |
Toothless
|
constructive algorithms
dfs and similar
dsu
|
3300
|
| 2207-F |
Hanabi
|
binary search
data structures
dp
+5
|
2900
|
| 2207-E2 |
N-MEX (Counting Version)
|
combinatorics
constructive algorithms
math
|
2400
|
| 2207-E1 |
N-MEX (Constructive Version)
|
constructive algorithms
greedy
|
2100
|
| 2207-D |
Boxed Like a Fish
|
dfs and similar
dp
games
+2
|
2200
|
| 2207-C |
Where's My Water?
|
data structures
divide and conquer
dp
+1
|
1600
|
| 2207-B |
One Night At Freddy's
|
games
greedy
sortings
|
1600
|
| 2207-A |
1-1
|
greedy
strings
|
800
|
| 2206-M |
Deformed Balance
|
|
2900
|
| 2206-L |
Onion
|
|
3500
|
| 2206-K |
Time Display Stickers
|
binary search
|
1300
|
| 2206-J |
Worldwide Playlist
|
math
|
1700
|
| 2206-I |
Growth Factor
|
combinatorics
dp
math
+1
|
2900
|
| 2206-H |
Reflect Sort
|
number theory
|
1800
|
| 2206-G |
Extra Transition
|
graphs
|
3100
|
| 2206-F |
Minesweeper String
|
fft
number theory
|
2400
|
| 2206-E |
Parallel Sums
|
data structures
geometry
|
2500
|
| 2206-D |
Christmas Tree Un-decoration
|
data structures
dp
trees
|
2600
|
| 2206-C |
Upside Down Dijkstra
|
dfs and similar
|
2200
|
| 2206-B |
Subtree Removal Game
|
binary search
games
trees
|
2500
|