| 2063-D |
Game With Triangles
|
binary search
brute force
data structures
+6
|
2000
|
| 2063-C |
Remove Exactly Two
|
brute force
data structures
dfs and similar
+5
|
1600
|
| 2063-B |
Subsequence Update
|
constructive algorithms
data structures
greedy
+1
|
1100
|
| 2063-A |
Minimal Coprime
|
math
number theory
|
800
|
| 2062-H |
Galaxy Generator
|
bitmasks
combinatorics
dp
|
3500
|
| 2062-G |
Permutation Factory
|
flows
geometry
graph matchings
+1
|
3500
|
| 2062-F |
Traveling Salescat
|
constructive algorithms
dp
geometry
+4
|
2900
|
| 2062-E2 |
The Game (Hard Version)
|
data structures
dfs and similar
games
+3
|
3000
|
| 2062-E1 |
The Game (Easy Version)
|
data structures
dfs and similar
games
+3
|
2000
|
| 2062-D |
Balanced Tree
|
dfs and similar
dp
graphs
+2
|
2200
|
| 2062-C |
Cirno and Operations
|
brute force
math
|
1200
|
| 2062-B |
Clockwork
|
greedy
math
|
900
|
| 2062-A |
String
|
constructive algorithms
greedy
math
+1
|
800
|
| 2061-I |
Kevin and Nivek
|
divide and conquer
dp
|
3500
|
| 2061-H2 |
Kevin and Stones (Hard Version)
|
flows
graphs
|
3500
|
| 2061-H1 |
Kevin and Stones (Easy Version)
|
flows
graph matchings
graphs
|
3500
|
| 2061-G |
Kevin and Teams
|
constructive algorithms
graphs
interactive
|
2900
|
| 2061-F2 |
Kevin and Binary String (Hard Version)
|
data structures
dp
|
3500
|
| 2061-F1 |
Kevin and Binary String (Easy Version)
|
greedy
implementation
|
2100
|
| 2061-E |
Kevin and And
|
bitmasks
brute force
dp
+3
|
2000
|
| 2061-D |
Kevin and Numbers
|
bitmasks
data structures
|
1600
|
| 2061-C |
Kevin and Puzzle
|
2-sat
combinatorics
dp
|
1600
|
| 2061-B |
Kevin and Geometry
|
binary search
geometry
|
1100
|
| 2061-A |
Kevin and Arithmetic
|
math
|
800
|
| 2060-G |
Bugged Sort
|
dp
greedy
sortings
|
2400
|
| 2060-F |
Multiplicative Arrays
|
combinatorics
dp
number theory
|
2200
|
| 2060-E |
Graph Composition
|
dfs and similar
dsu
graphs
+1
|
1500
|
| 2060-D |
Subtract Min Sort
|
greedy
|
1100
|
| 2060-C |
Game of Mathletes
|
games
greedy
sortings
+1
|
900
|
| 2060-B |
Farmer John's Card Game
|
greedy
sortings
|
1000
|
| 2060-A |
Fibonacciness
|
brute force
|
800
|
| 2059-E2 |
Stop Gaming (Hard Version)
|
brute force
constructive algorithms
data structures
+2
|
2900
|
| 2059-E1 |
Stop Gaming (Easy Version)
|
brute force
constructive algorithms
greedy
+2
|
2500
|
| 2059-D |
Graph and Graph
|
data structures
graphs
greedy
+1
|
1900
|
| 2059-C |
Customer Service
|
brute force
constructive algorithms
graph matchings
+3
|
1600
|
| 2059-B |
Cost of the Array
|
brute force
constructive algorithms
greedy
+1
|
1300
|
| 2059-A |
Milya and Two Arrays
|
constructive algorithms
greedy
sortings
|
800
|
| 2057-H |
Coffee Break
|
data structures
greedy
math
|
3500
|
| 2057-G |
Secret Message
|
constructive algorithms
dfs and similar
math
|
3000
|
| 2057-F |
Formation
|
binary search
data structures
dp
+2
|
3300
|
| 2057-E2 |
Another Exercise on Graphs (hard version)
|
binary search
dfs and similar
dp
+4
|
2500
|
| 2057-E1 |
Another Exercise on Graphs (Easy Version)
|
binary search
brute force
dp
+4
|
2300
|
| 2057-D |
Gifts Order
|
data structures
greedy
implementation
+2
|
2000
|
| 2057-C |
Trip to the Olympiad
|
bitmasks
constructive algorithms
greedy
+1
|
1500
|
| 2057-B |
Gorilla and the Exam
|
greedy
sortings
|
1000
|
| 2057-A |
MEX Table
|
constructive algorithms
math
|
800
|
| 2056-F2 |
Xor of Median (Hard Version)
|
bitmasks
brute force
combinatorics
+2
|
3000
|
| 2056-F1 |
Xor of Median (Easy Version)
|
bitmasks
brute force
combinatorics
+2
|
2700
|
| 2056-E |
Nested Segments
|
combinatorics
dfs and similar
dp
+2
|
2500
|
| 2056-D |
Unique Median
|
binary search
brute force
combinatorics
+3
|
2200
|