| 1497-E1 |
Square-Free Division (easy version)
|
data structures
dp
greedy
+3
|
1700
|
| 1497-D |
Genius
|
bitmasks
dp
graphs
+1
|
2500
|
| 1497-C2 |
k-LCM (hard version)
|
constructive algorithms
math
|
1600
|
| 1497-C1 |
k-LCM (easy version)
|
constructive algorithms
math
|
1200
|
| 1497-B |
M-arrays
|
constructive algorithms
greedy
math
|
1200
|
| 1497-A |
Meximization
|
brute force
data structures
greedy
+1
|
800
|
| 1496-B |
Max and Mex
|
math
|
1100
|
| 1496-A |
Split it!
|
brute force
constructive algorithms
greedy
+1
|
900
|
| 1495-F |
Squares
|
constructive algorithms
data structures
dp
+2
|
3300
|
| 1495-E |
Qingshan and Daniel
|
brute force
data structures
greedy
+1
|
3200
|
| 1495-D |
BFS Trees
|
combinatorics
dfs and similar
graphs
+3
|
2600
|
| 1495-C |
Garden of the Sun
|
constructive algorithms
graphs
|
2300
|
| 1495-B |
Let's Go Hiking
|
games
greedy
|
1900
|
| 1495-A |
Diamond Miner
|
geometry
greedy
math
+1
|
1200
|
| 1494-F |
Delete The Edges
|
brute force
constructive algorithms
dfs and similar
+2
|
2900
|
| 1494-E |
A-Z Graph
|
constructive algorithms
data structures
graphs
+1
|
2400
|
| 1494-D |
Dogeforces
|
constructive algorithms
data structures
dfs and similar
+5
|
2300
|
| 1494-C |
1D Sokoban
|
binary search
dp
greedy
+2
|
1900
|
| 1494-B |
Berland Crossword
|
bitmasks
brute force
greedy
+1
|
1400
|
| 1494-A |
ABC String
|
bitmasks
brute force
implementation
|
900
|
| 1493-F |
Enchanted Matrix
|
bitmasks
interactive
number theory
|
2600
|
| 1493-E |
Enormous XOR
|
bitmasks
constructive algorithms
greedy
+3
|
2600
|
| 1493-D |
GCD of an Array
|
brute force
data structures
hashing
+5
|
2100
|
| 1493-C |
K-beautiful Strings
|
binary search
brute force
constructive algorithms
+2
|
2000
|
| 1493-B |
Planet Lapituletti
|
brute force
implementation
|
1300
|
| 1493-A |
Anti-knapsack
|
constructive algorithms
greedy
|
800
|
| 1492-E |
Almost Fault-Tolerant Database
|
brute force
constructive algorithms
dfs and similar
+2
|
2500
|
| 1492-D |
Genius's Gambit
|
bitmasks
constructive algorithms
greedy
+1
|
1900
|
| 1492-C |
Maximum width
|
binary search
data structures
dp
+2
|
1500
|
| 1492-B |
Card Deck
|
data structures
greedy
math
|
1100
|
| 1492-A |
Three swimmers
|
math
|
800
|
| 1491-I |
Ruler Of The Zoo
|
brute force
data structures
|
3500
|
| 1491-H |
Yuezheng Ling and Dynamic Tree
|
data structures
trees
|
3400
|
| 1491-G |
Switch and Flip
|
constructive algorithms
graphs
math
|
2800
|
| 1491-F |
Magnets
|
binary search
constructive algorithms
interactive
|
2700
|
| 1491-E |
Fib-tree
|
brute force
dfs and similar
divide and conquer
+2
|
2400
|
| 1491-D |
Zookeeper and The Infinite Zoo
|
bitmasks
constructive algorithms
dp
+2
|
1800
|
| 1491-C |
Pekora and Trampoline
|
brute force
data structures
dp
+2
|
1700
|
| 1491-B |
Minimal Cost
|
brute force
math
|
1200
|
| 1491-A |
K-th Largest Value
|
brute force
greedy
implementation
|
800
|
| 1490-G |
Old Floppy Drive
|
binary search
data structures
math
|
1900
|
| 1490-F |
Equalize the Array
|
binary search
data structures
greedy
+2
|
1500
|
| 1490-E |
Accidental Victory
|
binary search
data structures
greedy
|
1400
|
| 1490-D |
Permutation Transformation
|
dfs and similar
divide and conquer
implementation
|
1200
|
| 1490-C |
Sum of Cubes
|
binary search
brute force
math
|
1100
|
| 1490-B |
Balanced Remainders
|
brute force
constructive algorithms
math
|
1000
|
| 1490-A |
Dense Array
|
greedy
math
|
800
|
| 1488-J |
Flower Shop
|
*special
data structures
fft
+1
|
3100
|
| 1488-I |
Demonic Invasion
|
*special
flows
|
3100
|
| 1488-H |
Build From Suffixes
|
*special
combinatorics
data structures
|
2800
|