| 1850-F |
We Were Both Children
|
brute force
implementation
math
+1
|
1300
|
| 1850-E |
Cardboard for Pictures
|
binary search
geometry
implementation
+1
|
1100
|
| 1850-D |
Balanced Round
|
brute force
greedy
implementation
+1
|
900
|
| 1850-C |
Word on the Paper
|
implementation
strings
|
800
|
| 1850-B |
Ten Words of Wisdom
|
implementation
sortings
|
800
|
| 1850-A |
To My Critics
|
implementation
sortings
|
800
|
| 1849-F |
XOR Partition
|
binary search
bitmasks
data structures
+3
|
2700
|
| 1849-E |
Max to the Right of Min
|
binary search
data structures
divide and conquer
+3
|
2300
|
| 1849-D |
Array Painting
|
constructive algorithms
greedy
two pointers
|
1700
|
| 1849-C |
Binary String Copying
|
binary search
brute force
data structures
+2
|
1600
|
| 1849-B |
Monsters
|
greedy
math
sortings
|
1000
|
| 1849-A |
Morning Sandwich
|
implementation
math
|
800
|
| 1848-F |
Vika and Wiki
|
binary search
bitmasks
combinatorics
+3
|
2400
|
| 1848-E |
Vika and Stone Skipping
|
brute force
implementation
math
+1
|
2600
|
| 1848-D |
Vika and Bonuses
|
binary search
brute force
math
+1
|
2200
|
| 1848-C |
Vika and Price Tags
|
math
number theory
|
1800
|
| 1848-B |
Vika and the Bridge
|
binary search
data structures
greedy
+3
|
1200
|
| 1848-A |
Vika and Her Friends
|
games
math
|
900
|
| 1847-F |
The Boss's Identity
|
binary search
bitmasks
data structures
+4
|
2500
|
| 1847-E |
Triangle Platinum?
|
brute force
combinatorics
implementation
+3
|
2900
|
| 1847-D |
Professor Higashikata
|
data structures
dsu
greedy
+2
|
1900
|
| 1847-C |
Vampiric Powers, anyone?
|
bitmasks
brute force
dp
+1
|
1400
|
| 1847-B |
Hamon Odyssey
|
bitmasks
greedy
two pointers
|
1000
|
| 1847-A |
The Man who became a God
|
greedy
sortings
|
800
|
| 1846-G |
Rudolf and CodeVid-23
|
bitmasks
dp
graphs
+2
|
1900
|
| 1846-F |
Rudolph and Mimic
|
constructive algorithms
implementation
interactive
|
1800
|
| 1846-E2 |
Rudolf and Snowflakes (hard version)
|
binary search
brute force
implementation
+1
|
1800
|
| 1846-E1 |
Rudolf and Snowflakes (simple version)
|
brute force
implementation
math
|
1300
|
| 1846-D |
Rudolph and Christmas Tree
|
constructive algorithms
geometry
math
|
1200
|
| 1846-C |
Rudolf and the Another Competition
|
constructive algorithms
data structures
dp
+2
|
1200
|
| 1846-B |
Rudolph and Tic-Tac-Toe
|
brute force
implementation
strings
|
800
|
| 1846-A |
Rudolph and Cut the Rope
|
implementation
math
|
800
|
| 1845-F |
Swimmers in the Pool
|
dp
fft
math
+1
|
2800
|
| 1845-E |
Boxes and Balls
|
dp
implementation
math
|
2500
|
| 1845-D |
Rating System
|
binary search
brute force
data structures
+5
|
1800
|
| 1845-C |
Strong Password
|
binary search
dp
greedy
+1
|
1400
|
| 1845-B |
Come Together
|
geometry
implementation
math
|
900
|
| 1845-A |
Forbidden Integer
|
constructive algorithms
implementation
math
+1
|
800
|
| 1844-H |
Multiple of Three Cycles
|
combinatorics
data structures
dp
+2
|
3400
|
| 1844-G |
Tree Weights
|
bitmasks
constructive algorithms
data structures
+6
|
3000
|
| 1844-F2 |
Min Cost Permutation (Hard Version)
|
binary search
constructive algorithms
data structures
+3
|
2800
|
| 1844-F1 |
Min Cost Permutation (Easy Version)
|
brute force
constructive algorithms
greedy
+1
|
2600
|
| 1844-E |
Great Grids
|
2-sat
constructive algorithms
dfs and similar
+2
|
2400
|
| 1844-D |
Row Major
|
constructive algorithms
greedy
math
+2
|
1400
|
| 1844-C |
Particles
|
dp
greedy
implementation
+1
|
1300
|
| 1844-B |
Permutations & Primes
|
constructive algorithms
math
|
1000
|
| 1844-A |
Subtraction Game
|
constructive algorithms
games
|
800
|
| 1843-F2 |
Omsk Metro (hard version)
|
data structures
dfs and similar
divide and conquer
+3
|
2300
|
| 1843-F1 |
Omsk Metro (simple version)
|
data structures
dfs and similar
dp
+4
|
1800
|
| 1843-E |
Tracking Segments
|
binary search
brute force
data structures
+1
|
1600
|