| 1472-E |
Correct Placement
|
binary search
data structures
dp
+2
|
1700
|
| 1472-D |
Even-Odd Game
|
dp
games
greedy
+1
|
1200
|
| 1472-C |
Long Jumps
|
dp
graphs
|
1100
|
| 1472-B |
Fair Division
|
dp
greedy
math
|
800
|
| 1472-A |
Cards for Friends
|
greedy
math
|
800
|
| 1471-B |
Strange List
|
brute force
greedy
implementation
+1
|
1100
|
| 1471-A |
Strange Partition
|
greedy
math
number theory
|
900
|
| 1470-F |
Strange Covering
|
divide and conquer
|
3500
|
| 1470-E |
Strange Permutation
|
binary search
combinatorics
data structures
+4
|
3200
|
| 1470-D |
Strange Housing
|
constructive algorithms
dfs and similar
graph matchings
+2
|
2200
|
| 1470-C |
Strange Shuffle
|
binary search
brute force
constructive algorithms
+1
|
2500
|
| 1470-B |
Strange Definition
|
bitmasks
graphs
hashing
+2
|
1900
|
| 1470-A |
Strange Birthday Party
|
binary search
dp
greedy
+2
|
1300
|
| 1469-F |
Power Sockets
|
binary search
data structures
greedy
|
2600
|
| 1469-E |
A Bit Similar
|
bitmasks
brute force
hashing
+3
|
2400
|
| 1469-D |
Ceil Divisions
|
brute force
constructive algorithms
math
+1
|
1700
|
| 1469-C |
Building a Fence
|
dp
greedy
implementation
+1
|
1600
|
| 1469-B |
Red and Blue
|
dp
greedy
|
1000
|
| 1469-A |
Regular Bracket Sequence
|
constructive algorithms
greedy
|
1000
|
| 1468-N |
Waste Sorting
|
greedy
implementation
|
900
|
| 1468-M |
Similar Sets
|
data structures
graphs
implementation
|
2300
|
| 1468-L |
Prime Divisors Selection
|
binary search
greedy
math
+1
|
2700
|
| 1468-K |
The Robot
|
brute force
implementation
|
1600
|
| 1468-J |
Road Reform
|
dsu
graphs
greedy
|
1800
|
| 1468-I |
Plane Tiling
|
geometry
implementation
math
|
2500
|
| 1468-H |
K and Medians
|
constructive algorithms
greedy
math
|
2200
|
| 1468-G |
Hobbits
|
binary search
geometry
|
2500
|
| 1468-F |
Full Turn
|
geometry
hashing
number theory
|
1700
|
| 1468-E |
Four Segments
|
greedy
|
800
|
| 1468-D |
Firecrackers
|
binary search
sortings
|
1700
|
| 1468-C |
Berpizza
|
data structures
implementation
|
1400
|
| 1468-B |
Bakery
|
data structures
dsu
|
2900
|
| 1468-A |
LaIS
|
data structures
dp
greedy
|
2200
|
| 1467-E |
Distinctive Roots in a Tree
|
data structures
dfs and similar
dp
+1
|
2500
|
| 1467-D |
Sum of Paths
|
combinatorics
dp
math
|
2200
|
| 1467-C |
Three Bags
|
constructive algorithms
greedy
|
1900
|
| 1467-B |
Hills And Valleys
|
brute force
implementation
|
1700
|
| 1467-A |
Wizard of Orz
|
constructive algorithms
greedy
math
|
900
|
| 1466-I |
The Riddle of the Sphinx
|
binary search
data structures
interactive
|
3400
|
| 1466-H |
Finding satisfactory solutions
|
combinatorics
dp
graphs
+2
|
3300
|
| 1466-G |
Song of the Sirens
|
combinatorics
divide and conquer
hashing
+3
|
2600
|
| 1466-F |
Euclid's nightmare
|
bitmasks
dfs and similar
dsu
+4
|
2100
|
| 1466-E |
Apollo versus Pan
|
bitmasks
brute force
math
|
1800
|
| 1466-D |
13th Labour of Heracles
|
data structures
greedy
sortings
+1
|
1500
|
| 1466-C |
Canine poetry
|
dp
greedy
strings
|
1300
|
| 1466-B |
Last minute enhancements
|
dp
greedy
|
800
|
| 1466-A |
Bovine Dilemma
|
brute force
geometry
math
|
800
|
| 1464-F |
My Beautiful Madness
|
data structures
trees
|
3500
|
| 1463-F |
Max Correct Set
|
bitmasks
dp
math
|
3100
|
| 1463-E |
Plan of Lectures
|
constructive algorithms
dfs and similar
dsu
+4
|
2400
|