| 1815-E |
Bosco and Particle
|
dp
math
number theory
+1
|
3100
|
| 1815-D |
XOR Counting
|
bitmasks
combinatorics
dp
+1
|
2600
|
| 1815-C |
Between
|
constructive algorithms
dfs and similar
graphs
+1
|
2200
|
| 1815-B |
Sum Graph
|
brute force
constructive algorithms
graphs
+4
|
2000
|
| 1815-A |
Ian and Array Sorting
|
greedy
math
|
1300
|
| 1814-F |
Communication Towers
|
brute force
divide and conquer
dsu
|
2700
|
| 1814-E |
Chain Chips
|
data structures
dp
matrices
|
2300
|
| 1814-D |
Balancing Weapons
|
binary search
brute force
data structures
+2
|
2500
|
| 1814-C |
Search in Parallel
|
constructive algorithms
greedy
sortings
|
1500
|
| 1814-B |
Long Legs
|
brute force
math
|
1700
|
| 1814-A |
Coins
|
implementation
math
|
800
|
| 1812-J |
Unmysterious Language
|
*special
constructive algorithms
strings
|
—
|
| 1812-I |
Mountain Climber
|
*special
|
—
|
| 1812-H |
Expected Twist
|
*special
interactive
|
—
|
| 1812-G |
Colour Vision
|
*special
implementation
|
—
|
| 1812-F |
Factorization
|
*special
number theory
|
—
|
| 1812-E |
Not a Geometry Problem
|
*special
constructive algorithms
geometry
+1
|
—
|
| 1812-D |
Trivial Conjecture
|
*special
constructive algorithms
math
+1
|
—
|
| 1812-C |
Digits
|
*special
|
—
|
| 1812-B |
Was it Rated?
|
*special
brute force
implementation
|
—
|
| 1812-A |
Are You a Robot?
|
*special
expression parsing
strings
|
—
|
| 1811-G2 |
Vlad and the Nice Paths (hard version)
|
binary search
combinatorics
data structures
+3
|
2200
|
| 1811-G1 |
Vlad and the Nice Paths (easy version)
|
combinatorics
dp
math
|
2100
|
| 1811-F |
Is It Flower?
|
dfs and similar
graphs
implementation
|
2100
|
| 1811-E |
Living Sequence
|
binary search
dp
math
+1
|
1500
|
| 1811-D |
Umka and a Long Flight
|
constructive algorithms
implementation
math
|
1600
|
| 1811-C |
Restore the Array
|
constructive algorithms
greedy
|
1100
|
| 1811-B |
Conveyor Belts
|
implementation
math
|
1000
|
| 1811-A |
Insert Digit
|
greedy
math
strings
|
800
|
| 1810-H |
Last Number
|
combinatorics
math
|
2900
|
| 1810-G |
The Maximum Prefix
|
dp
|
3200
|
| 1810-F |
M-tree
|
data structures
math
sortings
+1
|
2800
|
| 1810-E |
Monsters
|
brute force
data structures
dfs and similar
+3
|
2100
|
| 1810-D |
Climbing the Tree
|
binary search
math
|
1700
|
| 1810-C |
Make It Permutation
|
brute force
greedy
sortings
|
1300
|
| 1810-B |
Candies
|
constructive algorithms
math
number theory
|
800
|
| 1810-A |
Beautiful Sequence
|
brute force
greedy
|
800
|
| 1809-G |
Prediction
|
combinatorics
dp
math
|
2800
|
| 1809-F |
Traveling in Berland
|
binary search
data structures
graphs
+2
|
2500
|
| 1809-E |
Two Tanks
|
binary search
dp
implementation
+1
|
2400
|
| 1809-D |
Binary String Sorting
|
constructive algorithms
greedy
|
1800
|
| 1809-C |
Sum on Subarrays
|
constructive algorithms
greedy
math
|
1500
|
| 1809-B |
Points on Plane
|
binary search
greedy
math
|
1000
|
| 1809-A |
Garland
|
implementation
|
800
|
| 1808-E3 |
Minibuses on Venus (hard version)
|
brute force
combinatorics
dp
+1
|
2800
|
| 1808-E2 |
Minibuses on Venus (medium version)
|
combinatorics
divide and conquer
dp
+1
|
2500
|
| 1808-E1 |
Minibuses on Venus (easy version)
|
combinatorics
divide and conquer
dp
|
2200
|
| 1808-D |
Petya, Petya, Petr, and Palindromes
|
binary search
brute force
data structures
+1
|
2100
|
| 1808-C |
Unlucky Numbers
|
brute force
dp
greedy
+1
|
1900
|
| 1808-B |
Playing in a Casino
|
math
sortings
|
1200
|