| 1736-E |
Swap and Take
|
dp
greedy
|
2600
|
| 1736-D |
Equal Binary Subsequences
|
constructive algorithms
geometry
greedy
+2
|
2200
|
| 1736-C2 |
Good Subarrays (Hard Version)
|
binary search
data structures
dp
+1
|
2400
|
| 1736-C1 |
Good Subarrays (Easy Version)
|
binary search
data structures
schedules
+1
|
1300
|
| 1736-B |
Playing with GCD
|
math
number theory
|
1200
|
| 1736-A |
Make A Equal to B
|
brute force
greedy
sortings
|
800
|
| 1735-F |
Pebbles and Beads
|
data structures
geometry
|
2900
|
| 1735-E |
House Planning
|
constructive algorithms
data structures
graph matchings
+1
|
2400
|
| 1735-D |
Meta-set
|
brute force
combinatorics
data structures
+2
|
1700
|
| 1735-C |
Phase Shift
|
dfs and similar
dsu
graphs
+3
|
1400
|
| 1735-B |
Tea with Tangerines
|
greedy
math
|
900
|
| 1735-A |
Working Week
|
constructive algorithms
greedy
math
|
800
|
| 1734-F |
Zeros and Ones
|
bitmasks
divide and conquer
dp
+1
|
2500
|
| 1734-E |
Rectangular Congruence
|
constructive algorithms
number theory
|
2100
|
| 1734-D |
Slime Escape
|
data structures
dp
greedy
+1
|
1800
|
| 1734-C |
Removing Smallest Multiples
|
greedy
math
|
1200
|
| 1734-B |
Bright, Nice, Brilliant
|
constructive algorithms
|
800
|
| 1734-A |
Select Three Sticks
|
brute force
greedy
sortings
|
800
|
| 1733-E |
Conveyor
|
constructive algorithms
dp
math
|
2700
|
| 1733-D2 |
Zero-One (Hard Version)
|
dp
greedy
|
2000
|
| 1733-D1 |
Zero-One (Easy Version)
|
constructive algorithms
greedy
math
|
1400
|
| 1733-C |
Parity Shuffle Sorting
|
constructive algorithms
sortings
|
1300
|
| 1733-B |
Rule of League
|
constructive algorithms
math
|
900
|
| 1733-A |
Consecutive Sum
|
greedy
sortings
|
800
|
| 1732-E |
Location
|
data structures
dp
math
+1
|
2800
|
| 1732-D2 |
Balance (Hard version)
|
brute force
data structures
number theory
|
2400
|
| 1732-D1 |
Balance (Easy version)
|
brute force
data structures
implementation
+1
|
1500
|
| 1732-C2 |
Sheikh (Hard Version)
|
binary search
bitmasks
brute force
+3
|
2100
|
| 1732-C1 |
Sheikh (Easy version)
|
binary search
bitmasks
greedy
+1
|
1800
|
| 1732-B |
Ugu
|
brute force
dp
greedy
+1
|
900
|
| 1732-A |
Bestie
|
brute force
combinatorics
constructive algorithms
+3
|
1000
|
| 1731-F |
Function Sum
|
brute force
combinatorics
dp
+2
|
2500
|
| 1731-E |
Graph Cost
|
dp
greedy
math
+1
|
2000
|
| 1731-D |
Valiant's New Map
|
binary search
brute force
data structures
+2
|
1700
|
| 1731-C |
Even Subarrays
|
bitmasks
brute force
hashing
+2
|
1700
|
| 1731-B |
Kill Demodogs
|
greedy
math
|
1100
|
| 1731-A |
Joey Takes Money
|
greedy
math
|
800
|
| 1730-F |
Almost Sorted
|
bitmasks
data structures
dp
|
2700
|
| 1730-E |
Maximums and Minimums
|
combinatorics
data structures
divide and conquer
+1
|
2700
|
| 1730-D |
Prefixes and Suffixes
|
constructive algorithms
strings
two pointers
|
2200
|
| 1730-C |
Minimum Notation
|
data structures
greedy
math
+1
|
1200
|
| 1730-B |
Meeting on the Line
|
binary search
geometry
greedy
+3
|
1600
|
| 1730-A |
Planets
|
data structures
greedy
sortings
|
800
|
| 1729-G |
Cut Substrings
|
combinatorics
dp
hashing
+2
|
2100
|
| 1729-F |
Kirei and the Linear Function
|
hashing
math
|
1900
|
| 1729-E |
Guess the Cycle Size
|
interactive
probabilities
|
1800
|
| 1729-D |
Friends and the Restaurant
|
greedy
sortings
two pointers
|
1200
|
| 1729-C |
Jumping on Tiles
|
constructive algorithms
strings
|
1100
|
| 1729-B |
Decode String
|
greedy
strings
|
800
|
| 1729-A |
Two Elevators
|
math
|
800
|