| 1419-D2 |
Sage's Birthday (hard version)
|
binary search
brute force
constructive algorithms
+3
|
1500
|
| 1419-D1 |
Sage's Birthday (easy version)
|
binary search
constructive algorithms
greedy
+1
|
1000
|
| 1419-C |
Killjoy
|
greedy
implementation
math
|
1500
|
| 1419-B |
Stairs
|
brute force
constructive algorithms
greedy
+2
|
1200
|
| 1419-A |
Digit Game
|
games
greedy
implementation
|
900
|
| 1418-G |
Three Occurrences
|
data structures
divide and conquer
hashing
+1
|
2500
|
| 1418-F |
Equal Product
|
data structures
math
number theory
+1
|
3000
|
| 1418-E |
Expected Damage
|
binary search
combinatorics
probabilities
|
2400
|
| 1418-D |
Trash Problem
|
data structures
implementation
|
2100
|
| 1418-C |
Mortal Kombat Tower
|
dp
graphs
greedy
+1
|
1500
|
| 1418-B |
Negative Prefixes
|
greedy
sortings
|
1300
|
| 1418-A |
Buying Torches
|
math
|
1000
|
| 1417-B |
Two Arrays
|
greedy
math
sortings
|
1100
|
| 1417-A |
Copy-paste
|
greedy
math
|
800
|
| 1416-F |
Showing Off
|
flows
graph matchings
greedy
+1
|
3300
|
| 1416-E |
Split
|
binary search
data structures
dp
+1
|
3200
|
| 1416-D |
Graph and Queries
|
data structures
dsu
graphs
+2
|
2600
|
| 1416-C |
XOR Inverse
|
bitmasks
data structures
divide and conquer
+6
|
2000
|
| 1416-B |
Make Them Equal
|
constructive algorithms
greedy
math
|
2000
|
| 1416-A |
k-Amazing Numbers
|
binary search
data structures
implementation
+1
|
1500
|
| 1415-F |
Cakes for Clones
|
dp
|
2900
|
| 1415-E |
New Game Plus!
|
constructive algorithms
greedy
math
|
2200
|
| 1415-D |
XOR-gun
|
bitmasks
brute force
constructive algorithms
|
2000
|
| 1415-C |
Bouncing Ball
|
brute force
dp
implementation
|
1400
|
| 1415-B |
Repainting Street
|
brute force
greedy
|
1100
|
| 1415-A |
Prison Break
|
brute force
math
|
800
|
| 1413-F |
Roads and Ramen
|
data structures
trees
|
2800
|
| 1413-E |
Solo mid Oracle
|
greedy
math
ternary search
|
2100
|
| 1413-D |
Shurikens
|
data structures
greedy
implementation
|
1700
|
| 1413-C |
Perform Easily
|
binary search
brute force
dp
+3
|
1900
|
| 1413-B |
A New Technique
|
implementation
|
1100
|
| 1413-A |
Finding Sasuke
|
constructive algorithms
math
|
800
|
| 1411-G |
No Game No Life
|
bitmasks
games
math
+1
|
2700
|
| 1411-F |
The Thorny Path
|
greedy
math
|
3000
|
| 1411-E |
Poman Numbers
|
bitmasks
greedy
math
+1
|
2300
|
| 1411-D |
Grime Zoo
|
brute force
greedy
implementation
+1
|
2100
|
| 1411-C |
Peaceful Rooks
|
dfs and similar
dsu
graphs
|
1700
|
| 1411-B |
Fair Numbers
|
brute force
number theory
|
1000
|
| 1411-A |
In-game Chat
|
implementation
|
800
|
| 1409-F |
Subsequences of Length Two
|
dp
strings
|
2100
|
| 1409-E |
Two Platforms
|
binary search
dp
sortings
+1
|
1800
|
| 1409-D |
Decrease the Sum of Digits
|
greedy
math
|
1500
|
| 1409-C |
Yet Another Array Restoration
|
brute force
math
number theory
|
1200
|
| 1409-B |
Minimum Product
|
brute force
greedy
math
|
1100
|
| 1409-A |
Yet Another Two Integers Problem
|
greedy
math
|
800
|
| 1408-I |
Bitwise Magic
|
dp
math
|
3200
|
| 1408-H |
Rainbow Triples
|
binary search
data structures
flows
+1
|
3300
|
| 1408-G |
Clusterization Counting
|
combinatorics
dp
dsu
+3
|
2700
|
| 1408-F |
Two Different
|
constructive algorithms
divide and conquer
|
2300
|
| 1408-E |
Avoid Rainbow Cycles
|
data structures
dsu
graphs
+3
|
2400
|