| 2197-B |
Array and Permutation
|
implementation
schedules
sortings
+1
|
1100
|
| 2197-A |
Friendly Numbers
|
binary search
brute force
expression parsing
+2
|
800
|
| 2196-F |
Indivisible
|
brute force
constructive algorithms
graphs
|
3300
|
| 2196-E2 |
Fuzzy Concatenation (Hard version)
|
binary search
bitmasks
data structures
+3
|
3000
|
| 2196-E1 |
Fuzzy Concatenation (Easy Version)
|
binary search
bitmasks
brute force
+3
|
2900
|
| 2196-D |
Double Bracket Sequence
|
data structures
dp
expression parsing
+3
|
2500
|
| 2196-C2 |
Interactive Graph (Hard Version)
|
combinatorics
dfs and similar
dp
+2
|
2000
|
| 2196-C1 |
Interactive Graph (Simple Version)
|
binary search
combinatorics
dfs and similar
+3
|
1800
|
| 2196-B |
Another Problem about Beautiful Pairs
|
brute force
math
two pointers
|
1600
|
| 2196-A |
Game with a Fraction
|
games
math
|
1200
|
| 2195-H |
Codeforces Heuristic Contest 001
|
brute force
constructive algorithms
geometry
+1
|
2400
|
| 2195-G |
Idiot First Search and Queries
|
binary search
data structures
dp
+2
|
2300
|
| 2195-F |
Parabola Independence
|
dp
graphs
greedy
+2
|
2000
|
| 2195-E |
Idiot First Search
|
dfs and similar
dp
trees
|
1500
|
| 2195-D |
Absolute Cinema
|
math
|
1300
|
| 2195-C |
Dice Roll Sequence
|
dp
greedy
|
1100
|
| 2195-B |
Heapify 1
|
implementation
sortings
|
900
|
| 2195-A |
Sieve of Erato67henes
|
math
number theory
|
800
|
| 2194-F2 |
Again Trees... (hard version)
|
bitmasks
data structures
dfs and similar
+3
|
3000
|
| 2194-F1 |
Again Trees... (Easy Version)
|
bitmasks
dfs and similar
dp
+1
|
2300
|
| 2194-E |
The Turtle Strikes Back
|
dp
graphs
greedy
+1
|
2000
|
| 2194-D |
Table Cut
|
constructive algorithms
greedy
implementation
|
1600
|
| 2194-C |
Secret message
|
bitmasks
brute force
dp
+2
|
1300
|
| 2194-B |
Offshores
|
greedy
implementation
math
|
1000
|
| 2194-A |
Lawn Mower
|
greedy
math
|
800
|
| 2193-H |
Remove the Grail Tree
|
dfs and similar
dp
graphs
+3
|
2400
|
| 2193-G |
Paths in a Tree
|
dfs and similar
interactive
sortings
+1
|
2100
|
| 2193-F |
Pizza Delivery
|
dp
greedy
|
1600
|
| 2193-E |
Product Queries
|
dp
math
number theory
+1
|
1300
|
| 2193-D |
Monster Game
|
binary search
sortings
two pointers
|
1100
|
| 2193-C |
Replace and Sum
|
data structures
greedy
|
1000
|
| 2193-B |
Reverse a Permutation
|
greedy
|
800
|
| 2193-A |
DBMB and the Array
|
brute force
math
|
800
|
| 2192-F |
Fish Fight
|
dp
math
probabilities
|
2900
|
| 2192-E |
Swap to Rearrange
|
constructive algorithms
dfs and similar
graph matchings
+3
|
2100
|
| 2192-D |
Cost of Tree
|
dp
greedy
trees
|
1800
|
| 2192-C |
All-in-one Gun
|
binary search
greedy
math
|
1300
|
| 2192-B |
Flipping Binary String
|
constructive algorithms
strings
|
1000
|
| 2192-A |
String Rotation Game
|
brute force
strings
|
800
|
| 2191-B |
MEX Reordering
|
constructive algorithms
sortings
|
1000
|
| 2191-A |
Array Coloring
|
constructive algorithms
|
800
|
| 2190-G |
Maximize Determinant
|
graphs
|
3300
|
| 2190-F |
Xor Product
|
bitmasks
dp
|
3300
|
| 2190-E |
Median Permutation
|
combinatorics
|
3200
|
| 2190-D |
Prufer Vertex
|
combinatorics
dsu
number theory
+2
|
2500
|
| 2190-C |
Comparable Permutations
|
greedy
implementation
interactive
+2
|
2300
|
| 2190-B2 |
Sub-RBS (Hard Version)
|
dp
games
implementation
+1
|
1900
|
| 2190-B1 |
Sub-RBS (Easy Version)
|
combinatorics
constructive algorithms
dp
+3
|
1400
|
| 2190-A |
Sorting Game
|
constructive algorithms
games
greedy
|
1200
|
| 2189-F |
Zhora the Vacuum Cleaner
|
data structures
dfs and similar
dp
+4
|
2800
|