| 1375-E |
Inversion SwapSort
|
constructive algorithms
greedy
sortings
|
2500
|
| 1375-D |
Replace by MEX
|
brute force
constructive algorithms
sortings
|
1900
|
| 1375-C |
Element Extermination
|
constructive algorithms
data structures
greedy
|
1400
|
| 1375-B |
Neighbor Grid
|
constructive algorithms
greedy
|
1200
|
| 1375-A |
Sign Flipping
|
constructive algorithms
math
|
1100
|
| 1374-F |
Cyclic Shifts Sorting
|
brute force
constructive algorithms
implementation
+1
|
2400
|
| 1374-E2 |
Reading Books (hard version)
|
data structures
greedy
implementation
+3
|
2500
|
| 1374-E1 |
Reading Books (easy version)
|
data structures
greedy
sortings
|
1600
|
| 1374-D |
Zero Remainder Array
|
math
sortings
two pointers
|
1400
|
| 1374-C |
Move Brackets
|
greedy
strings
|
1000
|
| 1374-B |
Multiply by 2, divide by 6
|
math
|
900
|
| 1374-A |
Required Remainder
|
math
|
800
|
| 1373-G |
Pawns
|
data structures
divide and conquer
greedy
|
2600
|
| 1373-F |
Network Coverage
|
binary search
constructive algorithms
data structures
+1
|
2400
|
| 1373-E |
Sum of Digits
|
brute force
constructive algorithms
dp
+1
|
2200
|
| 1373-D |
Maximum Sum on Even Positions
|
divide and conquer
dp
greedy
+1
|
1600
|
| 1373-C |
Pluses and Minuses
|
math
|
1300
|
| 1373-B |
01 Game
|
games
|
900
|
| 1373-A |
Donut Shops
|
greedy
implementation
math
|
1000
|
| 1372-F |
Omkar and Modes
|
binary search
divide and conquer
interactive
|
2700
|
| 1372-E |
Omkar and Last Floor
|
dp
greedy
two pointers
|
2900
|
| 1372-D |
Omkar and Circle
|
brute force
dp
games
+1
|
2100
|
| 1372-C |
Omkar and Baseball
|
constructive algorithms
math
|
1500
|
| 1372-B |
Omkar and Last Class of Math
|
greedy
math
number theory
|
1300
|
| 1372-A |
Omkar and Completion
|
constructive algorithms
implementation
|
800
|
| 1371-F |
Raging Thunder
|
data structures
divide and conquer
implementation
|
2800
|
| 1371-E2 |
Asterism (Hard Version)
|
binary search
combinatorics
dp
+3
|
2300
|
| 1371-E1 |
Asterism (Easy Version)
|
binary search
brute force
combinatorics
+3
|
1900
|
| 1371-D |
Grid-00100
|
constructive algorithms
greedy
implementation
|
1600
|
| 1371-C |
A Cookie for You
|
greedy
implementation
math
|
1300
|
| 1371-B |
Magical Calendar
|
math
|
1200
|
| 1371-A |
Magical Sticks
|
math
|
800
|
| 1370-F2 |
The Hidden Pair (Hard Version)
|
binary search
dfs and similar
graphs
+3
|
2700
|
| 1370-F1 |
The Hidden Pair (Easy Version)
|
binary search
dfs and similar
graphs
+3
|
2400
|
| 1370-E |
Binary Subsequence Rotation
|
binary search
constructive algorithms
data structures
+1
|
2100
|
| 1370-D |
Odd-Even Subsequence
|
binary search
dp
dsu
+2
|
2000
|
| 1370-C |
Number Game
|
games
math
number theory
|
1400
|
| 1370-B |
GCD Compression
|
constructive algorithms
math
number theory
|
1100
|
| 1370-A |
Maximum GCD
|
greedy
implementation
math
+1
|
800
|
| 1369-F |
BareLee
|
dfs and similar
dp
games
|
2700
|
| 1369-E |
DeadLee
|
data structures
dfs and similar
greedy
+2
|
2400
|
| 1369-D |
TediousLee
|
dp
graphs
greedy
+2
|
1900
|
| 1369-C |
RationalLee
|
greedy
math
sortings
+1
|
1400
|
| 1369-B |
AccurateLee
|
greedy
implementation
strings
|
1200
|
| 1369-A |
FashionabLee
|
geometry
math
|
800
|
| 1368-H2 |
Breadboard Capacity (hard version)
|
|
3500
|
| 1368-H1 |
Breadboard Capacity (easy version)
|
dp
flows
greedy
|
3300
|
| 1368-G |
Shifting Dominoes
|
data structures
geometry
graphs
+1
|
3200
|
| 1368-F |
Lamps on a Circle
|
games
implementation
interactive
+1
|
2600
|
| 1368-E |
Ski Accidents
|
constructive algorithms
graphs
greedy
|
2500
|