| 1792-A |
GamingForces
|
greedy
sortings
|
800
|
| 1791-G2 |
Teleporters (Hard Version)
|
binary search
greedy
sortings
|
1900
|
| 1791-G1 |
Teleporters (Easy Version)
|
greedy
sortings
|
1100
|
| 1791-F |
Range Update Point Query
|
binary search
brute force
data structures
|
1500
|
| 1791-E |
Negatives and Positives
|
dp
greedy
sortings
|
1100
|
| 1791-D |
Distinct Split
|
brute force
greedy
strings
|
1000
|
| 1791-C |
Prepend and Append
|
implementation
two pointers
|
800
|
| 1791-B |
Following Directions
|
geometry
implementation
|
800
|
| 1791-A |
Codeforces Checking
|
implementation
strings
|
800
|
| 1790-G |
Tokens on Graph
|
constructive algorithms
dfs and similar
graphs
+1
|
2300
|
| 1790-F |
Timofey and Black-White Tree
|
brute force
dfs and similar
divide and conquer
+5
|
2100
|
| 1790-E |
Vlad and a Pair of Numbers
|
bitmasks
constructive algorithms
|
1400
|
| 1790-D |
Matryoshkas
|
data structures
greedy
sortings
|
1200
|
| 1790-C |
Premutation
|
brute force
implementation
math
|
1000
|
| 1790-B |
Taisia and Dice
|
greedy
math
|
800
|
| 1790-A |
Polycarp and the Day of Pi
|
implementation
math
strings
|
800
|
| 1789-F |
Serval and Brain Power
|
bitmasks
brute force
dp
+3
|
2700
|
| 1789-E |
Serval and Music Game
|
brute force
dp
implementation
+2
|
2500
|
| 1789-D |
Serval and Shift-Shift-Shift
|
bitmasks
brute force
constructive algorithms
+1
|
2200
|
| 1789-C |
Serval and Toxel's Arrays
|
combinatorics
dp
implementation
+1
|
1500
|
| 1789-B |
Serval and Inversion Magic
|
brute force
implementation
strings
+1
|
800
|
| 1789-A |
Serval and Mocha's Array
|
brute force
math
number theory
|
800
|
| 1788-F |
XOR, Tree, and Queries
|
bitmasks
constructive algorithms
dfs and similar
+5
|
2500
|
| 1788-E |
Sum Over Zero
|
data structures
dfs and similar
dp
|
2200
|
| 1788-D |
Moving Dots
|
binary search
brute force
combinatorics
+2
|
2000
|
| 1788-C |
Matching Numbers
|
constructive algorithms
greedy
math
|
1300
|
| 1788-B |
Sum of Two Numbers
|
constructive algorithms
greedy
implementation
+2
|
1100
|
| 1788-A |
One and Two
|
brute force
implementation
math
|
800
|
| 1787-I |
Treasure Hunt
|
data structures
divide and conquer
two pointers
|
3400
|
| 1787-H |
Codeforces Scoreboard
|
binary search
data structures
dp
+1
|
3300
|
| 1787-G |
Colorful Tree Again
|
brute force
data structures
trees
|
3000
|
| 1787-F |
Inverse Transformation
|
constructive algorithms
implementation
math
|
2500
|
| 1787-E |
The Harmonization of XOR
|
bitmasks
constructive algorithms
greedy
+1
|
2100
|
| 1787-D |
Game on Axis
|
combinatorics
dfs and similar
dsu
+2
|
1900
|
| 1787-C |
Remove the Bracket
|
dp
greedy
math
|
1600
|
| 1787-B |
Number Factorization
|
greedy
math
number theory
|
1100
|
| 1787-A |
Exponential Equation
|
constructive algorithms
math
|
800
|
| 1786-B |
Cake Assembly Line
|
brute force
sortings
|
1300
|
| 1786-A2 |
Alternating Deck (hard version)
|
implementation
|
800
|
| 1786-A1 |
Non-alternating Deck (easy version)
|
implementation
|
800
|
| 1784-F |
Minimums or Medians
|
|
3400
|
| 1784-E |
Infinite Game
|
brute force
combinatorics
dp
+2
|
3100
|
| 1784-D |
Wooden Spoon
|
combinatorics
dp
|
2400
|
| 1784-C |
Monsters (hard version)
|
data structures
greedy
|
2200
|
| 1784-B |
Letter Exchange
|
constructive algorithms
|
1900
|
| 1784-A |
Monsters (easy version)
|
brute force
greedy
|
1000
|
| 1783-G |
Weighed Tree Radius
|
data structures
divide and conquer
implementation
+1
|
2800
|
| 1783-F |
Double Sort II
|
dfs and similar
flows
graph matchings
+1
|
2500
|
| 1783-E |
Game of the Year
|
brute force
data structures
math
+1
|
2300
|
| 1783-D |
Different Arrays
|
brute force
dp
implementation
|
2000
|