CP-Library

競技プログラミングのライブラリ

Library Files

DataStructure

• DataStructure/BinaryIndexedTree.cpp
• DataStructure/BinaryTrie.cpp
• DataStructure/DualSegmentTree.cpp
• DataStructure/ImplicitTreap.cpp
• DataStructure/LazySegmentTree.cpp
• DataStructure/LiChaoTree.cpp
• DataStructure/Median.cpp
• DataStructure/PartiallyPersistentUnionFind.cpp
• DataStructure/PotentializedUnionFind.cpp
• DataStructure/QuickFind.cpp
• DataStructure/SegmentTree.cpp
• DataStructure/SlidingWindowAggregation.cpp
• DataStructure/SparseTable.cpp
• DataStructure/Treap.cpp
• DataStructure/Trie.cpp
• DataStructure/UnionFind.cpp

Flow

• Flow/Dinic.cpp
• Flow/FordFulkerson.cpp

Geometry

• Geometry/Base.cpp
• Geometry/ConvexHull.cpp

Graph

• Graph/CentroidDecomposition.cpp
• Graph/Dijkstra.cpp
• Graph/HeavyLightDecomposition.cpp
• Graph/LowestCommonAncester.cpp
• Graph/StronglyConnectedComponents.cpp

Math

• Math/Combination.cpp
• Math/FastFourierTransform.cpp
• Math/FastMoebiusTransform.cpp
• Math/FastZetaTransform.cpp
• Math/GaussJordan.cpp
• Math/Matrix.cpp
• Math/Modint.cpp
• Math/NTT.cpp
• Math/RuntimeModint.cpp

Other

• Other/Monoid.cpp
• Other/Random.cpp
• Other/Template.cpp
• Other/TernarySearch.cpp

String

• String/MP.cpp
• String/RollingHash.cpp

Verify Files

• Test/BinaryIndexedTree.test.cpp
• Test/Dijkstra.test.cpp
• Test/Dinic.test.cpp
• Test/DualSegmentTree.test.cpp
• Test/FordFulkerson.test.cpp
• Test/HLDpath.test.cpp
• Test/HLDsubtree.test.cpp
• Test/LCA.test.cpp
• Test/LazySegmentTree.test.cpp
• Test/LineCHT.test.cpp
• Test/PartiallyPersistentUF.test.cpp
• Test/PotentializedUF.test.cpp
• Test/QuickFind.test.cpp
• Test/RollingHash.test.cpp
• Test/SCC.test.cpp
• Test/SWAG.test.cpp
• Test/SegmentTree.test.cpp
• Test/SparseTable.test.cpp
• Test/UnionFind.test.cpp