Library

Library Files

graph

• Max Flow (Dinic) (graph/MaxFlow.cpp)
• Min Cost Flow (Primal Dual) (graph/MinCostFlow.cpp)
• graph/SCC.cpp
• graph/Tree.cpp

math

• math/CRT.cpp
• Combination (nCk) (math/Combination.cpp)
• math/FFT.cpp
• math/combination_big.cpp
• math/extgcd.cpp
• Fast Prime Factorization (math/factor.cpp)
• math/matrix.cpp
• mod int (math/modint.cpp)

string

• Burrows Wheeler Transform (string/BWT.cpp)
• FM Index (string/FM_index.cpp)
• Rolling Hash (mod 2^61-1) (string/RollingHash.cpp)
• Suffix Array (SA-IS) (string/SuffixArray.cpp)
• string/Zalgo.cpp

structure

• Binary Indexed Tree (structure/BIT.cpp)
• Bit Vector (structure/BitVector.cpp)
• structure/HLD.cpp
• Li Chao Tree (Convex Hull Trick) (structure/LiChaoTree.cpp)
• structure/Mo.cpp
• structure/PartialPersistentUnionFind.cpp
• structure/PersistentArray.cpp
• structure/PersistentUnionFind.cpp
• Lazy Segment Tree (structure/SegmentTree.cpp)
• structure/SegmentTreeBeats.cpp
• Sparse Table (structure/SparseTable.cpp)
• structure/SplayTree.cpp
• Union Find (structure/UnionFind.cpp)
• Wavelet Matrix (structure/WaveletMatrix.cpp)

template

• template/template.cpp

Verification Files

test

• test/BIT.test.cpp
• test/Combination.test.cpp
• test/FM_index.test.cpp
• test/LiChaoTree.test.cpp
• test/MaxFlow.test.cpp
• test/MinCostFlow.test.cpp
• test/RollingHash.test.cpp
• test/SegmentTree.test.cpp
• test/SparseTable.test.cpp
• test/SuffixArray.LCP.test.cpp
• test/SuffixArray.matching.test.cpp
• test/SuffixArray.test.cpp
• test/UnionFind.test.cpp
• test/WaveletMatrix.test.cpp
• test/factor.test.cpp