| 1574-E |
Coloring
|
combinatorics
constructive algorithms
implementation
+1
|
2500
|
| 1574-D |
The Strongest Build
|
binary search
brute force
data structures
+5
|
2000
|
| 1574-C |
Slay the Dragon
|
binary search
greedy
sortings
+1
|
1300
|
| 1574-B |
Combinatorics Homework
|
combinatorics
greedy
math
|
1100
|
| 1574-A |
Regular Bracket Sequences
|
constructive algorithms
|
800
|
| 1573-B |
Swaps
|
greedy
math
sortings
|
1400
|
| 1573-A |
Countdown
|
greedy
|
800
|
| 1572-F |
Stations
|
data structures
|
3400
|
| 1572-E |
Polygon
|
binary search
dp
geometry
|
3000
|
| 1572-D |
Bridge Club
|
flows
graph matchings
graphs
+1
|
2800
|
| 1572-C |
Paint
|
dp
greedy
|
2700
|
| 1572-B |
Xor of 3
|
brute force
constructive algorithms
greedy
+1
|
2500
|
| 1572-A |
Book
|
binary search
brute force
data structures
+4
|
1800
|
| 1571-J |
Two Railroads
|
*special
|
3000
|
| 1571-I |
Physical Examination
|
*special
binary search
data structures
|
3200
|
| 1571-H |
Laser Beams
|
*special
geometry
probabilities
|
2900
|
| 1571-G |
A Battle Against a Dragon
|
*special
data structures
dp
|
2500
|
| 1571-F |
Kotlinforces
|
*special
constructive algorithms
dp
|
2000
|
| 1571-E |
Fix the String
|
*special
bitmasks
dp
+1
|
1700
|
| 1571-D |
Sweepstake
|
*special
brute force
constructive algorithms
+2
|
1800
|
| 1571-C |
Rhyme
|
*special
implementation
|
1800
|
| 1571-B |
Epic Novel
|
*special
math
|
1300
|
| 1571-A |
Sequence of Comparisons
|
*special
|
800
|
| 1569-F |
Palindromic Hamiltonian Path
|
brute force
dfs and similar
dp
+2
|
3000
|
| 1569-E |
Playoff Restoration
|
bitmasks
brute force
hashing
+2
|
2600
|
| 1569-D |
Inconvenient Pairs
|
binary search
data structures
implementation
+2
|
1900
|
| 1569-C |
Jury Meeting
|
combinatorics
math
|
1500
|
| 1569-B |
Chess Tournament
|
constructive algorithms
|
1000
|
| 1569-A |
Balanced Substring
|
implementation
|
800
|
| 1567-F |
One-Four Overload
|
2-sat
constructive algorithms
dfs and similar
+3
|
2700
|
| 1567-E |
Non-Decreasing Dilemma
|
data structures
divide and conquer
math
|
2200
|
| 1567-D |
Expression Evaluation Error
|
constructive algorithms
greedy
implementation
+1
|
2000
|
| 1567-C |
Carrying Conundrum
|
bitmasks
combinatorics
dp
+1
|
1600
|
| 1567-B |
MEXor Mixup
|
bitmasks
greedy
|
1000
|
| 1567-A |
Domino Disaster
|
implementation
strings
|
800
|
| 1566-H |
Xor-quiz
|
constructive algorithms
dp
interactive
+2
|
3200
|
| 1566-G |
Four Vertices
|
constructive algorithms
data structures
graphs
+3
|
3100
|
| 1566-F |
Points Movement
|
data structures
dp
greedy
+2
|
2600
|
| 1566-E |
Buds Re-hanging
|
constructive algorithms
dfs and similar
dp
+2
|
2000
|
| 1566-D2 |
Seating Arrangements (hard version)
|
data structures
greedy
implementation
+2
|
1600
|
| 1566-D1 |
Seating Arrangements (easy version)
|
data structures
greedy
sortings
|
1100
|
| 1566-C |
MAX-MEX Cut
|
bitmasks
constructive algorithms
dp
+1
|
1000
|
| 1566-B |
MIN-MEX Cut
|
bitmasks
constructive algorithms
dp
+1
|
800
|
| 1566-A |
Median Maximization
|
binary search
greedy
math
|
800
|
| 1562-F |
Tubular Bells
|
interactive
math
number theory
+1
|
2900
|
| 1562-E |
Rescue Niwen!
|
dp
greedy
string suffix structures
+1
|
2500
|
| 1562-D2 |
Two Hundred Twenty One (hard version)
|
data structures
math
|
2200
|
| 1562-D1 |
Two Hundred Twenty One (easy version)
|
data structures
dp
math
|
1700
|
| 1562-C |
Rings
|
constructive algorithms
math
|
1500
|
| 1562-B |
Scenes From a Memory
|
brute force
constructive algorithms
implementation
+2
|
1000
|