| 1204-D2 |
Kirk and a Binary String (hard version)
|
data structures
greedy
math
+1
|
2100
|
| 1204-D1 |
Kirk and a Binary String (easy version)
|
brute force
greedy
strings
|
2000
|
| 1204-C |
Anna, Svyatoslav and Maps
|
dp
graphs
greedy
+1
|
1700
|
| 1204-B |
Mislove Has Lost an Array
|
greedy
math
|
900
|
| 1204-A |
BowWow and the Timetable
|
math
|
1000
|
| 1203-F2 |
Complete the Projects (hard version)
|
dp
greedy
|
2300
|
| 1203-F1 |
Complete the Projects (easy version)
|
greedy
|
2100
|
| 1203-E |
Boxers
|
greedy
sortings
|
1500
|
| 1203-D2 |
Remove the Substring (hard version)
|
binary search
greedy
implementation
+1
|
1700
|
| 1203-D1 |
Remove the Substring (easy version)
|
greedy
implementation
|
1600
|
| 1203-C |
Common Divisors
|
implementation
math
|
1300
|
| 1203-B |
Equal Rectangles
|
greedy
math
|
1200
|
| 1203-A |
Circle of Students
|
implementation
|
1000
|
| 1202-F |
You Are Given Some Letters...
|
binary search
implementation
math
|
2700
|
| 1202-E |
You Are Given Some Strings...
|
brute force
string suffix structures
strings
|
2400
|
| 1202-D |
Print a 1337-string...
|
combinatorics
constructive algorithms
math
+1
|
1900
|
| 1202-C |
You Are Given a WASD-string...
|
brute force
data structures
dp
+4
|
2100
|
| 1202-B |
You Are Given a Decimal String...
|
brute force
dp
shortest paths
|
1700
|
| 1202-A |
You Are Given Two Binary Strings...
|
bitmasks
greedy
|
1100
|
| 1201-E2 |
Knightmare (hard)
|
graphs
interactive
shortest paths
|
3000
|
| 1201-E1 |
Knightmare (easy)
|
graphs
interactive
shortest paths
|
2900
|
| 1201-D |
Treasure Hunting
|
binary search
dp
greedy
+1
|
2100
|
| 1201-C |
Maximum Median
|
binary search
greedy
math
+1
|
1400
|
| 1201-B |
Zero Array
|
greedy
math
|
1500
|
| 1201-A |
Important Exam
|
implementation
strings
|
900
|
| 1200-F |
Graph Traveler
|
brute force
data structures
dfs and similar
+5
|
2300
|
| 1200-E |
Compress Words
|
brute force
hashing
implementation
+2
|
2000
|
| 1200-D |
White Lines
|
brute force
data structures
dp
+2
|
1900
|
| 1200-C |
Round Corridor
|
math
number theory
|
1400
|
| 1200-B |
Block Adventure
|
dp
greedy
|
1200
|
| 1200-A |
Hotelier
|
brute force
data structures
implementation
|
800
|
| 1199-B |
Water Lily
|
geometry
math
|
1000
|
| 1199-A |
City Day
|
implementation
|
1000
|
| 1198-F |
GCD Groups 2
|
greedy
number theory
probabilities
|
2900
|
| 1198-E |
Rectangle Painting 2
|
flows
graph matchings
graphs
|
2500
|
| 1198-D |
Rectangle Painting 1
|
dp
|
2300
|
| 1198-C |
Matching vs Independent Set
|
constructive algorithms
graphs
greedy
+1
|
2000
|
| 1198-B |
Welfare State
|
binary search
brute force
data structures
+1
|
1600
|
| 1198-A |
MP3
|
sortings
two pointers
|
1600
|
| 1197-F |
Coloring Game
|
dp
games
matrices
|
2700
|
| 1197-E |
Culture Code
|
binary search
combinatorics
data structures
+3
|
2300
|
| 1197-D |
Yet Another Subarray Problem
|
dp
greedy
math
|
1900
|
| 1197-C |
Array Splitting
|
greedy
sortings
|
1400
|
| 1197-B |
Pillars
|
greedy
implementation
|
1000
|
| 1197-A |
DIY Wooden Ladder
|
greedy
math
sortings
|
900
|
| 1196-F |
K-th Path
|
brute force
constructive algorithms
shortest paths
+1
|
2200
|
| 1196-E |
Connected Component on a Chessboard
|
constructive algorithms
implementation
|
1800
|
| 1196-D2 |
RGB Substring (hard version)
|
data structures
dp
implementation
+1
|
1600
|
| 1196-D1 |
RGB Substring (easy version)
|
implementation
|
1500
|
| 1196-C |
Robot Breakout
|
implementation
|
1500
|