| 2038-B |
Make It Equal
|
binary search
brute force
greedy
+1
|
2100
|
| 2038-A |
Bonus Project
|
games
greedy
|
1400
|
| 2037-G |
Natlan Exploring
|
bitmasks
combinatorics
data structures
+3
|
2000
|
| 2037-F |
Ardent Flames
|
binary search
data structures
math
+2
|
2100
|
| 2037-E |
Kachina's Favorite Binary String
|
dp
greedy
interactive
+1
|
1600
|
| 2037-D |
Sharky Surfing
|
data structures
greedy
two pointers
|
1300
|
| 2037-C |
Superultra's Favorite Permutation
|
constructive algorithms
greedy
math
+1
|
1000
|
| 2037-B |
Intercepted Inputs
|
brute force
implementation
|
800
|
| 2037-A |
Twice
|
implementation
|
800
|
| 2036-G |
Library of Magic
|
binary search
constructive algorithms
divide and conquer
+3
|
2200
|
| 2036-F |
XORificator 3000
|
bitmasks
dp
number theory
+1
|
1900
|
| 2036-E |
Reverse the Rivers
|
binary search
constructive algorithms
data structures
+1
|
1600
|
| 2036-D |
I Love 1543
|
brute force
implementation
matrices
|
1300
|
| 2036-C |
Anya and 1100
|
brute force
implementation
|
1100
|
| 2036-B |
Startup
|
greedy
sortings
|
800
|
| 2036-A |
Quintomania
|
implementation
|
800
|
| 2035-H |
Peak Productivity Forces
|
constructive algorithms
|
3500
|
| 2035-G2 |
Go Learn! (Hard Version)
|
divide and conquer
dp
|
3500
|
| 2035-G1 |
Go Learn! (Easy Version)
|
dp
trees
|
3300
|
| 2035-F |
Tree Operations
|
binary search
brute force
dfs and similar
+2
|
2500
|
| 2035-E |
Monster
|
binary search
brute force
constructive algorithms
+4
|
2300
|
| 2035-D |
Yet Another Real Number Problem
|
binary search
data structures
divide and conquer
+3
|
1800
|
| 2035-C |
Alya and Permutation
|
bitmasks
constructive algorithms
math
|
1400
|
| 2035-B |
Everyone Loves Tres
|
constructive algorithms
greedy
math
+1
|
900
|
| 2035-A |
Sliding
|
implementation
math
|
800
|
| 2034-H |
Rayan vs. Rayaneh
|
brute force
dfs and similar
dp
+1
|
3300
|
| 2034-G2 |
Simurgh's Watch (Hard Version)
|
greedy
implementation
|
3500
|
| 2034-G1 |
Simurgh's Watch (Easy Version)
|
constructive algorithms
greedy
implementation
+1
|
3500
|
| 2034-F2 |
Khayyam's Royal Decree (Hard Version)
|
combinatorics
dp
math
+1
|
2800
|
| 2034-F1 |
Khayyam's Royal Decree (Easy Version)
|
combinatorics
dp
math
+1
|
2500
|
| 2034-E |
Permutations Harmony
|
combinatorics
constructive algorithms
greedy
+2
|
2200
|
| 2034-D |
Darius' Wisdom
|
constructive algorithms
greedy
implementation
+1
|
1600
|
| 2034-C |
Trapped in the Witch's Labyrinth
|
constructive algorithms
dfs and similar
graphs
+1
|
1400
|
| 2034-B |
Rakhsh's Revival
|
data structures
greedy
implementation
+1
|
1000
|
| 2034-A |
King Keykhosrow's Mystery
|
brute force
chinese remainder theorem
math
+1
|
800
|
| 2033-G |
Sakurako and Chefir
|
data structures
dfs and similar
dp
+2
|
2200
|
| 2033-F |
Kosuke's Sloth
|
brute force
math
number theory
|
1800
|
| 2033-E |
Sakurako, Kosuke, and the Permutation
|
brute force
data structures
dfs and similar
+4
|
1400
|
| 2033-D |
Kousuke's Assignment
|
data structures
dp
dsu
+2
|
1300
|
| 2033-C |
Sakurako's Field Trip
|
dp
greedy
two pointers
|
1400
|
| 2033-B |
Sakurako and Water
|
brute force
constructive algorithms
greedy
|
900
|
| 2033-A |
Sakurako and Kosuke
|
constructive algorithms
implementation
math
|
800
|
| 2032-F |
Peanuts
|
combinatorics
dp
games
+1
|
2700
|
| 2032-E |
Balanced
|
constructive algorithms
data structures
greedy
+2
|
2400
|
| 2032-D |
Genokraken
|
constructive algorithms
data structures
graphs
+5
|
1800
|
| 2032-C |
Trinity
|
binary search
math
sortings
+1
|
1400
|
| 2032-B |
Medians
|
constructive algorithms
greedy
implementation
+1
|
1100
|
| 2032-A |
Circuit
|
greedy
implementation
math
+1
|
800
|
| 2031-F |
Penchick and Even Medians
|
binary search
constructive algorithms
interactive
+1
|
2800
|
| 2031-E |
Penchick and Chloe's Trees
|
data structures
dfs and similar
dp
+5
|
2100
|