| 1866-L |
Lihmuf Balling
|
binary search
brute force
math
|
2400
|
| 1866-K |
Keen Tree Calculation
|
binary search
data structures
dp
+4
|
2500
|
| 1866-J |
Jackets and Packets
|
dp
|
2800
|
| 1866-I |
Imagination Castle
|
dp
games
two pointers
|
2300
|
| 1866-H |
Happy Sets
|
combinatorics
|
2100
|
| 1866-G |
Grouped Carriages
|
binary search
data structures
dp
+2
|
2100
|
| 1866-F |
Freak Joker Process
|
binary search
data structures
sortings
|
3100
|
| 1866-E |
Elevators of Tamem
|
dp
|
2700
|
| 1866-D |
Digital Wallet
|
dp
greedy
|
2300
|
| 1866-C |
Completely Searching for Inversions
|
dfs and similar
dp
graphs
|
1900
|
| 1866-B |
Battling with Numbers
|
combinatorics
math
number theory
|
1400
|
| 1866-A |
Ambitious Kid
|
math
|
800
|
| 1864-I |
Future Dominators
|
graphs
greedy
|
3500
|
| 1864-H |
Asterism Stream
|
dp
math
matrices
|
3200
|
| 1864-G |
Magic Square
|
combinatorics
constructive algorithms
implementation
|
3100
|
| 1864-F |
Exotic Queries
|
data structures
implementation
sortings
|
2300
|
| 1864-E |
Guess Game
|
bitmasks
data structures
games
+5
|
2100
|
| 1864-D |
Matrix Cascade
|
brute force
constructive algorithms
data structures
+3
|
1700
|
| 1864-C |
Divisor Chain
|
bitmasks
constructive algorithms
math
+1
|
1300
|
| 1864-B |
Swap and Reverse
|
constructive algorithms
greedy
sortings
+1
|
1100
|
| 1864-A |
Increasing and Decreasing
|
constructive algorithms
greedy
implementation
+1
|
800
|
| 1863-I |
Redundant Routes
|
constructive algorithms
dp
trees
|
3500
|
| 1863-H |
Goldberg Machine 3
|
dp
trees
|
3500
|
| 1863-G |
Swaps
|
combinatorics
dp
graphs
+1
|
2800
|
| 1863-F |
Divide, XOR, and Conquer
|
bitmasks
dp
math
|
2600
|
| 1863-E |
Speedrun
|
brute force
dfs and similar
dp
+5
|
2100
|
| 1863-D |
Two-Colored Dominoes
|
constructive algorithms
greedy
|
1400
|
| 1863-C |
MEX Repetition
|
implementation
math
|
1100
|
| 1863-B |
Split Sort
|
greedy
math
sortings
|
1100
|
| 1863-A |
Channel
|
greedy
implementation
|
800
|
| 1862-G |
The Great Equalizer
|
binary search
data structures
math
+1
|
2000
|
| 1862-F |
Magic Will Save the World
|
binary search
bitmasks
brute force
+1
|
1800
|
| 1862-E |
Kolya and Movie Theatre
|
constructive algorithms
data structures
greedy
|
1600
|
| 1862-D |
Ice Cream Balls
|
binary search
combinatorics
constructive algorithms
+1
|
1300
|
| 1862-C |
Flower City Fence
|
binary search
data structures
implementation
+1
|
1100
|
| 1862-B |
Sequence Game
|
constructive algorithms
|
800
|
| 1862-A |
Gift Carpet
|
dp
greedy
implementation
+1
|
800
|
| 1861-F |
Four Suits
|
binary search
bitmasks
flows
+1
|
3200
|
| 1861-E |
Non-Intersecting Subpermutations
|
combinatorics
dp
implementation
+1
|
2300
|
| 1861-D |
Sorting By Multiplication
|
dp
greedy
|
1800
|
| 1861-C |
Queries for the Array
|
data structures
dfs and similar
implementation
+2
|
1600
|
| 1861-B |
Two Binary Strings
|
constructive algorithms
dp
greedy
|
1000
|
| 1861-A |
Prime Deletion
|
constructive algorithms
math
|
800
|
| 1860-F |
Evaluate RBS
|
data structures
geometry
implementation
+2
|
2900
|
| 1860-E |
Fast Travel Text Editor
|
data structures
dfs and similar
graphs
+1
|
2400
|
| 1860-D |
Balanced String
|
dp
|
2200
|
| 1860-C |
Game on Permutation
|
data structures
dp
games
+1
|
1400
|
| 1860-B |
Fancy Coins
|
binary search
brute force
greedy
+1
|
1200
|
| 1860-A |
Not a Substring
|
constructive algorithms
strings
|
900
|
| 1859-F |
Teleportation in Byteland
|
data structures
dfs and similar
divide and conquer
+3
|
3200
|