| 2115-D |
Gellyfish and Forget-Me-Not
|
bitmasks
dp
games
+2
|
2900
|
| 2115-C |
Gellyfish and Eternal Violet
|
combinatorics
dp
greedy
+2
|
2700
|
| 2115-B |
Gellyfish and Camellia Japonica
|
brute force
constructive algorithms
dfs and similar
+4
|
2100
|
| 2115-A |
Gellyfish and Flaming Peony
|
constructive algorithms
dp
math
+1
|
1500
|
| 2114-G |
Build an Array
|
brute force
constructive algorithms
dp
+3
|
2200
|
| 2114-F |
Small Operations
|
binary search
brute force
dfs and similar
+4
|
2000
|
| 2114-E |
Kirei Attacks the Estate
|
dfs and similar
dp
greedy
+1
|
1400
|
| 2114-D |
Come a Little Closer
|
brute force
greedy
implementation
+1
|
1400
|
| 2114-C |
Need More Arrays
|
dp
greedy
|
1000
|
| 2114-B |
Not Quite a Palindromic String
|
greedy
math
|
900
|
| 2114-A |
Square Year
|
binary search
brute force
math
|
800
|
| 2113-F |
Two Arrays
|
constructive algorithms
dfs and similar
graphs
+1
|
2500
|
| 2113-E |
From Kazan with Love
|
dfs and similar
graphs
implementation
+1
|
2800
|
| 2113-D |
Cheater
|
binary search
constructive algorithms
greedy
+1
|
2200
|
| 2113-C |
Smilo and Minecraft
|
brute force
constructive algorithms
greedy
|
1700
|
| 2113-B |
Good Start
|
constructive algorithms
math
|
1200
|
| 2113-A |
Shashliks
|
greedy
math
|
800
|
| 2112-F |
Variables and Operations
|
graphs
greedy
shortest paths
|
2800
|
| 2112-E |
Tree Colorings
|
combinatorics
dfs and similar
dp
+4
|
2200
|
| 2112-D |
Reachability and Tree
|
constructive algorithms
dfs and similar
graphs
+1
|
1700
|
| 2112-C |
Coloring Game
|
binary search
brute force
greedy
+1
|
1300
|
| 2112-B |
Shrinking Array
|
brute force
greedy
|
1100
|
| 2112-A |
Race
|
implementation
math
|
800
|
| 2111-G |
Divisible Subarrays
|
binary search
bitmasks
brute force
+2
|
2900
|
| 2111-F |
Puzzle
|
brute force
constructive algorithms
greedy
+1
|
2400
|
| 2111-E |
Changing the String
|
binary search
data structures
greedy
+3
|
1900
|
| 2111-D |
Creating a Schedule
|
constructive algorithms
data structures
greedy
+2
|
1400
|
| 2111-C |
Equal Values
|
brute force
greedy
two pointers
|
1100
|
| 2111-B |
Fibonacci Cubes
|
brute force
dp
implementation
+1
|
1100
|
| 2111-A |
Energy Crystals
|
greedy
implementation
math
|
800
|
| 2110-F |
Faculty
|
brute force
greedy
math
+1
|
2400
|
| 2110-E |
Melody
|
dfs and similar
graphs
implementation
|
2300
|
| 2110-D |
Fewer Batteries
|
binary search
dfs and similar
dp
+3
|
1700
|
| 2110-C |
Racing
|
constructive algorithms
greedy
|
1400
|
| 2110-B |
Down with Brackets
|
strings
|
900
|
| 2110-A |
Fashionable Array
|
implementation
sortings
|
800
|
| 2109-F |
Penguin Steps
|
binary search
dfs and similar
flows
+2
|
3000
|
| 2109-E |
Binary String Wowee
|
combinatorics
dp
strings
|
2400
|
| 2109-D |
D/D/D
|
dfs and similar
graphs
greedy
+1
|
1900
|
| 2109-C3 |
Hacking Numbers (Hard Version)
|
constructive algorithms
interactive
math
+1
|
2600
|
| 2109-C2 |
Hacking Numbers (Medium Version)
|
constructive algorithms
interactive
math
+1
|
1700
|
| 2109-C1 |
Hacking Numbers (Easy Version)
|
bitmasks
constructive algorithms
interactive
+2
|
1500
|
| 2109-B |
Slice to Survive
|
bitmasks
greedy
math
|
1200
|
| 2109-A |
It's Time To Duel
|
implementation
|
800
|
| 2108-F |
Fallen Towers
|
binary search
greedy
|
2900
|
| 2108-E |
Spruce Dispute
|
constructive algorithms
dfs and similar
graphs
+4
|
2600
|
| 2108-D |
Needle in a Numstack
|
binary search
brute force
implementation
+1
|
2200
|
| 2108-C |
Neo's Escape
|
binary search
brute force
data structures
+5
|
1500
|
| 2108-B |
SUMdamental Decomposition
|
bitmasks
constructive algorithms
greedy
+2
|
1300
|
| 2108-A |
Permutation Warm-Up
|
combinatorics
greedy
math
|
800
|