| 1648-A |
Weird Sum
|
combinatorics
data structures
geometry
+3
|
1400
|
| 1647-F |
Madoka and Laziness
|
dp
greedy
|
3100
|
| 1647-E |
Madoka and the Sixth-graders
|
data structures
dfs and similar
greedy
|
2500
|
| 1647-D |
Madoka and the Best School in Russia
|
constructive algorithms
dp
math
+1
|
1900
|
| 1647-C |
Madoka and Childish Pranks
|
constructive algorithms
greedy
|
1300
|
| 1647-B |
Madoka and the Elegant Gift
|
brute force
constructive algorithms
graphs
+1
|
1200
|
| 1647-A |
Madoka and Math Dad
|
implementation
math
|
800
|
| 1646-F |
Playing Around the Table
|
constructive algorithms
greedy
implementation
|
2900
|
| 1646-E |
Power Board
|
brute force
dp
math
+1
|
2200
|
| 1646-D |
Weight the Tree
|
constructive algorithms
dfs and similar
dp
+2
|
2000
|
| 1646-C |
Factorials and Powers of Two
|
bitmasks
brute force
constructive algorithms
+2
|
1500
|
| 1646-B |
Quality vs Quantity
|
brute force
constructive algorithms
greedy
+2
|
800
|
| 1646-A |
Square Counting
|
math
|
800
|
| 1644-F |
Basis
|
combinatorics
fft
math
+1
|
2900
|
| 1644-E |
Expand the Path
|
brute force
combinatorics
data structures
+2
|
1900
|
| 1644-D |
Cross Coloring
|
data structures
implementation
math
|
1700
|
| 1644-C |
Increase Subarray Sums
|
brute force
dp
greedy
+1
|
1400
|
| 1644-B |
Anti-Fibonacci Permutation
|
brute force
constructive algorithms
implementation
|
800
|
| 1644-A |
Doors and Keys
|
implementation
|
800
|
| 1642-B |
Power Walking
|
greedy
|
900
|
| 1642-A |
Hard Way
|
geometry
|
800
|
| 1641-F |
Covering Circle
|
geometry
|
3500
|
| 1641-E |
Special Positions
|
combinatorics
divide and conquer
fft
+1
|
3300
|
| 1641-D |
Two Arrays
|
bitmasks
brute force
combinatorics
+4
|
2700
|
| 1641-C |
Anonymity Is Important
|
binary search
brute force
data structures
+3
|
2200
|
| 1641-B |
Repetitions Decoding
|
constructive algorithms
implementation
sortings
|
2000
|
| 1641-A |
Great Sequence
|
brute force
greedy
sortings
|
1200
|
| 1639-K |
Treasure Hunt
|
graphs
interactive
|
—
|
| 1639-J |
Treasure Hunt
|
graphs
interactive
|
—
|
| 1639-I |
Treasure Hunt
|
graphs
interactive
|
—
|
| 1639-H |
Treasure Hunt
|
graphs
interactive
|
—
|
| 1639-G |
Treasure Hunt
|
graphs
interactive
|
—
|
| 1639-F |
Treasure Hunt
|
graphs
interactive
|
—
|
| 1639-E |
Treasure Hunt
|
graphs
interactive
|
—
|
| 1639-D |
Treasure Hunt
|
graphs
interactive
|
—
|
| 1639-C |
Treasure Hunt
|
graphs
interactive
|
—
|
| 1639-B |
Treasure Hunt
|
graphs
interactive
|
—
|
| 1639-A |
Treasure Hunt
|
graphs
interactive
|
—
|
| 1638-F |
Two Posters
|
brute force
data structures
greedy
+1
|
3200
|
| 1638-E |
Colorful Operations
|
brute force
data structures
implementation
|
2400
|
| 1638-D |
Big Brush
|
constructive algorithms
data structures
greedy
+1
|
2000
|
| 1638-C |
Inversion Graph
|
data structures
dsu
graphs
+1
|
1300
|
| 1638-B |
Odd Swap Sort
|
data structures
math
sortings
|
1100
|
| 1638-A |
Reverse
|
constructive algorithms
greedy
math
|
800
|
| 1637-H |
Minimize Inversions Number
|
data structures
greedy
math
+1
|
3500
|
| 1637-G |
Birthday
|
constructive algorithms
greedy
math
|
3000
|
| 1637-F |
Towers
|
constructive algorithms
dfs and similar
dp
+2
|
2500
|
| 1637-E |
Best Pair
|
binary search
brute force
implementation
|
2100
|
| 1637-D |
Yet Another Minimization Problem
|
dp
greedy
math
|
1800
|
| 1637-C |
Andrew and Stones
|
greedy
implementation
|
1200
|