| 2236-G |
Criterion in Burlandia
|
binary search
bitmasks
brute force
+5
|
—
|
| 2236-F2 |
Elections in Saransk (hard version)
|
combinatorics
dp
fft
+2
|
—
|
| 2236-F1 |
Elections in Saransk (easy version)
|
number theory
|
—
|
| 2236-E |
Friendly Gifts
|
brute force
dp
|
—
|
| 2236-D |
Brand New Tatar TV Show
|
binary search
constructive algorithms
dp
+2
|
—
|
| 2236-C |
Omsk Programmers
|
brute force
greedy
math
|
—
|
| 2236-B |
Tatar TV Show
|
greedy
math
strings
|
—
|
| 2236-A |
Games on the Train
|
greedy
math
|
—
|
| 2234-G |
Stripe, Token and Two Players
|
data structures
dp
games
|
2700
|
| 2234-F |
Vessels, Heights and Two Versions (Hard Version)
|
data structures
dfs and similar
dsu
+3
|
1900
|
| 2234-E |
Vlad, Misha and Two Arrays
|
brute force
combinatorics
dfs and similar
+2
|
2100
|
| 2234-D |
XOR, Expression and Two Binary Numbers
|
bitmasks
divide and conquer
dp
+2
|
1500
|
| 2234-C |
Vessels, Heights and Two Versions (Easy Version)
|
dfs and similar
dsu
greedy
+2
|
1200
|
| 2234-B |
Palindrome, Twelve and Two Terms
|
brute force
constructive algorithms
math
|
800
|
| 2234-A |
Euclid, Sequence and Two Numbers
|
math
number theory
sortings
|
800
|
| 2233-F |
Shortest GCD Paths
|
dp
graphs
math
+2
|
2800
|
| 2233-E2 |
Permutation Transmission (Difficult Version)
|
bitmasks
combinatorics
sortings
|
2300
|
| 2233-E1 |
Permutation Transmission (Easy Version)
|
bitmasks
combinatorics
sortings
|
2200
|
| 2233-D |
Goods on the Shelf
|
brute force
data structures
implementation
+1
|
1900
|
| 2233-C |
Cost of a Bracket Sequence
|
brute force
dp
greedy
|
1400
|
| 2233-B |
Different Distances
|
constructive algorithms
|
900
|
| 2233-A |
AI Project Development
|
brute force
math
|
800
|
| 2232-F |
The Cake Is a Lie
|
greedy
math
number theory
|
3000
|
| 2232-E |
Snaking Arrangement
|
combinatorics
constructive algorithms
|
2600
|
| 2232-D |
Magical Tiered Cake
|
constructive algorithms
dfs and similar
dp
+1
|
2000
|
| 2232-C2 |
Seating Arrangement (Hard Version)
|
binary search
greedy
math
+1
|
1500
|
| 2232-C1 |
Seating Arrangement (Easy Version)
|
binary search
dp
greedy
+1
|
1300
|
| 2232-B |
Cake Leveling
|
binary search
greedy
math
|
900
|
| 2232-A |
Convergence
|
greedy
sortings
|
800
|
| 2231-F |
Quadratic Jumps
|
brute force
constructive algorithms
greedy
+2
|
2600
|
| 2231-E |
Graph Cutting
|
dfs and similar
dp
math
+1
|
2300
|
| 2231-D |
Maximum Prefix Sums
|
constructive algorithms
greedy
implementation
+1
|
1900
|
| 2231-C |
Chipmunk Theo and Equality
|
implementation
sortings
|
1400
|
| 2231-B |
Another Sorting Problem
|
constructive algorithms
|
1100
|
| 2231-A |
Construct an Array
|
constructive algorithms
|
800
|
| 2230-F |
Game on Growing Tree
|
binary search
dfs and similar
divide and conquer
+4
|
2700
|
| 2230-E |
Minimum Influence
|
binary search
data structures
greedy
+4
|
2100
|
| 2230-D |
Good Schedule
|
dp
greedy
|
1700
|
| 2230-C |
Arrange the Numbers in a Circle
|
constructive algorithms
implementation
math
|
1300
|
| 2230-B |
Digit String
|
greedy
implementation
math
|
1000
|
| 2230-A |
Optimal Purchase
|
implementation
math
|
800
|
| 2229-I |
The Endians
|
dp
trees
|
3400
|
| 2229-H |
Wowee Binary String
|
combinatorics
dp
strings
|
3200
|
| 2229-G |
Roadworks
|
binary search
data structures
dp
+2
|
2900
|
| 2229-F |
Load Unbalancing
|
binary search
bitmasks
dp
+1
|
2400
|
| 2229-E |
Deconstruction Tree
|
combinatorics
data structures
dp
+2
|
2100
|
| 2229-D |
Me When Median Problem
|
binary search
greedy
|
1700
|
| 2229-C2 |
We Be Flipping (Hard Version)
|
constructive algorithms
dp
greedy
|
1400
|
| 2229-C1 |
We Be Flipping (Easy Version)
|
constructive algorithms
greedy
|
900
|
| 2229-B |
Absolute Cinema
|
greedy
math
|
800
|