| 2129-C3 |
Interactive RBS (Hard Version)
|
binary search
bitmasks
constructive algorithms
+2
|
2300
|
| 2129-C2 |
Interactive RBS (Medium Version)
|
binary search
bitmasks
constructive algorithms
+1
|
2000
|
| 2129-C1 |
Interactive RBS (Easy Version)
|
binary search
bitmasks
constructive algorithms
+1
|
1900
|
| 2129-B |
Stay or Mirror
|
brute force
data structures
dp
+2
|
1600
|
| 2129-A |
Double Perspective
|
constructive algorithms
dp
dsu
+3
|
1300
|
| 2128-F |
Strict Triangle
|
graphs
greedy
shortest paths
|
3200
|
| 2128-E2 |
Submedians (Hard Version)
|
binary search
constructive algorithms
data structures
+2
|
2600
|
| 2128-E1 |
Submedians (Easy Version)
|
binary search
data structures
dp
+2
|
1900
|
| 2128-D |
Sum of LDS
|
brute force
combinatorics
dp
+2
|
1600
|
| 2128-C |
Leftmost Below
|
greedy
math
|
1200
|
| 2128-B |
Deque Process
|
constructive algorithms
greedy
sortings
+1
|
1100
|
| 2128-A |
Recycling Center
|
greedy
sortings
|
800
|
| 2127-H |
23 Rises Again
|
brute force
dfs and similar
dp
+7
|
3100
|
| 2127-G2 |
Inter Active (Hard Version)
|
binary search
bitmasks
constructive algorithms
+5
|
3500
|
| 2127-G1 |
Inter Active (Easy Version)
|
binary search
constructive algorithms
interactive
+1
|
3400
|
| 2127-F |
Hamed and AghaBalaSar
|
brute force
combinatorics
dp
+2
|
2800
|
| 2127-E |
Ancient Tree
|
constructive algorithms
data structures
dfs and similar
+3
|
2100
|
| 2127-D |
Root was Built by Love, Broken by Destiny
|
combinatorics
dfs and similar
graphs
+1
|
1800
|
| 2127-C |
Trip Shopping
|
games
greedy
sortings
|
1400
|
| 2127-B |
Hamiiid, Haaamid... Hamid?
|
games
greedy
|
1300
|
| 2127-A |
Mix Mex Max
|
constructive algorithms
greedy
math
|
800
|
| 2126-G2 |
Big Wins! (hard version)
|
binary search
data structures
divide and conquer
+3
|
2400
|
| 2126-G1 |
Big Wins! (easy version)
|
binary search
data structures
dp
+2
|
2200
|
| 2126-F |
1-1-1, Free Tree!
|
brute force
data structures
dfs and similar
+3
|
2000
|
| 2126-E |
G-C-D, Unlucky!
|
math
number theory
|
1400
|
| 2126-D |
This Is the Last Time
|
data structures
greedy
sortings
|
1200
|
| 2126-C |
I Will Definitely Make It
|
greedy
sortings
|
1100
|
| 2126-B |
No Casino in the Mountains
|
dp
greedy
|
800
|
| 2126-A |
Only One Digit
|
brute force
implementation
math
|
800
|
| 2125-F |
Timofey and Docker
|
binary search
divide and conquer
dp
|
3000
|
| 2125-E |
Sets of Complementary Sums
|
brute force
combinatorics
dp
+2
|
2500
|
| 2125-D |
Segments Covering
|
dp
math
probabilities
|
1600
|
| 2125-C |
Count Good Numbers
|
bitmasks
combinatorics
math
+1
|
1100
|
| 2125-B |
Left and Down
|
math
number theory
|
900
|
| 2125-A |
Difficult Contest
|
constructive algorithms
implementation
sortings
+1
|
800
|
| 2124-I |
Lexicographic Partition
|
constructive algorithms
math
trees
|
3500
|
| 2124-H |
Longest Good Subsequence
|
dp
math
trees
|
3400
|
| 2124-G |
Maximise Sum
|
binary search
data structures
|
3200
|
| 2124-F2 |
Appending Permutations (Hard Version)
|
combinatorics
dp
|
2800
|
| 2124-F1 |
Appending Permutations (Easy Version)
|
combinatorics
dp
|
2300
|
| 2124-E |
Make it Zero
|
constructive algorithms
greedy
math
|
2100
|
| 2124-D |
Make a Palindrome
|
greedy
sortings
two pointers
|
1700
|
| 2124-C |
Subset Multiplication
|
constructive algorithms
greedy
math
+1
|
1300
|
| 2124-B |
Minimise Sum
|
greedy
|
1000
|
| 2124-A |
Deranged Deletions
|
greedy
sortings
|
800
|
| 2123-G |
Modular Sorting
|
brute force
data structures
greedy
+3
|
2100
|
| 2123-F |
Minimize Fixed Points
|
constructive algorithms
number theory
|
1700
|
| 2123-E |
MEX Count
|
binary search
data structures
greedy
+2
|
1400
|
| 2123-D |
Binary String Battle
|
constructive algorithms
games
greedy
|
1200
|
| 2123-C |
Prefix Min and Suffix Max
|
brute force
data structures
|
1000
|