| 2137-F |
Prefix Maximum Invariance
|
binary search
combinatorics
data structures
+1
|
1900
|
| 2137-E |
Mexification
|
brute force
implementation
math
|
1500
|
| 2137-D |
Replace with Occurrences
|
constructive algorithms
|
1200
|
| 2137-C |
Maximum Even Sum
|
brute force
greedy
implementation
+1
|
1100
|
| 2137-B |
Fun Permutation
|
constructive algorithms
math
number theory
|
900
|
| 2137-A |
Collatz Conjecture
|
constructive algorithms
math
|
800
|
| 2136-B |
Like the Bitset
|
constructive algorithms
greedy
two pointers
|
900
|
| 2136-A |
In the Dream
|
greedy
math
|
800
|
| 2135-F |
To the Infinity
|
data structures
hashing
math
+1
|
3500
|
| 2135-E2 |
Beyond the Palindrome (Hard Version)
|
combinatorics
dp
math
+1
|
3500
|
| 2135-E1 |
Beyond the Palindrome (Easy Version)
|
combinatorics
dp
math
|
3300
|
| 2135-D2 |
From the Unknown (Hard Version)
|
brute force
constructive algorithms
interactive
+1
|
2500
|
| 2135-D1 |
From the Unknown (Easy Version)
|
constructive algorithms
interactive
math
|
2100
|
| 2135-C |
By the Assignment
|
binary search
bitmasks
combinatorics
+4
|
2000
|
| 2135-B |
For the Champion
|
constructive algorithms
interactive
math
|
1700
|
| 2135-A |
Against the Difference
|
data structures
dp
|
1200
|
| 2134-F |
Permutation Oddness
|
combinatorics
dp
math
|
2900
|
| 2134-E |
Power Boxes
|
constructive algorithms
dp
implementation
+1
|
2300
|
| 2134-D |
Sliding Tree
|
constructive algorithms
dfs and similar
greedy
+2
|
2300
|
| 2134-C |
Even Larger
|
brute force
greedy
implementation
|
1200
|
| 2134-B |
Add 0 or K
|
constructive algorithms
math
number theory
|
1200
|
| 2134-A |
Painting With Two Colors
|
constructive algorithms
implementation
math
|
800
|
| 2133-F |
Flint and Steel
|
data structures
dp
graphs
|
3000
|
| 2133-E |
I Yearned For The Mines
|
constructive algorithms
dfs and similar
dp
+2
|
2500
|
| 2133-D |
Chicken Jockey
|
dp
greedy
|
1900
|
| 2133-C |
The Nether
|
graphs
interactive
|
1400
|
| 2133-B |
Villagers
|
greedy
|
800
|
| 2133-A |
Redstone?
|
brute force
data structures
implementation
+1
|
800
|
| 2132-G |
Famous Choreographer
|
hashing
implementation
strings
|
2600
|
| 2132-F |
Rada and the Chamomile Valley
|
dfs and similar
graphs
shortest paths
|
2100
|
| 2132-E |
Arithmetics Competition
|
binary search
data structures
greedy
+2
|
1700
|
| 2132-D |
From 1 to Infinity
|
binary search
dp
implementation
+1
|
1600
|
| 2132-C2 |
The Cunning Seller (hard version)
|
binary search
greedy
math
|
1400
|
| 2132-C1 |
The Cunning Seller (easy version)
|
greedy
math
|
1000
|
| 2132-B |
The Secret Number
|
math
|
900
|
| 2132-A |
Homework
|
brute force
implementation
strings
|
800
|
| 2131-H |
Sea, You & copriMe
|
brute force
constructive algorithms
graphs
+3
|
2600
|
| 2131-G |
Wafu!
|
bitmasks
brute force
data structures
+3
|
2000
|
| 2131-F |
Unjust Binary Life
|
binary search
data structures
greedy
+3
|
1900
|
| 2131-E |
Adjacent XOR
|
brute force
greedy
|
1400
|
| 2131-D |
Arboris Contractio
|
data structures
graphs
greedy
+1
|
1400
|
| 2131-C |
Make it Equal
|
math
number theory
|
1100
|
| 2131-B |
Alternating Series
|
constructive algorithms
greedy
math
|
800
|
| 2131-A |
Lever
|
math
|
800
|
| 2130-B |
Pathless
|
constructive algorithms
|
1100
|
| 2130-A |
Submission is All You Need
|
greedy
math
|
800
|
| 2129-F2 |
Top-K Tracker (Hard Version)
|
interactive
|
3500
|
| 2129-F1 |
Top-K Tracker (Easy Version)
|
interactive
|
3500
|
| 2129-E |
Induced Subgraph Queries
|
data structures
graphs
sortings
|
3000
|
| 2129-D |
Permutation Blackhole
|
brute force
combinatorics
dp
+2
|
2600
|