| 2225-G |
Simple Problem
|
graphs
greedy
number theory
|
—
|
| 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
|
chinese remainder theorem
interactive
math
+1
|
—
|
| 2220-B |
OIE Excursion
|
greedy
|
—
|
| 2220-A |
Blocked
|
greedy
sortings
|
—
|
| 2219-E |
Weird Chessboard
|
constructive algorithms
math
|
—
|
| 2219-D |
MEX Replacement on Tree
|
data structures
implementation
math
+1
|
—
|
| 2219-C |
Coloring a Red Black Tree
|
dfs and similar
dp
greedy
+3
|
—
|
| 2219-B2 |
Unique Values (Hard version)
|
binary search
bitmasks
constructive algorithms
+1
|
—
|
| 2219-B1 |
Unique Values (Easy version)
|
binary search
constructive algorithms
divide and conquer
+2
|
—
|
| 2219-A |
Grid L
|
brute force
constructive algorithms
math
+1
|
—
|
| 2218-G |
The 67th Iteration of "Counting is Fun"
|
implementation
math
|
1800
|
| 2218-F |
The 67th Tree Problem
|
constructive algorithms
implementation
trees
|
1500
|
| 2218-E |
The 67th XOR Problem
|
binary search
bitmasks
brute force
|
1200
|
| 2218-D |
The 67th OEIS Problem
|
constructive algorithms
greedy
math
+1
|
1100
|
| 2218-C |
The 67th Permutation Problem
|
constructive algorithms
greedy
math
|
800
|
| 2218-B |
The 67th 6-7 Integer Problem
|
greedy
math
|
800
|
| 2218-A |
The 67th Integer Problem
|
brute force
games
implementation
+1
|
800
|
| 2217-H |
Closer
|
dfs and similar
dp
trees
|
2800
|
| 2217-G |
Down the Pivot
|
combinatorics
dp
math
+1
|
2600
|
| 2217-F |
Interval Game
|
bitmasks
combinatorics
constructive algorithms
+5
|
2300
|
| 2217-E |
Definitely Larger
|
binary search
constructive algorithms
data structures
+3
|
2000
|
| 2217-D |
Flip the Bit (Hard Version)
|
greedy
implementation
math
|
1900
|
| 2217-C |
Grid Covering
|
chinese remainder theorem
math
number theory
|
1300
|
| 2217-B |
Flip the Bit (Easy Version)
|
greedy
implementation
|
1000
|
| 2217-A |
The Equalizer
|
math
|
800
|
| 2216-B |
THU Packing Puzzle
|
greedy
|
1300
|
| 2216-A |
Course Wishes
|
greedy
|
900
|
| 2215-G |
Maze
|
trees
|
3500
|
| 2215-F |
Research
|
games
|
3500
|
| 2215-E |
Star Map
|
constructive algorithms
data structures
geometry
+2
|
2700
|
| 2215-D |
EXPloration, EXPloitation, and Gain Some EXPerience!
|
bitmasks
brute force
dp
+2
|
2800
|
| 2215-C |
Oriented Journey
|
bitmasks
brute force
communication
+4
|
2200
|
| 2215-B |
RReeppeettiittiioonn
|
binary search
brute force
implementation
+2
|
2000
|
| 2215-A |
Interval Mod
|
constructive algorithms
dp
greedy
+1
|
1700
|
| 2214-J |
Special Problem
|
*special
brute force
games
+1
|
—
|
| 2214-I |
You Are a Robot
|
*special
|
—
|
| 2214-H |
Double Vision
|
*special
|
—
|
| 2214-G |
Anomaly
|
*special
communication
|
—
|
| 2214-F |
Numbers
|
*special
|
—
|
| 2214-E |
Shortest Paths
|
*special
shortest paths
|
—
|
| 2214-D |
Neural Feud
|
*special
strings
|
—
|
| 2214-C |
And?
|
*special
bitmasks
|
—
|
| 2214-B |
Are You Smiling?
|
*special
strings
|
—
|
| 2214-A |
Odd One Out
|
*special
graph matchings
implementation
|
—
|
| 2211-H |
Median Deletion
|
|
3500
|