1.
Introduction
1.1.
Data Structures
1.1.1.
Segment Trees
1.1.1.1.
Segment Tree
1.1.1.2.
Lazy Segment Tree
1.1.1.3.
Persistent Segment Tree
1.1.1.4.
Dynamic Segment Tree
1.1.1.5.
Li-Chao Line Add Tree
1.1.1.6.
Li-Chao Segment Add Tree
1.1.1.7.
Beats (chmin + sum)
1.1.1.8.
Beats (chmin + chmax + sum)
1.1.1.9.
Beats (chmin + chmax + add + sum)
1.1.2.
Heaps
1.1.2.1.
Pairing Heap
1.1.3.
Trees
1.1.3.1.
EulerTour Subtree
1.1.3.2.
EulerTour Path
1.1.3.3.
Heavy Light Decomposition
1.1.3.4.
Link Cut Tree
1.1.3.5.
Top Tree
1.1.4.
Union Find
1.1.4.1.
Union Find
1.1.4.2.
Persistent Union Find
1.1.5.
self-Balancing Binary Search Trees
1.1.5.1.
Splay Tree Array
1.1.5.2.
Splay Tree Map
1.1.5.3.
AVL Tree Array
1.1.5.4.
AVL Tree Array Tuned
1.1.5.5.
AVL Tree Map
1.1.5.6.
AVL Tree Map Foldable
1.1.5.7.
Persistent AVL Tree Array
1.1.6.
Sparse Table
1.1.6.1.
Sparse Table
1.1.7.
Wavelet Matrix
1.1.7.1.
Wavelet Matrix
1.1.7.2.
Dynamic Wavelet Matrix
1.1.8.
Container
1.1.8.1.
Fully Retroactive Stack
1.1.8.2.
Hash Map
1.1.9.
Other
1.1.9.1.
SWAG
1.1.9.2.
Fenwick Tree
1.1.9.3.
Online Dynamic Connectivity
1.1.9.4.
Range Valued Array
1.2.
Math
1.2.1.
modint
1.2.2.
montgomery modint
1.2.3.
Matrix
1.2.4.
Chinese Remainder Theorem
1.2.5.
Garner's Algorithm
1.2.6.
Formal Power Series
1.2.7.
Mori FPS Division
1.2.8.
Newton Interpolation
1.2.9.
Seidel's LP
1.2.10.
Runtime fp
1.2.11.
F2FPS
1.2.12.
Factorial
1.2.13.
osa_k
1.2.14.
Adjucency Matrix Equation
1.2.15.
Berlekamp-Massey
1.2.16.
Fast-Kitamasa
1.2.17.
Black Box Linear Algebra
1.2.18.
Convolution
1.2.18.1.
Multiple Transform
1.2.18.2.
Divisor Transform
1.2.18.3.
Fast Fourier Transform
1.2.18.4.
Number Theoretic Transform
1.2.18.5.
Zeta Mobius Transform
1.3.
String
1.3.1.
2^31 Rolling Hash
1.3.2.
Manacher
1.3.3.
MP (Morris Pratt)
1.3.4.
Suffix Array
1.3.5.
Z-algorithm
1.3.6.
Burrows Wheeler
1.3.7.
Rolling Hash
1.4.
Graph
1.4.1.
Shortest Path
1.4.1.1.
Dijkstra
1.4.1.2.
BFS
1.4.1.3.
Dial 01
1.4.2.
Max Flow
1.4.2.1.
Dinic
1.4.2.2.
GoldBerg Tarjan's Preflow Relabel
1.4.3.
Minimum Cost Flow
1.4.3.1.
Successive Shortest Path
1.4.4.
Strongly Connected Components
1.4.5.
Incremental Bridge Connectivity
1.4.6.
Lattice Graph
1.5.
Geometry
1.6.
Tech
1.6.1.
Compression
1.6.2.
Grundy Number
1.6.3.
Monge DP
1.6.4.
Mo's Algorithm
1.6.5.
Slide Min
1.6.6.
FastIO
1.6.7.
Non-recursive Rerooting
Light
Rust
Coal
Navy
Ayu
cp-cpp-library Document
Heap