| 2107-F2 |
Cycling (Hard Version)
|
binary search
brute force
data structures
+2
|
2800
|
| 2107-F1 |
Cycling (Easy Version)
|
binary search
brute force
dp
+1
|
2300
|
| 2107-E |
Ain and Apple Tree
|
binary search
constructive algorithms
greedy
+2
|
2600
|
| 2107-D |
Apple Tree Traversing
|
brute force
dfs and similar
greedy
+2
|
2100
|
| 2107-C |
Maximum Subarray Sum
|
binary search
constructive algorithms
dp
+2
|
1500
|
| 2107-B |
Apples in Boxes
|
games
greedy
math
|
1100
|
| 2107-A |
LRC and VIP
|
greedy
number theory
|
800
|
| 2106-G2 |
Baudelaire (hard version)
|
binary search
dfs and similar
divide and conquer
+3
|
2500
|
| 2106-G1 |
Baudelaire (easy version)
|
binary search
constructive algorithms
divide and conquer
+3
|
2200
|
| 2106-F |
Goblin
|
dfs and similar
dp
dsu
+2
|
1900
|
| 2106-E |
Wolf
|
binary search
greedy
math
|
1800
|
| 2106-D |
Flower Boy
|
binary search
dp
greedy
+1
|
1500
|
| 2106-C |
Cherry Bomb
|
greedy
math
sortings
|
1000
|
| 2106-B |
St. Chroma
|
constructive algorithms
greedy
math
|
900
|
| 2106-A |
Dr. TC
|
brute force
math
|
800
|
| 2104-G |
Modulo 3
|
data structures
divide and conquer
dsu
+2
|
2700
|
| 2104-F |
Numbers and Strings
|
binary search
brute force
dfs and similar
+3
|
2600
|
| 2104-E |
Unpleasant Strings
|
binary search
dp
greedy
+1
|
1700
|
| 2104-D |
Array and GCD
|
binary search
greedy
math
+1
|
1400
|
| 2104-C |
Card Game
|
brute force
constructive algorithms
games
+2
|
1100
|
| 2104-B |
Move to the End
|
brute force
data structures
dp
+2
|
1000
|
| 2104-A |
Three Decks
|
math
|
800
|
| 2103-F |
Maximize Nor
|
bitmasks
data structures
dp
+2
|
2600
|
| 2103-E |
Keep the Sum
|
constructive algorithms
implementation
two pointers
|
2600
|
| 2103-D |
Local Construction
|
constructive algorithms
dfs and similar
implementation
+1
|
2000
|
| 2103-C |
Median Splits
|
binary search
greedy
implementation
+1
|
1600
|
| 2103-B |
Binary Typewriter
|
greedy
math
|
1100
|
| 2103-A |
Common Multiple
|
brute force
greedy
implementation
+1
|
800
|
| 2102-B |
The Picky Cat
|
implementation
sortings
|
900
|
| 2102-A |
Dinner Time
|
constructive algorithms
math
|
900
|
| 2101-F |
Shoo Shatters the Sunshine
|
combinatorics
dp
trees
|
3300
|
| 2101-E |
Kia Bakes a Cake
|
data structures
dp
greedy
+1
|
3100
|
| 2101-D |
Mani and Segments
|
data structures
implementation
sortings
+1
|
2500
|
| 2101-C |
23 Kingdom
|
binary search
brute force
data structures
+3
|
2200
|
| 2101-B |
Quartet Swapping
|
brute force
data structures
divide and conquer
+2
|
1800
|
| 2101-A |
Mex in the Grid
|
constructive algorithms
implementation
|
1300
|
| 2098-B |
Sasha and the Apartment Purchase
|
math
sortings
|
1400
|
| 2098-A |
Vadim's Collection
|
brute force
greedy
|
800
|
| 2097-F |
Lost Luggage
|
dp
flows
|
3500
|
| 2097-E |
Clearing the Snowdrift
|
data structures
dfs and similar
dp
+1
|
3100
|
| 2097-D |
Homework
|
bitmasks
math
matrices
|
2800
|
| 2097-C |
Bermuda Triangle
|
chinese remainder theorem
geometry
implementation
+2
|
2400
|
| 2097-B |
Baggage Claim
|
combinatorics
dfs and similar
dp
+5
|
2300
|
| 2097-A |
Sports Betting
|
2-sat
brute force
math
+1
|
1400
|
| 2096-H |
Wonderful XOR Problem
|
bitmasks
combinatorics
dp
+2
|
3200
|
| 2096-G |
Wonderful Guessing Game
|
bitmasks
constructive algorithms
interactive
|
3200
|
| 2096-F |
Wonderful Impostors
|
data structures
implementation
two pointers
|
3100
|
| 2096-E |
Wonderful Teddy Bears
|
greedy
implementation
sortings
|
2400
|
| 2096-D |
Wonderful Lightbulbs
|
combinatorics
constructive algorithms
math
|
2000
|
| 2096-C |
Wonderful City
|
dp
implementation
|
1700
|