| 2160-B |
Distinct Elements
|
greedy
math
|
1100
|
| 2160-A |
MEX Partition
|
math
|
800
|
| 2159-F |
Grand Finale: Snakes
|
binary search
interactive
ternary search
|
3500
|
| 2159-E |
Super-Short-Polynomial-San
|
math
meet-in-the-middle
|
3500
|
| 2159-D2 |
Inverse Minimum Partition (Hard Version)
|
dp
greedy
math
|
3200
|
| 2159-D1 |
Inverse Minimum Partition (Easy Version)
|
binary search
brute force
dp
+4
|
2500
|
| 2159-C |
Twin Polynomials
|
combinatorics
graph matchings
math
|
2300
|
| 2159-B |
Rectangles
|
brute force
data structures
dp
+4
|
2100
|
| 2159-A |
MAD Interactive Problem
|
constructive algorithms
implementation
interactive
|
1700
|
| 2158-F2 |
Distinct GCDs (Hard Version)
|
combinatorics
constructive algorithms
graphs
+2
|
3000
|
| 2158-F1 |
Distinct GCDs (Easy Version)
|
constructive algorithms
graphs
math
+1
|
2600
|
| 2158-E |
Sink
|
data structures
divide and conquer
dsu
+2
|
2600
|
| 2158-D |
Palindrome Flipping
|
brute force
constructive algorithms
graphs
+3
|
2000
|
| 2158-C |
Annoying Game
|
dp
games
greedy
|
1400
|
| 2158-B |
Split
|
constructive algorithms
greedy
math
|
1200
|
| 2158-A |
Suspension
|
constructive algorithms
greedy
math
|
800
|
| 2157-I |
Hyper Smawk Bros
|
dp
games
|
3500
|
| 2157-H |
Keygen 3
|
brute force
combinatorics
constructive algorithms
+2
|
3200
|
| 2157-G |
Isaac's Queries
|
bitmasks
brute force
constructive algorithms
+7
|
2800
|
| 2157-F |
Git Gud
|
brute force
constructive algorithms
divide and conquer
+2
|
2400
|
| 2157-E |
Adjusting Drones
|
binary search
brute force
data structures
+5
|
1900
|
| 2157-D |
Billion Players Game
|
binary search
greedy
math
+3
|
1600
|
| 2157-C |
Meximum Array 2
|
constructive algorithms
greedy
implementation
+1
|
1400
|
| 2157-B |
Expansion Plan 2
|
implementation
math
|
900
|
| 2157-A |
Dungeon Equilibrium
|
greedy
implementation
sortings
|
800
|
| 2156-F2 |
Strange Operation (Hard Version)
|
data structures
greedy
trees
|
3000
|
| 2156-F1 |
Strange Operation (Easy Version)
|
brute force
data structures
greedy
+2
|
2200
|
| 2156-E |
Best Time to Buy and Sell Stock
|
binary search
brute force
data structures
+4
|
2500
|
| 2156-D |
Find the Last Number
|
binary search
bitmasks
constructive algorithms
+1
|
1900
|
| 2156-C |
Maximum GCD on Whiteboard
|
greedy
math
number theory
|
1400
|
| 2156-B |
Strange Machine
|
binary search
brute force
greedy
+1
|
1000
|
| 2156-A |
Pizza Time
|
brute force
constructive algorithms
greedy
|
800
|
| 2155-F |
Juan's Colorful Tree
|
data structures
dfs and similar
dsu
+3
|
2800
|
| 2155-E |
Mimo & Yuyu
|
games
greedy
math
|
2200
|
| 2155-D |
Batteries
|
brute force
constructive algorithms
graph matchings
+3
|
1800
|
| 2155-C |
The Ancient Wizards' Capes
|
brute force
greedy
implementation
|
1500
|
| 2155-B |
Abraham's Great Escape
|
constructive algorithms
graphs
|
1100
|
| 2155-A |
El fucho
|
implementation
math
|
800
|
| 2154-F2 |
Bombing (Hard Version)
|
combinatorics
dp
|
3300
|
| 2154-F1 |
Bombing (Easy Version)
|
brute force
combinatorics
constructive algorithms
+2
|
2700
|
| 2154-E |
No Mind To Think
|
binary search
divide and conquer
greedy
+3
|
2500
|
| 2154-D |
Catshock
|
constructive algorithms
dfs and similar
graphs
+2
|
1900
|
| 2154-C2 |
No Cost Too Great (Hard Version)
|
greedy
math
number theory
|
2000
|
| 2154-C1 |
No Cost Too Great (Easy Version)
|
greedy
implementation
math
+1
|
1400
|
| 2154-B |
Make it Zigzag
|
constructive algorithms
greedy
|
1000
|
| 2154-A |
Notelock
|
greedy
two pointers
|
800
|
| 2153-F |
Odd Queries on Odd Array
|
bitmasks
brute force
data structures
+2
|
2900
|
| 2153-E |
Zero Trailing Factorial
|
brute force
math
number theory
|
2400
|
| 2153-D |
Not Alone
|
dp
greedy
|
1800
|
| 2153-C |
Symmetrical Polygons
|
constructive algorithms
geometry
greedy
+2
|
1500
|