| 2153-B |
Bitwise Reversion
|
bitmasks
greedy
|
800
|
| 2153-A |
Circle of Apple Trees
|
greedy
sortings
|
800
|
| 2152-H2 |
Victorious Coloring (Hard Version)
|
data structures
greedy
schedules
|
3500
|
| 2152-H1 |
Victorious Coloring (Easy Version)
|
dfs and similar
dp
greedy
|
2900
|
| 2152-G |
Query Jungle
|
data structures
implementation
math
+2
|
2900
|
| 2152-F |
Triple Attack
|
data structures
greedy
|
2500
|
| 2152-E |
Monotone Subsequence
|
constructive algorithms
graphs
greedy
+2
|
2100
|
| 2152-D |
Division Versus Addition
|
games
greedy
math
|
1700
|
| 2152-C |
Triple Removal
|
data structures
greedy
math
|
1400
|
| 2152-B |
Catching the Krug
|
games
|
1300
|
| 2152-A |
Increase or Smash
|
greedy
implementation
|
800
|
| 2151-C |
Incremental Stay
|
greedy
implementation
math
|
1400
|
| 2151-A |
Incremental Subarray
|
math
strings
|
800
|
| 2150-G |
Counting Is Fun: The Finale
|
combinatorics
implementation
|
3500
|
| 2150-F |
Cycle Closing
|
constructive algorithms
graphs
implementation
+2
|
3000
|
| 2150-E2 |
Hidden Single (Version 2)
|
binary search
divide and conquer
interactive
+2
|
2800
|
| 2150-E1 |
Hidden Single (Version 1)
|
divide and conquer
interactive
math
+2
|
2600
|
| 2150-D |
Attraction Theory
|
combinatorics
dp
math
|
2700
|
| 2150-C |
Limited Edition Shop
|
data structures
dp
|
2100
|
| 2150-B |
Grid Counting
|
combinatorics
implementation
math
|
1700
|
| 2150-A |
Incremental Path
|
data structures
hashing
implementation
|
1300
|
| 2149-G |
Buratsuta 3
|
binary search
brute force
data structures
+2
|
2100
|
| 2149-F |
Nezuko in the Clearing
|
binary search
math
ternary search
|
1900
|
| 2149-E |
Hidden Knowledge of the Ancients
|
data structures
two pointers
|
1500
|
| 2149-D |
A and B
|
strings
|
1200
|
| 2149-C |
MEX rose
|
greedy
|
900
|
| 2149-B |
Unconventional Pairs
|
greedy
sortings
|
800
|
| 2149-A |
Be Positive
|
math
|
800
|
| 2148-G |
Farmer John's Last Wish
|
binary search
data structures
math
+1
|
1900
|
| 2148-F |
Gravity Falls
|
greedy
implementation
sortings
|
1800
|
| 2148-E |
Split
|
binary search
data structures
two pointers
|
1200
|
| 2148-D |
Destruction of the Dandelion Fields
|
constructive algorithms
greedy
sortings
|
1000
|
| 2148-C |
Pacer
|
greedy
math
|
900
|
| 2148-B |
Lasers
|
geometry
|
800
|
| 2148-A |
Sublime Sequence
|
brute force
hashing
math
|
800
|
| 2147-I2 |
Longest Increasing Path (Hard Version)
|
constructive algorithms
math
|
3500
|
| 2147-I1 |
Longest Increasing Path (Easy Version)
|
constructive algorithms
math
|
3300
|
| 2147-H |
Maxflow GCD Coloring
|
constructive algorithms
flows
graphs
|
3500
|
| 2147-G |
Modular Tetration
|
combinatorics
math
number theory
|
3100
|
| 2147-F |
Exchange Queries
|
combinatorics
data structures
greedy
|
2800
|
| 2147-E |
Maximum OR Popcount
|
binary search
bitmasks
brute force
+2
|
2300
|
| 2147-D |
Game on Array
|
games
greedy
|
1700
|
| 2147-C |
Rabbits
|
constructive algorithms
dp
greedy
+1
|
1500
|
| 2147-B |
Multiple Construction
|
constructive algorithms
|
1000
|
| 2147-A |
Shortest Increasing Path
|
constructive algorithms
greedy
|
800
|
| 2146-F |
Bubble Sort
|
brute force
combinatorics
dp
|
2900
|
| 2146-E |
Yet Another MEX Problem
|
brute force
constructive algorithms
data structures
+3
|
2300
|
| 2146-D2 |
Max Sum OR (Hard Version)
|
bitmasks
constructive algorithms
divide and conquer
+1
|
2000
|
| 2146-D1 |
Max Sum OR (Easy Version)
|
bitmasks
constructive algorithms
divide and conquer
+2
|
1500
|
| 2146-C |
Wrong Binary Search
|
binary search
constructive algorithms
|
1300
|