| 1875-D |
Jellyfish and Mex
|
dp
|
1600
|
| 1875-C |
Jellyfish and Green Apple
|
bitmasks
greedy
math
+1
|
1400
|
| 1875-A |
Jellyfish and Undertale
|
brute force
greedy
|
900
|
| 1874-G |
Jellyfish and Inscryption
|
dp
|
3500
|
| 1874-F |
Jellyfish and OEIS
|
dp
|
3500
|
| 1874-E |
Jellyfish and Hack
|
dp
math
|
3000
|
| 1874-D |
Jellyfish and Miku
|
divide and conquer
dp
math
+1
|
2800
|
| 1874-C |
Jellyfish and EVA
|
dp
graphs
greedy
+2
|
2300
|
| 1874-B |
Jellyfish and Math
|
bitmasks
brute force
dfs and similar
+3
|
2400
|
| 1874-A |
Jellyfish and Game
|
brute force
games
greedy
+1
|
1200
|
| 1873-H |
Mad City
|
dfs and similar
dsu
games
+3
|
1700
|
| 1873-G |
ABBC or BACB
|
constructive algorithms
greedy
|
1500
|
| 1873-F |
Money Trees
|
binary search
greedy
math
+1
|
1300
|
| 1873-E |
Building an Aquarium
|
binary search
sortings
|
1100
|
| 1873-D |
1D Eraser
|
greedy
implementation
two pointers
|
800
|
| 1873-C |
Target Practice
|
implementation
math
|
800
|
| 1873-B |
Good Kid
|
brute force
greedy
math
|
800
|
| 1873-A |
Short Sort
|
brute force
implementation
|
800
|
| 1872-G |
Replace With Product
|
brute force
greedy
math
|
2000
|
| 1872-F |
Selling a Menagerie
|
dfs and similar
dsu
graphs
+2
|
1800
|
| 1872-E |
Data Structures Fan
|
binary search
bitmasks
data structures
+1
|
1500
|
| 1872-D |
Plus Minus Permutation
|
math
|
1200
|
| 1872-C |
Non-coprime Split
|
math
number theory
|
1100
|
| 1872-B |
The Corridor or There and Back Again
|
greedy
implementation
|
900
|
| 1872-A |
Two Vessels
|
brute force
greedy
math
|
800
|
| 1870-H |
Standard Graph Problem
|
data structures
graphs
greedy
+1
|
3500
|
| 1870-G |
MEXanization
|
data structures
|
3300
|
| 1870-F |
Lazy Numbers
|
binary search
math
|
2900
|
| 1870-E |
Another MEX Problem
|
bitmasks
brute force
dp
+1
|
2300
|
| 1870-D |
Prefix Purchase
|
greedy
implementation
sortings
|
1800
|
| 1870-C |
Colorful Table
|
binary search
data structures
dp
+3
|
1300
|
| 1870-B |
Friendly Arrays
|
bitmasks
greedy
math
|
1200
|
| 1870-A |
MEXanized Array
|
constructive algorithms
greedy
math
|
800
|
| 1869-B |
2D Traveling
|
geometry
math
shortest paths
+1
|
1100
|
| 1869-A |
Make It Zero
|
constructive algorithms
|
900
|
| 1868-F |
LIS?
|
data structures
greedy
implementation
|
3500
|
| 1868-E |
Min-Sum-Max
|
constructive algorithms
dp
greedy
|
3500
|
| 1868-D |
Flower-like Pseudotree
|
constructive algorithms
graphs
greedy
+2
|
3000
|
| 1868-C |
Travel Plan
|
combinatorics
dp
implementation
+2
|
2400
|
| 1868-B2 |
Candy Party (Hard Version)
|
bitmasks
constructive algorithms
dp
+3
|
2100
|
| 1868-B1 |
Candy Party (Easy Version)
|
bitmasks
constructive algorithms
graphs
+3
|
1700
|
| 1868-A |
Fill in the Matrix
|
constructive algorithms
implementation
|
1300
|
| 1867-F |
Most Different Tree
|
brute force
constructive algorithms
dfs and similar
+2
|
2700
|
| 1867-E2 |
Salyg1n and Array (hard version)
|
constructive algorithms
interactive
|
2200
|
| 1867-E1 |
Salyg1n and Array (simple version)
|
constructive algorithms
interactive
math
|
2000
|
| 1867-D |
Cyclic Operations
|
brute force
constructive algorithms
dfs and similar
+3
|
1800
|
| 1867-C |
Salyg1n and the MEX Game
|
constructive algorithms
data structures
games
+2
|
1300
|
| 1867-B |
XOR Palindromes
|
bitmasks
constructive algorithms
strings
|
1100
|
| 1867-A |
green_gold_dog, array and permutation
|
constructive algorithms
sortings
|
800
|
| 1866-M |
Mighty Rock Tower
|
brute force
combinatorics
dp
+2
|
2400
|