| 1859-E |
Maximum Monogonosity
|
brute force
dp
math
|
2500
|
| 1859-D |
Andrey and Escape from Capygrad
|
binary search
data structures
dp
+3
|
1800
|
| 1859-C |
Another Permutation Problem
|
brute force
dp
greedy
+1
|
1200
|
| 1859-B |
Olya and Game with Arrays
|
constructive algorithms
greedy
math
+1
|
1000
|
| 1859-A |
United We Stand
|
constructive algorithms
math
number theory
|
800
|
| 1858-E2 |
Rollbacks (Hard Version)
|
data structures
interactive
trees
|
2600
|
| 1858-E1 |
Rollbacks (Easy Version)
|
brute force
data structures
dfs and similar
+1
|
2500
|
| 1858-D |
Trees and Segments
|
brute force
data structures
dp
+2
|
2200
|
| 1858-C |
Yet Another Permutation Problem
|
constructive algorithms
greedy
math
+1
|
1000
|
| 1858-B |
The Walkway
|
brute force
dp
greedy
+2
|
1500
|
| 1858-A |
Buttons
|
games
greedy
math
|
800
|
| 1857-G |
Counting Graphs
|
combinatorics
divide and conquer
dsu
+4
|
2000
|
| 1857-F |
Sum and Product
|
binary search
data structures
math
|
1600
|
| 1857-E |
Power of Points
|
math
sortings
|
1500
|
| 1857-D |
Strong Vertices
|
math
sortings
trees
|
1300
|
| 1857-C |
Assembly via Minimums
|
greedy
sortings
|
1200
|
| 1857-B |
Maximum Rounding
|
greedy
implementation
math
|
1100
|
| 1857-A |
Array Coloring
|
greedy
math
|
800
|
| 1856-E2 |
PermuTree (hard version)
|
bitmasks
dfs and similar
dp
+5
|
2700
|
| 1856-E1 |
PermuTree (easy version)
|
dfs and similar
dp
trees
|
1800
|
| 1856-D |
More Wrong
|
divide and conquer
interactive
|
2100
|
| 1856-C |
To Become Max
|
binary search
brute force
data structures
+1
|
1600
|
| 1856-B |
Good Arrays
|
implementation
math
|
900
|
| 1856-A |
Tales of a Sort
|
implementation
|
800
|
| 1855-B |
Longest Divisors Interval
|
brute force
combinatorics
greedy
+2
|
900
|
| 1855-A |
Dalton the Teacher
|
greedy
math
|
800
|
| 1854-F |
Mark and Spaceship
|
brute force
dp
|
3500
|
| 1854-E |
Game Bundles
|
brute force
constructive algorithms
dp
+2
|
3000
|
| 1854-D |
Michael and Hotel
|
binary search
interactive
trees
|
3000
|
| 1854-C |
Expected Destruction
|
combinatorics
dp
math
+1
|
2500
|
| 1854-B |
Earn or Unlock
|
bitmasks
brute force
dp
|
2200
|
| 1854-A2 |
Dual (Hard Version)
|
constructive algorithms
math
|
1900
|
| 1854-A1 |
Dual (Easy Version)
|
constructive algorithms
math
|
1400
|
| 1853-B |
Fibonaccharsis
|
binary search
brute force
math
|
1200
|
| 1853-A |
Desorting
|
brute force
greedy
math
|
800
|
| 1852-F |
Panda Meetups
|
data structures
dp
flows
|
3500
|
| 1852-E |
Rivalries
|
constructive algorithms
data structures
greedy
|
3400
|
| 1852-D |
Miriany and Matchstick
|
constructive algorithms
dp
greedy
|
2800
|
| 1852-C |
Ina of the Mountain
|
data structures
dp
greedy
+1
|
2400
|
| 1852-B |
Imbalanced Arrays
|
constructive algorithms
graphs
greedy
+3
|
1800
|
| 1852-A |
Ntarsis' Set
|
binary search
math
number theory
|
1800
|
| 1851-G |
Vlad and the Mountains
|
binary search
data structures
dsu
+5
|
2000
|
| 1851-F |
Lisa and the Martians
|
bitmasks
greedy
math
+2
|
1800
|
| 1851-E |
Nastya and Potions
|
dfs and similar
dp
graphs
+1
|
1500
|
| 1851-D |
Prefix Permutation Sums
|
implementation
math
|
1300
|
| 1851-C |
Tiles Comeback
|
greedy
|
1000
|
| 1851-B |
Parity Sort
|
greedy
sortings
two pointers
|
800
|
| 1851-A |
Escalator Conversations
|
brute force
constructive algorithms
math
|
800
|
| 1850-H |
The Third Letter
|
dfs and similar
dsu
graphs
+2
|
1700
|
| 1850-G |
The Morning Star
|
combinatorics
data structures
geometry
+3
|
1500
|