| 1684-D |
Traps
|
constructive algorithms
greedy
sortings
|
1700
|
| 1684-C |
Column Swapping
|
brute force
constructive algorithms
greedy
+2
|
1400
|
| 1684-B |
Z mod X = C
|
constructive algorithms
math
|
800
|
| 1684-A |
Digit Minimization
|
constructive algorithms
games
math
+1
|
800
|
| 1682-F |
MCMF?
|
data structures
flows
graphs
+3
|
2700
|
| 1682-E |
Unordered Swaps
|
constructive algorithms
dfs and similar
graphs
+4
|
2700
|
| 1682-D |
Circular Spanning Tree
|
constructive algorithms
implementation
trees
|
2000
|
| 1682-C |
LIS or Reverse LIS?
|
constructive algorithms
greedy
implementation
+1
|
1400
|
| 1682-B |
AND Sorting
|
bitmasks
constructive algorithms
sortings
|
1100
|
| 1682-A |
Palindromic Indices
|
greedy
strings
|
800
|
| 1681-F |
Unique Occurrences
|
data structures
dfs and similar
divide and conquer
+3
|
2300
|
| 1681-E |
Labyrinth Adventures
|
data structures
dp
matrices
+1
|
2600
|
| 1681-D |
Required Length
|
brute force
dfs and similar
dp
+2
|
1700
|
| 1681-C |
Double Sort
|
implementation
sortings
|
1200
|
| 1681-B |
Card Trick
|
implementation
math
|
800
|
| 1681-A |
Game with Cards
|
games
greedy
|
800
|
| 1680-F |
Lenient Vertex Cover
|
dfs and similar
divide and conquer
dsu
+2
|
2600
|
| 1680-E |
Moving Chips
|
bitmasks
dp
greedy
|
2000
|
| 1680-D |
Dog Walking
|
brute force
greedy
math
|
2400
|
| 1680-C |
Binary String
|
binary search
greedy
strings
+1
|
1600
|
| 1680-B |
Robots
|
implementation
|
800
|
| 1680-A |
Minimums and Maximums
|
brute force
math
|
800
|
| 1679-F |
Formalism for Formalism
|
bitmasks
dp
math
|
2600
|
| 1679-E |
Typical Party in Dorm
|
bitmasks
combinatorics
dp
+1
|
2400
|
| 1679-D |
Toss a Coin to Your Graph...
|
binary search
dfs and similar
dp
+1
|
1900
|
| 1679-C |
Rooks Defenders
|
data structures
implementation
|
1400
|
| 1679-B |
Stone Age Problem
|
data structures
implementation
|
1200
|
| 1679-A |
AvtoBus
|
brute force
greedy
math
+1
|
900
|
| 1678-B2 |
Tokitsukaze and Good 01-String (hard version)
|
dp
greedy
implementation
|
1800
|
| 1678-B1 |
Tokitsukaze and Good 01-String (easy version)
|
implementation
|
800
|
| 1678-A |
Tokitsukaze and All Zero Sequence
|
implementation
|
800
|
| 1677-F |
Tokitsukaze and Gems
|
dp
math
|
3500
|
| 1677-E |
Tokitsukaze and Beautiful Subsegments
|
data structures
|
2900
|
| 1677-D |
Tokitsukaze and Permutations
|
dp
math
|
2500
|
| 1677-C |
Tokitsukaze and Two Colorful Tapes
|
constructive algorithms
dfs and similar
graphs
+1
|
1900
|
| 1677-B |
Tokitsukaze and Meeting
|
data structures
implementation
math
|
1700
|
| 1677-A |
Tokitsukaze and Strange Inequality
|
brute force
data structures
dp
|
1600
|
| 1676-H2 |
Maximum Crossings (Hard Version)
|
data structures
divide and conquer
sortings
|
1500
|
| 1676-H1 |
Maximum Crossings (Easy Version)
|
brute force
|
1400
|
| 1676-G |
White-Black Balanced Subtrees
|
dfs and similar
dp
graphs
+1
|
1300
|
| 1676-F |
Longest Strike
|
data structures
greedy
implementation
+2
|
1300
|
| 1676-E |
Eating Queries
|
binary search
greedy
sortings
|
1100
|
| 1676-D |
X-Sum
|
brute force
greedy
implementation
|
1000
|
| 1676-C |
Most Similar Words
|
brute force
greedy
implementation
+2
|
800
|
| 1676-B |
Equal Candies
|
greedy
math
sortings
|
800
|
| 1676-A |
Lucky?
|
implementation
|
800
|
| 1675-G |
Sorting Pancakes
|
dp
|
2300
|
| 1675-F |
Vlad and Unfinished Business
|
dfs and similar
dp
greedy
+1
|
1800
|
| 1675-E |
Replace With the Previous, Minimize
|
dsu
greedy
strings
|
1500
|
| 1675-D |
Vertical Paths
|
graphs
implementation
trees
|
1300
|