| 1691-D |
Max GEQ Sum
|
binary search
constructive algorithms
data structures
+3
|
1800
|
| 1691-C |
Sum of Substrings
|
brute force
constructive algorithms
greedy
+2
|
1400
|
| 1691-B |
Shoe Shuffling
|
constructive algorithms
greedy
implementation
+1
|
1000
|
| 1691-A |
Beat The Odds
|
brute force
greedy
math
|
800
|
| 1690-G |
Count the Trains
|
binary search
data structures
greedy
+1
|
2000
|
| 1690-F |
Shifting String
|
graphs
math
number theory
+1
|
1700
|
| 1690-E |
Price Maximization
|
binary search
greedy
math
+1
|
1500
|
| 1690-D |
Black and White Stripe
|
implementation
two pointers
|
1000
|
| 1690-C |
Restoring the Duration of Tasks
|
data structures
greedy
implementation
|
800
|
| 1690-B |
Array Decrements
|
greedy
implementation
|
800
|
| 1690-A |
Print a Pedestal (Codeforces logo?)
|
constructive algorithms
greedy
|
800
|
| 1689-E |
ANDfinity
|
bitmasks
brute force
constructive algorithms
+3
|
2500
|
| 1689-D |
Lena and Matrix
|
data structures
dp
geometry
+1
|
1900
|
| 1689-C |
Infected Tree
|
dfs and similar
dp
trees
|
1600
|
| 1689-B |
Mystic Permutation
|
data structures
greedy
|
900
|
| 1689-A |
Lex String
|
brute force
greedy
implementation
+2
|
800
|
| 1688-C |
Manipulating History
|
constructive algorithms
greedy
strings
|
1700
|
| 1688-B |
Patchouli's Magical Talisman
|
bitmasks
constructive algorithms
greedy
+1
|
800
|
| 1688-A |
Cirno's Perfect Bitmasks Classroom
|
bitmasks
brute force
|
800
|
| 1687-F |
Koishi's Unconscious Permutation
|
fft
math
|
3500
|
| 1687-E |
Become Big For Me
|
combinatorics
constructive algorithms
greedy
+2
|
3500
|
| 1687-D |
Cute number
|
binary search
brute force
data structures
+3
|
2900
|
| 1687-C |
Sanae and Giant Robot
|
binary search
brute force
data structures
+3
|
2500
|
| 1687-B |
Railway System
|
constructive algorithms
graphs
greedy
+2
|
1700
|
| 1687-A |
The Enchanted Forest
|
brute force
greedy
|
1600
|
| 1686-B |
Odd Subarrays
|
dp
greedy
|
800
|
| 1686-A |
Everything Everywhere All But One
|
greedy
|
800
|
| 1685-E |
The Ultimate LIS Problem
|
data structures
greedy
|
3500
|
| 1685-D2 |
Permutation Weight (Hard Version)
|
constructive algorithms
greedy
|
3500
|
| 1685-D1 |
Permutation Weight (Easy Version)
|
constructive algorithms
dfs and similar
dsu
|
2800
|
| 1685-C |
Bring Balance
|
brute force
constructive algorithms
greedy
|
2600
|
| 1685-B |
Linguistics
|
greedy
implementation
sortings
+1
|
2000
|
| 1685-A |
Circular Local MiniMax
|
constructive algorithms
greedy
sortings
|
1100
|
| 1684-H |
Hard Cut
|
constructive algorithms
dfs and similar
divide and conquer
+1
|
3400
|
| 1684-G |
Euclid Guess
|
constructive algorithms
flows
graph matchings
+2
|
2800
|
| 1684-F |
Diverse Segments
|
data structures
two pointers
|
2600
|
| 1684-E |
MEX vs DIFF
|
binary search
brute force
constructive algorithms
+3
|
2100
|
| 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
|