| 2023-E |
Tree of Life
|
dp
greedy
trees
|
3300
|
| 2023-D |
Many Games
|
brute force
dp
greedy
+2
|
2900
|
| 2023-C |
C+K+S
|
constructive algorithms
dfs and similar
graphs
+4
|
2400
|
| 2023-B |
Skipping
|
binary search
dp
graphs
+1
|
1700
|
| 2023-A |
Concatenation of Arrays
|
constructive algorithms
greedy
math
+1
|
1300
|
| 2022-E2 |
Billetes MX (Hard Version)
|
binary search
combinatorics
data structures
+2
|
2600
|
| 2022-E1 |
Billetes MX (Easy Version)
|
2-sat
binary search
combinatorics
+4
|
2500
|
| 2022-D2 |
Asesino (Hard Version)
|
constructive algorithms
dp
interactive
|
2700
|
| 2022-D1 |
Asesino (Easy Version)
|
binary search
brute force
constructive algorithms
+2
|
1900
|
| 2022-C |
Gerrymandering
|
dp
implementation
|
1800
|
| 2022-B |
Kar Salesman
|
binary search
greedy
math
|
1300
|
| 2022-A |
Bus to Pénjamo
|
constructive algorithms
greedy
implementation
+1
|
800
|
| 2021-E3 |
Digital Village (Extreme Version)
|
data structures
dfs and similar
dp
+5
|
2800
|
| 2021-E2 |
Digital Village (Hard Version)
|
data structures
dp
dsu
+3
|
2500
|
| 2021-E1 |
Digital Village (Easy Version)
|
brute force
data structures
dfs and similar
+8
|
2300
|
| 2021-D |
Boss, Thirsty
|
dp
greedy
implementation
|
2500
|
| 2021-C2 |
Adjust The Presentation (Hard Version)
|
constructive algorithms
data structures
greedy
+2
|
1900
|
| 2021-C1 |
Adjust The Presentation (Easy Version)
|
constructive algorithms
greedy
|
1300
|
| 2021-B |
Maximize Mex
|
brute force
greedy
math
+1
|
1200
|
| 2021-A |
Meaning Mean
|
data structures
greedy
math
+1
|
800
|
| 2020-F |
Count Leaves
|
dp
math
number theory
|
2900
|
| 2020-E |
Expected Power
|
bitmasks
dp
math
+1
|
2000
|
| 2020-D |
Connect the Dots
|
brute force
dp
dsu
+3
|
1800
|
| 2020-C |
Bitwise Balancing
|
bitmasks
hashing
implementation
+3
|
1400
|
| 2020-B |
Brightness Begins
|
binary search
math
|
1200
|
| 2020-A |
Find Minimum Operations
|
bitmasks
brute force
greedy
+2
|
800
|
| 2019-B |
All Pairs Segments
|
implementation
math
|
1200
|
| 2019-A |
Max Plus Size
|
brute force
dp
greedy
|
800
|
| 2018-F3 |
Speedbreaker Counting (Hard Version)
|
dp
greedy
math
|
3100
|
| 2018-F2 |
Speedbreaker Counting (Medium Version)
|
dp
greedy
math
|
3000
|
| 2018-F1 |
Speedbreaker Counting (Easy Version)
|
combinatorics
dp
greedy
+1
|
2900
|
| 2018-E2 |
Complex Segments (Hard Version)
|
binary search
data structures
divide and conquer
+4
|
3400
|
| 2018-E1 |
Complex Segments (Easy Version)
|
binary search
data structures
divide and conquer
+4
|
3300
|
| 2018-D |
Max Plus Min Plus Size
|
data structures
dp
dsu
+4
|
2200
|
| 2018-C |
Tree Pruning
|
brute force
dfs and similar
greedy
+2
|
1700
|
| 2018-B |
Speedbreaker
|
binary search
data structures
dp
+3
|
1900
|
| 2018-A |
Cards Partition
|
2-sat
brute force
greedy
+2
|
1600
|
| 2014-H |
Robin Hood Archery
|
data structures
divide and conquer
greedy
+1
|
1900
|
| 2014-G |
Milky Days
|
brute force
data structures
greedy
+1
|
2200
|
| 2014-F |
Sheriff's Defense
|
dfs and similar
dp
greedy
+1
|
2000
|
| 2014-E |
Rendez-vous de Marian et Robin
|
dfs and similar
graphs
shortest paths
|
1800
|
| 2014-D |
Robert Hood and Mrs Hood
|
brute force
data structures
greedy
+1
|
1400
|
| 2014-C |
Robin Hood in Town
|
binary search
greedy
math
|
1100
|
| 2014-B |
Robin Hood and the Major Oak
|
math
|
800
|
| 2014-A |
Robin Helps
|
greedy
implementation
|
800
|
| 2013-F2 |
Game in Tree (Hard Version)
|
binary search
data structures
trees
|
3500
|
| 2013-F1 |
Game in Tree (Easy Version)
|
binary search
brute force
data structures
+5
|
2700
|
| 2013-E |
Prefix GCD
|
brute force
dp
greedy
+2
|
2200
|
| 2013-D |
Minimize the Difference
|
binary search
greedy
|
1900
|
| 2013-C |
Password Cracking
|
constructive algorithms
interactive
strings
|
1400
|