| 2070-E |
Game with Binary String
|
constructive algorithms
data structures
divide and conquer
+3
|
2200
|
| 2070-D |
Tree Jumps
|
dfs and similar
dp
trees
|
1600
|
| 2070-C |
Limited Repainting
|
binary search
greedy
|
1500
|
| 2070-B |
Robot Program
|
brute force
implementation
math
|
1100
|
| 2070-A |
FizzBuzz Remixed
|
brute force
math
|
800
|
| 2069-F |
Graph Inclusion
|
data structures
dfs and similar
divide and conquer
+2
|
2800
|
| 2069-E |
A, B, AB and BA
|
constructive algorithms
greedy
sortings
+1
|
2300
|
| 2069-D |
Palindrome Shuffle
|
binary search
greedy
hashing
+2
|
1800
|
| 2069-C |
Beautiful Sequence
|
combinatorics
dp
greedy
+1
|
1500
|
| 2069-B |
Set of Strangers
|
greedy
matrices
|
1200
|
| 2069-A |
Was there an Array?
|
graph matchings
greedy
|
800
|
| 2068-K |
Amusement Park Rides
|
flows
graphs
|
3000
|
| 2068-J |
The Ultimate Wine Tasting Event
|
combinatorics
greedy
|
2000
|
| 2068-I |
Pinball
|
graphs
shortest paths
|
3500
|
| 2068-H |
Statues
|
constructive algorithms
greedy
math
|
2700
|
| 2068-G |
A Very Long Hike
|
shortest paths
|
3500
|
| 2068-F |
Mascot Naming
|
brute force
greedy
implementation
+1
|
1900
|
| 2068-E |
Porto Vs. Benfica
|
data structures
dfs and similar
dsu
+2
|
2800
|
| 2068-D |
Morse Code
|
dp
sortings
trees
|
3100
|
| 2068-C |
Ads
|
binary search
greedy
two pointers
|
2100
|
| 2068-B |
Urban Planning
|
constructive algorithms
|
3100
|
| 2068-A |
Condorcet Elections
|
constructive algorithms
graphs
greedy
+1
|
2300
|
| 2067-C |
Devyatkino
|
brute force
dfs and similar
greedy
+1
|
1500
|
| 2067-B |
Two Large Bags
|
brute force
dp
greedy
+1
|
1200
|
| 2067-A |
Adjacent Digit Sums
|
brute force
constructive algorithms
math
|
800
|
| 2066-F |
Curse
|
constructive algorithms
dp
math
|
3300
|
| 2066-E |
Tropical Season
|
binary search
data structures
greedy
+1
|
3300
|
| 2066-D2 |
Club of Young Aircraft Builders (hard version)
|
combinatorics
dp
math
|
2900
|
| 2066-D1 |
Club of Young Aircraft Builders (easy version)
|
combinatorics
dp
math
|
2400
|
| 2066-C |
Bitwise Slides
|
bitmasks
combinatorics
dp
+1
|
2300
|
| 2066-B |
White Magic
|
constructive algorithms
data structures
dp
+2
|
1900
|
| 2066-A |
Object Identification
|
graphs
greedy
implementation
+1
|
1400
|
| 2065-H |
Bro Thinks He's Him
|
combinatorics
data structures
divide and conquer
+3
|
2200
|
| 2065-G |
Skibidus and Capping
|
combinatorics
math
number theory
|
1700
|
| 2065-F |
Skibidus and Slay
|
data structures
dfs and similar
graphs
+2
|
1700
|
| 2065-E |
Skibidus and Rizz
|
constructive algorithms
greedy
strings
|
1600
|
| 2065-D |
Skibidus and Sigma
|
greedy
sortings
|
1200
|
| 2065-C2 |
Skibidus and Fanum Tax (hard version)
|
binary search
greedy
|
1300
|
| 2065-C1 |
Skibidus and Fanum Tax (easy version)
|
binary search
dp
greedy
|
1100
|
| 2065-B |
Skibidus and Ohio
|
strings
|
800
|
| 2065-A |
Skibidus and Amog'u
|
brute force
constructive algorithms
greedy
+2
|
800
|
| 2064-F |
We Be Summing
|
binary search
data structures
dp
+1
|
2600
|
| 2064-E |
Mycraft Sand Sort
|
combinatorics
data structures
dsu
+3
|
2400
|
| 2064-D |
Eating
|
binary search
bitmasks
brute force
+5
|
1900
|
| 2064-C |
Remove the Ends
|
brute force
constructive algorithms
dp
+1
|
1300
|
| 2064-B |
Variety is Discouraged
|
binary search
constructive algorithms
greedy
+1
|
1100
|
| 2064-A |
Brogramming Contest
|
greedy
strings
|
800
|
| 2063-F2 |
Counting Is Not Fun (Hard Version)
|
combinatorics
data structures
dfs and similar
+4
|
2700
|
| 2063-F1 |
Counting Is Not Fun (Easy Version)
|
combinatorics
data structures
dfs and similar
+7
|
2400
|
| 2063-E |
Triangle Tree
|
data structures
dfs and similar
dp
+2
|
2300
|