| 1218-A |
BubbleReactor
|
dp
graphs
|
2800
|
| 1217-F |
Forced Online Queries Problem
|
data structures
divide and conquer
dsu
+2
|
2600
|
| 1217-E |
Sum Queries?
|
data structures
greedy
implementation
+1
|
2300
|
| 1217-D |
Coloring Edges
|
constructive algorithms
dfs and similar
graphs
|
2100
|
| 1217-C |
The Number Of Good Substrings
|
binary search
bitmasks
brute force
|
1700
|
| 1217-B |
Zmei Gorynich
|
greedy
math
|
1600
|
| 1217-A |
Creating a Character
|
binary search
math
|
1300
|
| 1216-F |
Wi-Fi
|
data structures
dp
greedy
|
2100
|
| 1216-E2 |
Numerical Sequence (hard version)
|
binary search
math
|
2200
|
| 1216-E1 |
Numerical Sequence (easy version)
|
binary search
brute force
math
|
1900
|
| 1216-D |
Swords
|
math
|
1300
|
| 1216-C |
White Sheet
|
geometry
math
|
1700
|
| 1216-B |
Shooting
|
greedy
implementation
sortings
|
900
|
| 1216-A |
Prefixes
|
strings
|
800
|
| 1215-F |
Radio Stations
|
2-sat
|
2700
|
| 1215-E |
Marbles
|
bitmasks
dp
|
2200
|
| 1215-D |
Ticket Game
|
games
greedy
math
|
1700
|
| 1215-C |
Swap Letters
|
constructive algorithms
greedy
|
1500
|
| 1215-B |
The Number of Products
|
combinatorics
dp
implementation
|
1400
|
| 1215-A |
Yellow Cards
|
greedy
implementation
math
|
1000
|
| 1214-H |
Tiles Placement
|
constructive algorithms
dfs and similar
trees
|
2800
|
| 1214-G |
Feeling Good
|
bitmasks
data structures
|
3200
|
| 1214-F |
Employment
|
greedy
sortings
|
2700
|
| 1214-E |
Petya and Construction Set
|
constructive algorithms
graphs
math
+2
|
2000
|
| 1214-D |
Treasure Island
|
dfs and similar
dp
flows
+1
|
1900
|
| 1214-C |
Bad Sequence
|
data structures
greedy
|
1200
|
| 1214-B |
Badges
|
brute force
math
|
1100
|
| 1214-A |
Optimal Currency Exchange
|
brute force
math
|
1400
|
| 1213-G |
Path Queries
|
divide and conquer
dsu
graphs
+2
|
1800
|
| 1213-F |
Unstable String Sort
|
data structures
dfs and similar
dsu
+4
|
2100
|
| 1213-E |
Two Small Strings
|
brute force
constructive algorithms
|
1900
|
| 1213-D2 |
Equalizing by Division (hard version)
|
brute force
math
sortings
|
1600
|
| 1213-D1 |
Equalizing by Division (easy version)
|
brute force
implementation
|
1500
|
| 1213-C |
Book Reading
|
math
|
1200
|
| 1213-B |
Bad Prices
|
data structures
implementation
|
1100
|
| 1213-A |
Chips Moving
|
math
|
900
|
| 1211-I |
Unusual Graph
|
*special
graphs
|
3000
|
| 1211-H |
Road Repair in Treeland
|
*special
binary search
dp
+1
|
3100
|
| 1211-G |
King's Path
|
*special
math
trees
|
2500
|
| 1211-F |
kotlinkotlinkotlinkotlin...
|
*special
graphs
implementation
+1
|
2300
|
| 1211-E |
Double Permutation Inc.
|
*special
binary search
greedy
|
2000
|
| 1211-D |
Teams
|
*special
binary search
greedy
+1
|
2000
|
| 1211-C |
Ice Cream
|
*special
greedy
sortings
|
1700
|
| 1211-B |
Traveling Around the Golden Ring of Berland
|
*special
implementation
|
1500
|
| 1211-A |
Three Problems
|
*special
implementation
|
1000
|
| 1210-G |
Mateusz and Escape Room
|
dp
|
3500
|
| 1210-F2 |
Marek and Matching (hard version)
|
brute force
probabilities
|
3200
|
| 1210-F1 |
Marek and Matching (easy version)
|
brute force
probabilities
|
3100
|
| 1210-E |
Wojtek and Card Tricks
|
math
|
2700
|
| 1210-D |
Konrad and Company Evaluation
|
graphs
|
2400
|