| 1699-E |
Three Days Grace
|
data structures
dp
greedy
+3
|
2600
|
| 1699-D |
Almost Triple Deletions
|
data structures
dp
greedy
|
2300
|
| 1699-C |
The Third Problem
|
combinatorics
constructive algorithms
math
|
1700
|
| 1699-B |
Almost Ternary Matrix
|
bitmasks
constructive algorithms
matrices
|
900
|
| 1699-A |
The Third Three Number Problem
|
constructive algorithms
math
|
800
|
| 1698-G |
Long Binary String
|
bitmasks
math
matrices
+2
|
2900
|
| 1698-F |
Equal Reversal
|
constructive algorithms
graphs
implementation
+1
|
2800
|
| 1698-E |
PermutationForces II
|
brute force
combinatorics
greedy
+3
|
2300
|
| 1698-D |
Fixed Point Guessing
|
binary search
constructive algorithms
interactive
|
1600
|
| 1698-C |
3SUM Closure
|
brute force
data structures
|
1300
|
| 1698-B |
Rising Sand
|
constructive algorithms
greedy
implementation
|
800
|
| 1698-A |
XOR Mixup
|
bitmasks
brute force
|
800
|
| 1697-F |
Too Many Constraints
|
2-sat
constructive algorithms
graphs
+1
|
2800
|
| 1697-E |
Coloring
|
brute force
combinatorics
constructive algorithms
+6
|
2400
|
| 1697-D |
Guess The String
|
binary search
constructive algorithms
interactive
|
1900
|
| 1697-C |
awoo's Favorite Problem
|
binary search
constructive algorithms
data structures
+4
|
1400
|
| 1697-B |
Promo
|
greedy
sortings
|
900
|
| 1697-A |
Parkway Walk
|
greedy
implementation
|
800
|
| 1696-H |
Maximum Product?
|
brute force
combinatorics
dp
+4
|
3500
|
| 1696-G |
Fishingprince Plays With Array Again
|
brute force
data structures
geometry
+1
|
3300
|
| 1696-F |
Tree Recovery
|
brute force
constructive algorithms
dfs and similar
+3
|
2600
|
| 1696-E |
Placing Jinas
|
combinatorics
math
|
2000
|
| 1696-D |
Permutation Graph
|
binary search
constructive algorithms
data structures
+3
|
1900
|
| 1696-C |
Fishingprince Plays With Array
|
constructive algorithms
greedy
implementation
+1
|
1400
|
| 1696-B |
NIT Destroys the Universe
|
greedy
|
900
|
| 1696-A |
NIT orz!
|
bitmasks
greedy
|
800
|
| 1695-E |
Ambiguous Dominoes
|
constructive algorithms
dfs and similar
graphs
|
2700
|
| 1695-D2 |
Tree Queries (Hard Version)
|
constructive algorithms
dfs and similar
dp
+2
|
2300
|
| 1695-D1 |
Tree Queries (Easy Version)
|
brute force
constructive algorithms
dfs and similar
+3
|
2200
|
| 1695-C |
Zero Path
|
brute force
data structures
dp
+3
|
1700
|
| 1695-B |
Circle Game
|
games
greedy
|
1000
|
| 1695-A |
Subrectangle Guess
|
games
|
800
|
| 1694-B |
Paranoid String
|
constructive algorithms
greedy
|
1200
|
| 1694-A |
Creep
|
greedy
implementation
|
800
|
| 1693-F |
I Might Be Wrong
|
binary search
greedy
two pointers
|
3400
|
| 1693-E |
Outermost Maximums
|
data structures
greedy
|
3400
|
| 1693-D |
Decinc Dividing
|
brute force
data structures
divide and conquer
+2
|
2800
|
| 1693-C |
Keshi in Search of AmShZ
|
graphs
greedy
shortest paths
|
2300
|
| 1693-B |
Fake Plastic Trees
|
dfs and similar
dp
greedy
+1
|
1700
|
| 1693-A |
Directional Increase
|
greedy
|
1300
|
| 1692-H |
Gambling
|
data structures
dp
greedy
+1
|
1700
|
| 1692-G |
2^Sort
|
data structures
dp
sortings
+1
|
1400
|
| 1692-F |
3SUM
|
brute force
math
|
1300
|
| 1692-E |
Binary Deque
|
binary search
implementation
two pointers
|
1200
|
| 1692-D |
The Clock
|
brute force
implementation
|
1100
|
| 1692-C |
Where's the Bishop?
|
implementation
|
800
|
| 1692-B |
All Distinct
|
greedy
sortings
|
800
|
| 1692-A |
Marathon
|
implementation
|
800
|
| 1691-F |
K-Set Tree
|
combinatorics
dfs and similar
dp
+2
|
2500
|
| 1691-E |
Number of Groups
|
data structures
dfs and similar
dsu
+3
|
2300
|