| 2189-E |
Majority Wins?
|
constructive algorithms
greedy
math
+1
|
2600
|
| 2189-D2 |
Little String (Hard Version)
|
combinatorics
dp
greedy
+2
|
2200
|
| 2189-D1 |
Little String (Easy Version)
|
combinatorics
dp
greedy
+2
|
1900
|
| 2189-C2 |
XOR-convenience (Hard Version)
|
bitmasks
constructive algorithms
math
|
1800
|
| 2189-C1 |
XOR Convenience (Easy Version)
|
bitmasks
constructive algorithms
math
|
1300
|
| 2189-B |
The Curse of the Frog
|
constructive algorithms
greedy
math
|
1200
|
| 2189-A |
Table with Numbers
|
greedy
implementation
|
800
|
| 2188-B |
Seats
|
greedy
|
1000
|
| 2188-A |
Divisible Permutation
|
constructive algorithms
|
800
|
| 2187-G |
Many Cartesian Trees
|
greedy
sortings
trees
|
3500
|
| 2187-F2 |
Al Fine (Counting Version)
|
dp
trees
|
3500
|
| 2187-F1 |
Al Fine (Maximizing Version)
|
binary search
data structures
divide and conquer
+1
|
3100
|
| 2187-E |
Doors and Keys
|
brute force
data structures
dp
|
3500
|
| 2187-D |
Cool Problem
|
bitmasks
dp
math
|
2600
|
| 2187-C |
Jerry and Tom
|
data structures
dfs and similar
dsu
+4
|
2300
|
| 2187-B |
Shortest Statement Ever
|
bitmasks
constructive algorithms
dp
+1
|
1800
|
| 2187-A |
Restricted Sorting
|
greedy
sortings
|
1300
|
| 2185-H |
BattleCows 2
|
binary search
brute force
data structures
+2
|
2500
|
| 2185-G |
Mixing MEXes
|
data structures
implementation
math
|
1800
|
| 2185-F |
BattleCows
|
data structures
divide and conquer
implementation
|
1700
|
| 2185-E |
The Robotic Rush
|
binary search
greedy
implementation
+1
|
1500
|
| 2185-D |
OutOfMemoryError
|
data structures
implementation
math
+1
|
1100
|
| 2185-C |
Shifted MEX
|
implementation
sortings
|
900
|
| 2185-B |
Prefix Max
|
greedy
|
800
|
| 2185-A |
Perfect Root
|
constructive algorithms
math
|
800
|
| 2184-G |
Nastiness of Segments
|
binary search
data structures
|
1900
|
| 2184-F |
Cherry Tree
|
dfs and similar
dp
graphs
+1
|
1900
|
| 2184-E |
Exquisite Array
|
combinatorics
data structures
dsu
+1
|
1800
|
| 2184-D |
Unfair Game
|
combinatorics
dp
math
|
1600
|
| 2184-C |
Huge Pile
|
binary search
dfs and similar
dp
+2
|
1100
|
| 2184-B |
Hourglass
|
math
|
1100
|
| 2184-A |
Social Experiment
|
math
|
800
|
| 2183-I2 |
Pairs Flipping (Hard Version)
|
constructive algorithms
|
3500
|
| 2183-I1 |
Pairs Flipping (Easy Version)
|
constructive algorithms
|
3500
|
| 2183-H |
Minimise Cost
|
binary search
dp
greedy
+1
|
3500
|
| 2183-G |
Snake Instructions
|
constructive algorithms
greedy
interactive
|
3200
|
| 2183-F |
Jumping Man
|
brute force
combinatorics
dfs and similar
+2
|
2500
|
| 2183-E |
LCM is Legendary Counting Master
|
dp
math
number theory
|
2100
|
| 2183-D2 |
Tree Coloring (Hard Version)
|
combinatorics
constructive algorithms
data structures
+4
|
2100
|
| 2183-D1 |
Tree Coloring (Easy Version)
|
constructive algorithms
dfs and similar
greedy
+1
|
1500
|
| 2183-C |
War Strategy
|
binary search
greedy
math
+1
|
1500
|
| 2183-B |
Yet Another MEX Problem
|
constructive algorithms
greedy
|
1100
|
| 2183-A |
Binary Array Game
|
games
|
800
|
| 2182-G |
Short Garland
|
combinatorics
data structures
dfs and similar
+2
|
2800
|
| 2182-F2 |
Christmas Reindeer (hard version)
|
bitmasks
brute force
combinatorics
+3
|
2500
|
| 2182-F1 |
Christmas Reindeer (easy version)
|
bitmasks
brute force
combinatorics
+2
|
2300
|
| 2182-E |
New Year's Gifts
|
binary search
data structures
greedy
+2
|
1800
|
| 2182-D |
Christmas Tree Decoration
|
combinatorics
dp
greedy
+1
|
1600
|
| 2182-C |
Production of Snowmen
|
brute force
combinatorics
dp
|
1200
|
| 2182-B |
New Year Cake
|
brute force
|
800
|