| 2205-C |
Simons and Posting Blogs
|
greedy
sortings
|
1500
|
| 2205-B |
Simons and Cakes for Success
|
implementation
math
|
800
|
| 2205-A |
Simons and Making It Beautiful
|
brute force
constructive algorithms
|
800
|
| 2204-G |
Grid Path
|
dp
graphs
matrices
|
2700
|
| 2204-F |
Sum of Fractions
|
binary search
brute force
combinatorics
+5
|
2200
|
| 2204-E |
Sum of Digits (and Again)
|
brute force
constructive algorithms
math
|
1800
|
| 2204-D |
Alternating Path
|
constructive algorithms
dfs and similar
graph matchings
+1
|
1400
|
| 2204-C |
Spring
|
math
number theory
|
1000
|
| 2204-B |
Right Maximum
|
greedy
|
800
|
| 2204-A |
Passing the Ball
|
brute force
implementation
|
800
|
| 2203-F |
Binary Search with One Swap
|
binary search
divide and conquer
dp
+3
|
2600
|
| 2203-E |
Probabilistic Card Game
|
binary search
data structures
games
+3
|
2200
|
| 2203-D |
Divisibility Game
|
brute force
games
greedy
+1
|
1700
|
| 2203-C |
Test Generator
|
binary search
bitmasks
greedy
+1
|
1500
|
| 2203-B |
Beautiful Numbers
|
bitmasks
dp
fft
+2
|
1000
|
| 2203-A |
Towers of Boxes
|
math
|
800
|
| 2202-G1 |
Monotone Monochrome Matrices (Easy Version)
|
data structures
|
2500
|
| 2202-B |
ABAB Construction
|
dp
greedy
implementation
|
1200
|
| 2202-A |
Parkour Design
|
math
|
800
|
| 2201-G |
Codeforces Heuristic Contest 1001
|
constructive algorithms
|
3500
|
| 2201-F2 |
Monotone Monochrome Matrices (Hard Version)
|
constructive algorithms
data structures
hashing
+1
|
2800
|
| 2201-F1 |
Monotone Monochrome Matrices (Medium Version)
|
data structures
hashing
|
2900
|
| 2201-E |
ABBA Counting
|
fft
math
number theory
+1
|
2900
|
| 2201-D |
Binary Not Search and Queries
|
data structures
greedy
implementation
|
2500
|
| 2201-C |
Rigged Bracket Sequence
|
combinatorics
dp
greedy
|
2000
|
| 2201-B |
Recollect Numbers
|
constructive algorithms
|
1700
|
| 2201-A2 |
Lost Civilization (Hard Version)
|
data structures
dp
|
1700
|
| 2201-A1 |
Lost Civilization (Easy Version)
|
data structures
|
1300
|
| 2200-H |
Six Seven
|
divide and conquer
math
number theory
+2
|
2600
|
| 2200-G |
Operation Permutation
|
combinatorics
dp
math
+1
|
2200
|
| 2200-F |
Mooclear Reactor 2
|
brute force
data structures
greedy
+2
|
1900
|
| 2200-E |
Divisive Battle
|
games
greedy
math
+1
|
1500
|
| 2200-D |
Portal
|
greedy
sortings
|
1300
|
| 2200-C |
Specialty String
|
brute force
greedy
strings
|
900
|
| 2200-B |
Deletion Sort
|
bitmasks
brute force
greedy
+1
|
800
|
| 2200-A |
Eating Game
|
greedy
|
800
|
| 2199-I |
Strange Process
|
*special
|
3000
|
| 2199-H |
Sum of MEX
|
*special
combinatorics
data structures
+2
|
2300
|
| 2199-G |
Jammer
|
*special
math
|
2500
|
| 2199-F |
Self-Produced Sequences
|
*special
combinatorics
math
|
2000
|
| 2199-E |
Supersequence
|
*special
binary search
greedy
|
2100
|
| 2199-D |
Two Arrays
|
*special
math
|
1800
|
| 2199-C |
Minesweeper
|
*special
constructive algorithms
greedy
|
1600
|
| 2199-B |
Two Towers
|
*special
greedy
math
|
1400
|
| 2199-A |
Game
|
*special
|
1000
|
| 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
|