| 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
|
| 1388-A |
Captain Flint and Crew Recruitment
|
brute force
greedy
math
+1
|
800
|
| 1387-C |
Viruses
|
*special
dp
shortest paths
+1
|
2900
|
| 1387-B2 |
Village (Maximum)
|
*special
dfs and similar
trees
|
2500
|
| 1387-B1 |
Village (Minimum)
|
*special
dp
greedy
+1
|
2100
|
| 1387-A |
Graph
|
*special
binary search
dfs and similar
+3
|
2100
|
| 1386-C |
Joker
|
*special
bitmasks
data structures
+2
|
2800
|
| 1386-B |
Mixture
|
*special
data structures
geometry
+2
|
2900
|
| 1386-A |
Colors
|
*special
binary search
constructive algorithms
+1
|
2700
|
| 1385-G |
Columns Swaps
|
2-sat
dfs and similar
dsu
+2
|
2300
|
| 1385-F |
Removing Leaves
|
data structures
greedy
implementation
+1
|
2300
|
| 1385-E |
Directing Edges
|
constructive algorithms
dfs and similar
graphs
|
2000
|
| 1385-D |
a-Good String
|
bitmasks
brute force
divide and conquer
+2
|
1500
|
| 1385-C |
Make It Good
|
greedy
|
1200
|
| 1385-B |
Restore the Permutation by Merger
|
greedy
|
800
|
| 1385-A |
Three Pairwise Maximums
|
math
|
800
|
| 1384-B2 |
Koa and the Beach (Hard Version)
|
constructive algorithms
dp
greedy
+1
|
2200
|
| 1384-B1 |
Koa and the Beach (Easy Version)
|
brute force
dp
greedy
|
1900
|
| 1384-A |
Common Prefixes
|
constructive algorithms
greedy
strings
|
1200
|
| 1383-F |
Special Edges
|
flows
graphs
|
3200
|
| 1383-E |
Strange Operation
|
combinatorics
data structures
dp
|
2800
|
| 1383-D |
Rearrange
|
brute force
constructive algorithms
graphs
+2
|
2800
|
| 1383-C |
String Transformation 2
|
bitmasks
dp
graphs
+1
|
3100
|
| 1383-B |
GameGame
|
bitmasks
constructive algorithms
dp
+3
|
1900
|
| 1383-A |
String Transformation 1
|
dsu
graphs
greedy
+4
|
1700
|
| 1382-B |
Sequential Nim
|
dp
games
|
1100
|
| 1382-A |
Common Subsequence
|
brute force
|
800
|
| 1381-E |
Origami
|
geometry
math
sortings
|
3300
|
| 1381-D |
The Majestic Brown Tree Snake
|
dfs and similar
dp
greedy
+2
|
3000
|
| 1381-C |
Mastermind
|
constructive algorithms
graph matchings
greedy
+3
|
2500
|
| 1381-B |
Unmerge
|
dp
|
1800
|
| 1381-A2 |
Prefix Flip (Hard Version)
|
constructive algorithms
data structures
implementation
+2
|
1700
|
| 1381-A1 |
Prefix Flip (Easy Version)
|
constructive algorithms
data structures
strings
|
1300
|
| 1380-G |
Circular Dungeon
|
greedy
math
probabilities
|
2600
|
| 1380-F |
Strange Addition
|
data structures
dp
matrices
|
2600
|
| 1380-E |
Merging Towers
|
data structures
dsu
implementation
+1
|
2300
|
| 1380-D |
Berserk And Fireball
|
constructive algorithms
greedy
implementation
+2
|
2000
|
| 1380-C |
Create The Teams
|
brute force
dp
greedy
+2
|
1400
|