| 1398-D |
Colored Rectangles
|
dp
greedy
sortings
|
1800
|
| 1398-C |
Good Subarrays
|
data structures
dp
math
|
1600
|
| 1398-B |
Substring Removal Game
|
games
greedy
sortings
|
800
|
| 1398-A |
Bad Triangle
|
geometry
math
|
800
|
| 1397-B |
Power Sequence
|
brute force
math
number theory
+1
|
1500
|
| 1397-A |
Juggling Letters
|
greedy
strings
|
800
|
| 1396-E |
Distance Matching
|
constructive algorithms
dfs and similar
trees
|
3200
|
| 1396-D |
Rainbow Rectangles
|
data structures
sortings
two pointers
|
3300
|
| 1396-C |
Monster Invaders
|
dp
greedy
implementation
|
2300
|
| 1396-B |
Stoned Game
|
brute force
constructive algorithms
games
+1
|
1800
|
| 1396-A |
Multiples of Length
|
constructive algorithms
greedy
number theory
|
1600
|
| 1395-C |
Boboniu and Bit Operations
|
bitmasks
brute force
dp
+1
|
1600
|
| 1395-B |
Boboniu Plays Chess
|
constructive algorithms
|
1100
|
| 1395-A |
Boboniu Likes to Color Balls
|
brute force
math
|
1000
|
| 1394-E |
Boboniu and Banknote Collection
|
strings
|
3500
|
| 1394-D |
Boboniu and Jianghu
|
dp
greedy
sortings
+1
|
2800
|
| 1394-C |
Boboniu and String
|
binary search
geometry
ternary search
|
2600
|
| 1394-B |
Boboniu Walks on Graph
|
brute force
dfs and similar
graphs
+1
|
2300
|
| 1394-A |
Boboniu Chats with Du
|
dp
greedy
sortings
+1
|
1800
|
| 1393-E2 |
Twilight and Ancient Scroll (harder version)
|
dp
hashing
implementation
+3
|
3200
|
| 1393-E1 |
Twilight and Ancient Scroll (easier version)
|
dp
hashing
implementation
+2
|
2800
|
| 1393-D |
Rarity and New Dress
|
dfs and similar
dp
implementation
+1
|
2100
|
| 1393-C |
Pinkie Pie Eats Patty-cakes
|
constructive algorithms
greedy
math
+1
|
1700
|
| 1393-B |
Applejack and Storages
|
constructive algorithms
data structures
greedy
+1
|
1400
|
| 1393-A |
Rainbow Dash, Fluttershy and Chess Coloring
|
greedy
math
|
800
|
| 1392-I |
Kevin and Grid
|
fft
graphs
math
|
3300
|
| 1392-H |
ZS Shuffles Cards
|
combinatorics
dp
math
+1
|
3000
|
| 1392-G |
Omkar and Pies
|
bitmasks
dfs and similar
dp
+2
|
2900
|
| 1392-F |
Omkar and Landslide
|
binary search
constructive algorithms
data structures
+2
|
2400
|
| 1392-E |
Omkar and Duck
|
bitmasks
constructive algorithms
interactive
+1
|
2100
|
| 1392-D |
Omkar and Bed Wars
|
dp
greedy
|
1700
|
| 1392-C |
Omkar and Waterslide
|
greedy
implementation
|
1200
|
| 1392-B |
Omkar and Infinity Clock
|
implementation
math
|
800
|
| 1392-A |
Omkar and Password
|
greedy
math
|
800
|
| 1391-E |
Pairs of Pairs
|
constructive algorithms
dfs and similar
graphs
+2
|
2600
|
| 1391-D |
505
|
bitmasks
brute force
constructive algorithms
+3
|
2000
|
| 1391-C |
Cyclic Permutations
|
combinatorics
dp
graphs
+1
|
1500
|
| 1391-B |
Fix You
|
brute force
greedy
implementation
|
800
|
| 1391-A |
Suborrays
|
constructive algorithms
math
|
800
|
| 1389-G |
Directing Edges
|
dfs and similar
dp
graphs
+1
|
2800
|
| 1389-F |
Bicolored Segments
|
data structures
dp
graph matchings
+1
|
2600
|
| 1389-E |
Calendar Ambiguity
|
math
number theory
|
2200
|
| 1389-D |
Segment Intersections
|
brute force
greedy
implementation
+1
|
2100
|
| 1389-C |
Good String
|
brute force
dp
greedy
+1
|
1500
|
| 1389-B |
Array Walk
|
brute force
dp
greedy
|
1600
|
| 1389-A |
LCM Problem
|
constructive algorithms
greedy
math
+1
|
800
|
| 1388-E |
Uncle Bogdan and Projections
|
data structures
geometry
sortings
|
2700
|
| 1388-D |
Captain Flint and Treasure
|
data structures
dfs and similar
graphs
+3
|
2000
|
| 1388-C |
Uncle Bogdan and Country Happiness
|
dfs and similar
greedy
math
+1
|
1800
|
| 1388-B |
Captain Flint and a Long Voyage
|
greedy
math
|
1000
|