| 1491-C |
Pekora and Trampoline
|
brute force
data structures
dp
+2
|
1700
|
| 1491-B |
Minimal Cost
|
brute force
math
|
1200
|
| 1491-A |
K-th Largest Value
|
brute force
greedy
implementation
|
800
|
| 1490-G |
Old Floppy Drive
|
binary search
data structures
math
|
1900
|
| 1490-F |
Equalize the Array
|
binary search
data structures
greedy
+2
|
1500
|
| 1490-E |
Accidental Victory
|
binary search
data structures
greedy
|
1400
|
| 1490-D |
Permutation Transformation
|
dfs and similar
divide and conquer
implementation
|
1200
|
| 1490-C |
Sum of Cubes
|
binary search
brute force
math
|
1100
|
| 1490-B |
Balanced Remainders
|
brute force
constructive algorithms
math
|
1000
|
| 1490-A |
Dense Array
|
greedy
math
|
800
|
| 1488-J |
Flower Shop
|
*special
data structures
fft
+1
|
3100
|
| 1488-I |
Demonic Invasion
|
*special
flows
|
3100
|
| 1488-H |
Build From Suffixes
|
*special
combinatorics
data structures
|
2800
|
| 1488-G |
Painting Numbers
|
*special
data structures
greedy
+1
|
2500
|
| 1488-F |
Dogecoin
|
*special
binary search
data structures
|
2300
|
| 1488-E |
Palindromic Doubles
|
*special
data structures
dp
|
2200
|
| 1488-D |
Problemsolving Marathon
|
*special
binary search
greedy
|
1900
|
| 1488-C |
Two Policemen
|
*special
binary search
brute force
+1
|
1900
|
| 1488-B |
RBS Deletion
|
*special
greedy
|
1800
|
| 1488-A |
From Zero To Y
|
*special
math
|
900
|
| 1487-G |
String Counting
|
combinatorics
dp
fft
+1
|
2700
|
| 1487-F |
Ones
|
dp
greedy
shortest paths
|
2900
|
| 1487-E |
Cheap Dinner
|
brute force
data structures
graphs
+4
|
2000
|
| 1487-D |
Pythagorean Triples
|
binary search
brute force
math
+1
|
1500
|
| 1487-C |
Minimum Ties
|
brute force
constructive algorithms
dfs and similar
+4
|
1500
|
| 1487-B |
Cat Cycle
|
math
number theory
|
1200
|
| 1487-A |
Arena
|
implementation
sortings
|
800
|
| 1486-F |
Pairs of Paths
|
combinatorics
data structures
dfs and similar
+2
|
2600
|
| 1486-E |
Paired Payment
|
binary search
brute force
constructive algorithms
+4
|
2200
|
| 1486-D |
Max Median
|
binary search
data structures
dp
|
2100
|
| 1486-C2 |
Guessing the Greatest (hard version)
|
binary search
interactive
|
1900
|
| 1486-C1 |
Guessing the Greatest (easy version)
|
binary search
interactive
|
1600
|
| 1486-B |
Eastern Exhibition
|
binary search
geometry
shortest paths
+1
|
1500
|
| 1486-A |
Shifting Stacks
|
greedy
implementation
|
900
|
| 1485-F |
Copy or Prefix Sum
|
combinatorics
data structures
dp
+1
|
2400
|
| 1485-E |
Move and Swap
|
dfs and similar
dp
greedy
+1
|
2500
|
| 1485-D |
Multiples and Power Differences
|
constructive algorithms
graphs
math
+1
|
2200
|
| 1485-C |
Floor and Mod
|
binary search
brute force
math
+1
|
1700
|
| 1485-B |
Replace and Keep Sorted
|
dp
implementation
math
|
1200
|
| 1485-A |
Add and Divide
|
brute force
greedy
math
+1
|
1000
|
| 1482-H |
Exam
|
data structures
string suffix structures
trees
|
3400
|
| 1482-G |
Vabank
|
binary search
interactive
|
3200
|
| 1482-F |
Useful Edges
|
graphs
shortest paths
|
2400
|
| 1482-E |
Skyline Photo
|
data structures
divide and conquer
dp
|
2100
|
| 1482-D |
Playlist
|
data structures
dsu
implementation
+1
|
1900
|
| 1482-C |
Basic Diplomacy
|
brute force
constructive algorithms
greedy
+1
|
1600
|
| 1482-B |
Restore Modulo
|
implementation
math
|
1500
|
| 1482-A |
Prison Break
|
math
|
800
|
| 1481-F |
AB Tree
|
dp
greedy
trees
|
3100
|
| 1481-E |
Sorting Books
|
data structures
dp
greedy
|
2500
|