| 1808-A |
Lucky Numbers
|
brute force
implementation
|
900
|
| 1807-G2 |
Subsequence Addition (Hard Version)
|
bitmasks
dp
greedy
+2
|
1100
|
| 1807-G1 |
Subsequence Addition (Easy Version)
|
brute force
data structures
dp
+3
|
1100
|
| 1807-F |
Bouncy Ball
|
brute force
dfs and similar
implementation
|
1700
|
| 1807-E |
Interview
|
binary search
implementation
interactive
|
1300
|
| 1807-D |
Odd Queries
|
data structures
implementation
|
900
|
| 1807-C |
Find and Replace
|
greedy
implementation
strings
|
800
|
| 1807-B |
Grab the Candies
|
greedy
|
800
|
| 1807-A |
Plus or Minus
|
implementation
|
800
|
| 1806-F2 |
GCD Master (hard version)
|
greedy
math
sortings
|
2900
|
| 1806-F1 |
GCD Master (easy version)
|
greedy
math
number theory
+1
|
2900
|
| 1806-E |
Tree Master
|
brute force
data structures
dfs and similar
+1
|
2200
|
| 1806-D |
DSU Master
|
combinatorics
dp
dsu
+1
|
2500
|
| 1806-C |
Sequence Master
|
brute force
constructive algorithms
math
|
1600
|
| 1806-B |
Mex Master
|
constructive algorithms
greedy
|
900
|
| 1806-A |
Walking Master
|
geometry
greedy
math
|
800
|
| 1805-F2 |
Survival of the Weakest (hard version)
|
greedy
math
sortings
+1
|
3100
|
| 1805-F1 |
Survival of the Weakest (easy version)
|
binary search
brute force
implementation
+2
|
2600
|
| 1805-E |
There Should Be a Lot of Maximums
|
brute force
data structures
dfs and similar
+3
|
2300
|
| 1805-D |
A Wide, Wide Graph
|
dfs and similar
dp
graphs
+2
|
1800
|
| 1805-C |
Place for a Selfie
|
binary search
data structures
geometry
+1
|
1400
|
| 1805-B |
The String Has a Target
|
greedy
strings
|
800
|
| 1805-A |
We Need the Zero
|
bitmasks
brute force
|
800
|
| 1804-H |
Code Lock
|
bitmasks
dp
|
3300
|
| 1804-G |
Flow Control
|
data structures
dsu
implementation
|
3500
|
| 1804-F |
Approximate Diameter
|
binary search
divide and conquer
graphs
+1
|
2700
|
| 1804-E |
Routing
|
bitmasks
brute force
dfs and similar
+2
|
2400
|
| 1804-D |
Accommodation
|
brute force
dp
greedy
+1
|
2000
|
| 1804-C |
Pull Your Luck
|
brute force
greedy
math
+1
|
1500
|
| 1804-B |
Vaccination
|
greedy
implementation
|
1000
|
| 1804-A |
Lame King
|
greedy
math
|
800
|
| 1802-B |
Settlement of Guinea Pigs
|
greedy
implementation
math
|
1000
|
| 1802-A |
Likes
|
greedy
implementation
|
800
|
| 1801-G |
A task for substrings
|
data structures
string suffix structures
strings
|
3400
|
| 1801-F |
Another n-dimensional chocolate bar
|
dp
math
meet-in-the-middle
+1
|
2700
|
| 1801-E |
Gasoline prices
|
data structures
divide and conquer
dsu
+2
|
3000
|
| 1801-D |
The way home
|
binary search
data structures
dp
+4
|
2100
|
| 1801-C |
Music Festival
|
binary search
data structures
dp
+2
|
1900
|
| 1801-B |
Buying gifts
|
data structures
greedy
sortings
|
1800
|
| 1801-A |
The Very Beautiful Blanket
|
bitmasks
constructive algorithms
|
1600
|
| 1800-G |
Symmetree
|
dfs and similar
hashing
implementation
+1
|
2200
|
| 1800-F |
Dasha and Nightmares
|
bitmasks
hashing
meet-in-the-middle
+1
|
1900
|
| 1800-E2 |
Unforgivable Curse (hard version)
|
brute force
constructive algorithms
dfs and similar
+4
|
1500
|
| 1800-E1 |
Unforgivable Curse (easy version)
|
brute force
constructive algorithms
dsu
+3
|
1400
|
| 1800-D |
Remove Two Letters
|
data structures
greedy
hashing
+1
|
1200
|
| 1800-C2 |
Powering the Hero (hard version)
|
data structures
greedy
|
1100
|
| 1800-C1 |
Powering the Hero (easy version)
|
data structures
greedy
|
1000
|
| 1800-B |
Count the Number of Pairs
|
greedy
strings
|
1000
|
| 1800-A |
Is It a Cat?
|
implementation
strings
|
800
|
| 1799-H |
Tree Cutting
|
bitmasks
dfs and similar
dp
|
3200
|