| 1927-D |
Find the Different Ones!
|
binary search
brute force
data structures
+4
|
1300
|
| 1927-C |
Choose the Different Ones!
|
brute force
greedy
math
|
1000
|
| 1927-B |
Following the String
|
constructive algorithms
greedy
strings
|
900
|
| 1927-A |
Make it White
|
greedy
strings
|
800
|
| 1926-G |
Vlad and Trouble at MIT
|
dfs and similar
dp
flows
+4
|
1900
|
| 1926-F |
Vlad and Avoiding X
|
bitmasks
brute force
dfs and similar
+2
|
2200
|
| 1926-E |
Vlad and an Odd Ordering
|
binary search
bitmasks
data structures
+4
|
1500
|
| 1926-D |
Vlad and Division
|
bitmasks
greedy
|
1300
|
| 1926-C |
Vlad and a Sum of Sum of Digits
|
dp
implementation
|
1200
|
| 1926-B |
Vlad and Shapes
|
geometry
implementation
|
800
|
| 1926-A |
Vlad and the Best of Five
|
implementation
|
800
|
| 1925-D |
Good Trip
|
combinatorics
dp
math
+1
|
1900
|
| 1925-B |
A Balanced Problemset?
|
brute force
greedy
math
+1
|
1200
|
| 1925-A |
We Got Everything Covered!
|
constructive algorithms
greedy
strings
|
800
|
| 1924-F |
Anti-Proxy Attendance
|
constructive algorithms
dp
interactive
+1
|
3500
|
| 1924-E |
Paper Cutting Again
|
combinatorics
probabilities
|
3100
|
| 1924-D |
Balanced Subsequences
|
combinatorics
dp
math
|
2700
|
| 1924-C |
Fractal Origami
|
geometry
math
matrices
|
2400
|
| 1924-B |
Space Harbour
|
data structures
implementation
math
+1
|
2100
|
| 1924-A |
Did We Get Everything Covered?
|
constructive algorithms
dp
greedy
+2
|
1500
|
| 1923-F |
Shrink-Reverse
|
binary search
brute force
greedy
+4
|
2800
|
| 1923-E |
Count Paths
|
data structures
dfs and similar
dp
+3
|
2000
|
| 1923-D |
Slimes
|
binary search
constructive algorithms
data structures
+2
|
1800
|
| 1923-C |
Find B
|
constructive algorithms
greedy
|
1400
|
| 1923-B |
Monsters Attack!
|
dp
greedy
implementation
|
1100
|
| 1923-A |
Moving Chips
|
greedy
implementation
|
800
|
| 1922-F |
Replace on Segment
|
dp
graph matchings
|
2500
|
| 1922-E |
Increasing Subsequences
|
bitmasks
constructive algorithms
divide and conquer
+2
|
1800
|
| 1922-D |
Berserk Monsters
|
brute force
data structures
dsu
+2
|
1900
|
| 1922-C |
Closest Cities
|
greedy
implementation
math
|
1300
|
| 1922-B |
Forming Triangles
|
combinatorics
constructive algorithms
math
+1
|
1200
|
| 1922-A |
Tricky Template
|
constructive algorithms
implementation
strings
|
800
|
| 1921-G |
Mischievous Shooter
|
brute force
data structures
divide and conquer
+2
|
2200
|
| 1921-F |
Sum of Progression
|
brute force
data structures
dp
+2
|
1900
|
| 1921-E |
Eat the Chip
|
brute force
games
greedy
+1
|
1600
|
| 1921-D |
Very Different Array
|
data structures
greedy
sortings
+1
|
1100
|
| 1921-C |
Sending Messages
|
greedy
math
|
900
|
| 1921-B |
Arranging Cats
|
greedy
implementation
|
800
|
| 1921-A |
Square
|
greedy
math
|
800
|
| 1920-F2 |
Smooth Sailing (Hard Version)
|
binary search
data structures
dsu
+3
|
3000
|
| 1920-F1 |
Smooth Sailing (Easy Version)
|
binary search
brute force
data structures
+4
|
2500
|
| 1920-E |
Counting Binary Strings
|
combinatorics
dp
math
|
2100
|
| 1920-D |
Array Repetition
|
binary search
brute force
dsu
+2
|
1900
|
| 1920-C |
Partitioning the Array
|
brute force
math
number theory
|
1600
|
| 1920-B |
Summation Game
|
games
greedy
math
+1
|
1100
|
| 1920-A |
Satisfying Constraints
|
brute force
greedy
math
|
800
|
| 1919-H |
Tree Diameter
|
interactive
trees
|
2000
|
| 1919-G |
Tree LGM
|
constructive algorithms
divide and conquer
games
+1
|
3500
|
| 1919-F2 |
Wine Factory (Hard Version)
|
data structures
dp
flows
+2
|
2800
|
| 1919-F1 |
Wine Factory (Easy Version)
|
data structures
greedy
|
2300
|