| 1545-C |
AquaMoon and Permutations
|
2-sat
brute force
combinatorics
+3
|
2800
|
| 1545-B |
AquaMoon and Chess
|
combinatorics
math
|
1900
|
| 1545-A |
AquaMoon and Strange Sort
|
sortings
|
1500
|
| 1543-E |
The Final Pursuit
|
bitmasks
constructive algorithms
divide and conquer
+3
|
2700
|
| 1543-D2 |
RPD and Rap Sheet (Hard Version)
|
brute force
constructive algorithms
interactive
+1
|
2200
|
| 1543-D1 |
RPD and Rap Sheet (Easy Version)
|
bitmasks
constructive algorithms
interactive
+1
|
1700
|
| 1543-C |
Need for Pink Slips
|
bitmasks
brute force
dfs and similar
+3
|
1900
|
| 1543-B |
Customising the Track
|
combinatorics
greedy
math
|
900
|
| 1543-A |
Exciting Bets
|
greedy
math
number theory
|
900
|
| 1542-E2 |
Abnormal Permutation Pairs (hard version)
|
combinatorics
dp
fft
+1
|
2700
|
| 1542-E1 |
Abnormal Permutation Pairs (easy version)
|
combinatorics
dp
fft
+1
|
2400
|
| 1542-D |
Priority Queue
|
combinatorics
dp
implementation
+2
|
2200
|
| 1542-C |
Strange Function
|
math
number theory
|
1600
|
| 1542-B |
Plus and Multiply
|
constructive algorithms
math
number theory
|
1500
|
| 1542-A |
Odd Set
|
math
|
800
|
| 1541-B |
Pleasant Pairs
|
brute force
implementation
math
+1
|
1200
|
| 1541-A |
Pretty Permutations
|
constructive algorithms
greedy
implementation
|
800
|
| 1540-E |
Tasty Dishes
|
math
matrices
|
3500
|
| 1540-D |
Inverse Inversions
|
binary search
brute force
data structures
|
3200
|
| 1540-C2 |
Converging Array (Hard Version)
|
dp
math
|
2900
|
| 1540-C1 |
Converging Array (Easy Version)
|
dp
math
|
2700
|
| 1540-B |
Tree Array
|
brute force
combinatorics
dp
+4
|
2300
|
| 1540-A |
Great Graphs
|
constructive algorithms
graphs
greedy
+2
|
1400
|
| 1539-F |
Strange Array
|
data structures
greedy
sortings
|
2600
|
| 1539-E |
Game with Cards
|
binary search
constructive algorithms
data structures
+3
|
2500
|
| 1539-D |
PriceFixed
|
binary search
greedy
implementation
+2
|
1600
|
| 1539-C |
Stable Groups
|
greedy
sortings
|
1200
|
| 1539-B |
Love Song
|
dp
implementation
strings
|
800
|
| 1539-A |
Contest Start
|
combinatorics
geometry
greedy
+1
|
1000
|
| 1538-G |
Gift Set
|
binary search
greedy
math
+1
|
2100
|
| 1538-F |
Interesting Function
|
binary search
dp
math
+1
|
1500
|
| 1538-E |
Funny Substrings
|
data structures
hashing
implementation
+2
|
2100
|
| 1538-D |
Another Problem About Dividing Numbers
|
constructive algorithms
math
number theory
|
1700
|
| 1538-C |
Number of Pairs
|
binary search
data structures
math
+1
|
1300
|
| 1538-B |
Friends and Candies
|
greedy
math
|
800
|
| 1538-A |
Stone Game
|
brute force
dp
greedy
|
800
|
| 1537-F |
Figure Fixing
|
constructive algorithms
dfs and similar
dsu
+3
|
2200
|
| 1537-E2 |
Erase and Extend (Hard Version)
|
binary search
data structures
greedy
+4
|
2200
|
| 1537-E1 |
Erase and Extend (Easy Version)
|
binary search
brute force
dp
+6
|
1600
|
| 1537-D |
Deleting Divisors
|
games
math
number theory
|
1700
|
| 1537-C |
Challenging Cliffs
|
constructive algorithms
greedy
implementation
+1
|
1200
|
| 1537-B |
Bad Boy
|
constructive algorithms
greedy
math
|
900
|
| 1537-A |
Arithmetic Array
|
greedy
math
|
800
|
| 1536-F |
Omkar and Akmar
|
chinese remainder theorem
combinatorics
constructive algorithms
+6
|
2600
|
| 1536-E |
Omkar and Forest
|
combinatorics
graphs
math
+1
|
2300
|
| 1536-D |
Omkar and Medians
|
data structures
greedy
implementation
|
2000
|
| 1536-C |
Diluc and Kaeya
|
data structures
dp
hashing
+1
|
1500
|
| 1536-B |
Prinzessin der Verurteilung
|
brute force
constructive algorithms
strings
|
1200
|
| 1536-A |
Omkar and Bad Story
|
brute force
constructive algorithms
|
800
|
| 1535-F |
String Distance
|
binary search
brute force
data structures
+3
|
3000
|