| 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
|
| 1368-D |
AND, OR and square sum
|
bitmasks
greedy
math
|
1700
|
| 1368-C |
Even Picture
|
constructive algorithms
|
1500
|
| 1368-B |
Codeforces Subsequences
|
brute force
constructive algorithms
greedy
+2
|
1500
|
| 1368-A |
C+=
|
brute force
greedy
implementation
+1
|
800
|
| 1367-F2 |
Flying Sort (Hard Version)
|
binary search
data structures
dp
+3
|
2400
|
| 1367-F1 |
Flying Sort (Easy Version)
|
dp
greedy
two pointers
|
2100
|
| 1367-E |
Necklace Assembly
|
brute force
dfs and similar
dp
+3
|
1900
|
| 1367-D |
Task On The Board
|
constructive algorithms
greedy
implementation
+1
|
1800
|
| 1367-C |
Social Distance
|
constructive algorithms
greedy
math
|
1300
|
| 1367-B |
Even Array
|
greedy
math
|
800
|
| 1367-A |
Short Substrings
|
implementation
strings
|
800
|
| 1366-G |
Construct the String
|
data structures
dp
strings
|
2700
|
| 1366-F |
Jog Around The Graph
|
binary search
dp
geometry
+1
|
2700
|
| 1366-E |
Two Arrays
|
binary search
brute force
combinatorics
+3
|
2100
|
| 1366-D |
Two Divisors
|
constructive algorithms
math
number theory
|
2000
|
| 1366-C |
Palindromic Paths
|
greedy
math
|
1500
|
| 1366-B |
Shuffle
|
math
two pointers
|
1300
|
| 1366-A |
Shovels and Swords
|
binary search
greedy
math
|
1100
|
| 1365-G |
Secure Password
|
bitmasks
combinatorics
constructive algorithms
+2
|
2800
|
| 1365-F |
Swaps Again
|
constructive algorithms
implementation
sortings
|
2100
|
| 1365-E |
Maximum Subsequence Value
|
brute force
constructive algorithms
|
1900
|
| 1365-D |
Solve The Maze
|
constructive algorithms
dfs and similar
dsu
+4
|
1700
|
| 1365-C |
Rotation Matching
|
constructive algorithms
data structures
greedy
+1
|
1400
|
| 1365-B |
Trouble Sort
|
constructive algorithms
implementation
|
1300
|
| 1365-A |
Matrix Game
|
games
greedy
implementation
|
1100
|
| 1364-E |
X-OR
|
bitmasks
constructive algorithms
divide and conquer
+2
|
2700
|
| 1364-D |
Ehab's Last Corollary
|
constructive algorithms
dfs and similar
graphs
+3
|
2100
|
| 1364-C |
Ehab and Prefix MEXs
|
brute force
constructive algorithms
greedy
|
1600
|
| 1364-B |
Most socially-distanced subsequence
|
greedy
two pointers
|
1300
|
| 1364-A |
XXXXX
|
brute force
data structures
number theory
+1
|
1200
|
| 1363-F |
Rotating Substrings
|
dp
strings
|
2600
|
| 1363-E |
Tree Shuffling
|
dfs and similar
dp
greedy
+1
|
2000
|
| 1363-D |
Guess The Maximums
|
binary search
implementation
interactive
+1
|
2100
|
| 1363-C |
Game On Leaves
|
games
trees
|
1600
|
| 1363-B |
Subsequence Hate
|
implementation
strings
|
1400
|
| 1363-A |
Odd Selection
|
brute force
implementation
math
|
1200
|
| 1362-C |
Johnny and Another Rating Drop
|
bitmasks
greedy
math
|
1400
|