|
|
Binary Strings Avoiding 11000 |
combinatorics
kmp
matrix-exponentiation
|
0 |
— |
2100 |
|
|
Binary Strings Avoiding 00011 |
combinatorics
kmp
matrix-exponentiation
|
0 |
— |
2100 |
|
|
Binary Strings Avoiding 01101 |
combinatorics
kmp
matrix-exponentiation
|
0 |
— |
2100 |
|
|
Binary Strings Avoiding 10011 |
combinatorics
kmp
matrix-exponentiation
|
0 |
— |
2100 |
|
|
Binary Strings Avoiding 11100 |
combinatorics
kmp
matrix-exponentiation
|
0 |
— |
2100 |
|
|
Binary Strings Avoiding 00111 |
combinatorics
kmp
matrix-exponentiation
|
0 |
— |
2100 |
|
|
K-th Smallest in a Slice |
binary-search
segment-tree
|
0 |
— |
2200 |
|
|
Courier Convoys |
graphs
flow
|
0 |
— |
2200 |
|
|
Exactly K Flights |
graphs
matrix-exponentiation
|
0 |
— |
2200 |
|
|
Optimal Search Tree |
dp
interval-dp
|
0 |
— |
2200 |
|
|
System of Remainders |
number-theory
|
0 |
— |
2200 |
|
|
K-th Smallest XOR Value |
bitwise
linear-algebra
|
0 |
— |
2200 |
|
|
Counting Necklaces |
combinatorics
number-theory
|
0 |
— |
2200 |
|
|
Two Squares |
number-theory
|
0 |
— |
2200 |
|
|
Dictionary Match Count |
strings
aho-corasick
|
0 |
— |
2200 |
|
|
Rank Among the Suffixes |
strings
suffix-array
|
0 |
— |
2200 |
|
|
The Nearest Two |
divide-and-conquer
geometry
|
0 |
— |
2200 |
|
|
Shortest Reaching Subarray (Negatives) |
prefix-sums
deque
|
0 |
— |
2200 |
|
|
Distinct Palindromic Subsequences |
strings
dp
|
0 |
— |
2200 |
|
|
Rainwater on a Terrain |
bfs
heap
|
0 |
— |
2200 |
|
|
Bounded XOR Count |
bitwise
digit-dp
|
0 |
— |
2200 |
|
|
Perfect Assignment |
dp
bitmask
|
0 |
— |
2300 |
|
|
Factor the Giant |
number-theory
pollard-rho
|
0 |
— |
2300 |
|
|
Solve the Exponent |
number-theory
|
1 |
|
2300 |
|
|
Find a Primitive Root |
number-theory
|
0 |
— |
2300 |
|
|
How Many Distinct Substrings |
strings
suffix-array
|
0 |
— |
2300 |
|
|
Area of Overlapping Rectangles |
geometry
sweep-line
|
0 |
— |
2300 |
|
|
The Runner-Up Spanning Tree |
graphs
union-find
|
0 |
— |
2300 |
|
|
Most Frequent in a Slice |
offline
|
0 |
— |
2300 |
|
|
Square Root Modulo a Prime |
number-theory
|
0 |
— |
2400 |
|
|
The K-th Distinct Substring |
strings
suffix-array
|
0 |
— |
2400 |
|
|
Connecting Cities by Grid |
geometry
greedy
|
0 |
— |
2400 |
|
|
Avoid the Set {00, 11} |
combinatorics
aho-corasick
matrix-exponentiation
|
5 |
|
2400 |
|
|
Avoid the Set {010, 101} |
combinatorics
aho-corasick
matrix-exponentiation
|
0 |
— |
2400 |
|
|
Avoid the Set {000, 111} |
combinatorics
aho-corasick
matrix-exponentiation
|
0 |
— |
2400 |
|
|
Avoid the Set {11, 010} |
combinatorics
aho-corasick
matrix-exponentiation
|
0 |
— |
2400 |
|
|
Avoid the Set {00, 11, 22} |
combinatorics
aho-corasick
matrix-exponentiation
|
0 |
— |
2400 |
|
|
Avoid the Set {012, 210} |
combinatorics
aho-corasick
matrix-exponentiation
|
0 |
— |
2400 |
|
|
Avoid the Set {00, 12} |
combinatorics
aho-corasick
matrix-exponentiation
|
0 |
— |
2400 |
|
|
Avoid the Set {aa, bab} |
combinatorics
aho-corasick
matrix-exponentiation
|
0 |
— |
2400 |
|
|
Avoid the Set {ab, bc, ca} |
combinatorics
aho-corasick
matrix-exponentiation
|
0 |
— |
2400 |
|
|
Power Tower Modulo |
number-theory
|
0 |
— |
2400 |