競プロライブラリ
Home
Initializing search
競プロライブラリ
Home
Bit
Bit
LSB
MSB
Compression
Compression
compressor 1D
Run length encode
Data structure
Data structure
2d segment tree
Avl tree
Binary indexed tree
Binary trie
Bit array
Bit set
Cartesian tree
Convex hull trick
Fenwick tree
Heavy light decomposition
Interval set
Interval union find
Lazy segment tree
Longest increasing subsequence
Mo algorithm
Priority queue
Segment tree
Segment tree beats
Set
Slope trick
Trie
Union find
Union find add
Wavelet matrix
Geometry
Geometry
Arg
Circle
Convex hull
Cross check
Line
Vector
Graph
Graph
Bellman ford
Dijkstra
Low link
Max flow
Heuristic
Heuristic
Beam search
Simulated annealing
Timer
Interval search
Interval search
Fibonacci search
Math
Math
Divisor
Eratosthenes
Ext euclid
F2
Factorial
Factorial system
Factorize
Fft
Floor sum
Log mod
Modint
Next combination
Prime
Matrix
Matrix
Matrix power
Xor base
Misc
Misc
Elapsed time
Floor group
Remove duplication
Random
Random
Mersenne twister
Random generator
Xor shift 128
Sort
Sort
Argsort
Topological sort
String
String
Knuth Morris Pratt
Morris Pratt
Base 26 system
Dynamic rolling hash
Manachar
Rolling hash
Split
Z algorithm
Techniques
Techniques
Enumerate subset
minimum path cover on DAG
Tree
Tree
Auxiliary tree
Euler tour
Lowest common ancestor
Rerooting
Tree
Home
競プロライブラリ管理用ドキュメント