CompetitiveProgrammingCpp

Library Files

Library/Algebraic

• Library/Algebraic/Group.hpp
• Library/Algebraic/Monoid.hpp
• Library/Algebraic/SemiGroup.hpp

Library/Algorithms

• Library/Algorithms/BinarySearch.hpp
• Library/Algorithms/CoordinateCompression.hpp
• Library/Algorithms/Mo.hpp

Library/DataStructure

• Library/DataStructure/Accumulation.hpp
• Library/DataStructure/Accumulation2D.hpp
• Library/DataStructure/CartesianTree.hpp
• Library/DataStructure/ConvecHullTrick.hpp
• Library/DataStructure/DisjointSetUnion.hpp
• Library/DataStructure/DisjointSparseTable.hpp
• Library/DataStructure/DynamicSegmentTree.hpp
• Library/DataStructure/LazySegmentTree.hpp
• Library/DataStructure/LiChaoTree.hpp
• Library/DataStructure/RunLengthEncoding.hpp
• Library/DataStructure/SegmentMap.hpp
• Library/DataStructure/SegmentTree.hpp
• Library/DataStructure/SternBrocotTree.hpp

Library/Graph/Flow

• Library/Graph/Flow/Dinic.hpp
• Library/Graph/Flow/FordFulkerson.hpp
• Library/Graph/Flow/SuccessiveShortestPath.hpp

Library/Graph

• Library/Graph/Graph.hpp

Library/Graph/Normal

• Library/Graph/Normal/BFS.hpp
• Library/Graph/Normal/Kruskal.hpp
• Library/Graph/Normal/Prim.hpp
• Library/Graph/Normal/StronglyConnectedComponents.hpp
• Library/Graph/Normal/Topological.hpp
• Library/Graph/Normal/WarshallFloyd.hpp
• Library/Graph/Normal/dijkstra.hpp

Library/Graph/Tree

• Library/Graph/Tree/AuxiliaryTree.hpp
• Library/Graph/Tree/EulerTour.hpp
• Library/Graph/Tree/HeavyLightDecomposition.hpp
• Library/Graph/Tree/LowestCommonAncestor.hpp
• Library/Graph/Tree/ReRootingDP.hpp
• Library/Graph/Tree/TreeDP.hpp

Library/Math

• Library/Math/BabyStepGiantStep.hpp
• Library/Math/Bit.hpp
• Library/Math/Convolution.hpp
• Library/Math/DynamicModInt.hpp
• Library/Math/EuclideanAlgorithm.hpp
• Library/Math/Math.hpp
• Library/Math/Matrix.hpp
• Library/Math/Mobius.hpp
• Library/Math/ModInt.hpp
• Library/Math/Prime.hpp
• Library/Math/Zeta.hpp

Library/PlaneGeometry

• Library/PlaneGeometry/ConvexHull.hpp

Library/Range

• Library/Range/bit.hpp
• Library/Range/istream.hpp
• Library/Range/set.hpp
• Library/Range/util.hpp

Library/String

• Library/String/LCPArray.hpp
• Library/String/PalindromicTree.hpp
• Library/String/RollingHash.hpp
• Library/String/SuffixArray.hpp
• Library/String/TrieTree.hpp
• Library/String/ZAlgorithm.hpp

Library/Utility

• Library/Utility/Tools.hpp
• Library/Utility/Tuple.hpp
• Library/Utility/Ycombinator.hpp
• Library/Utility/io.hpp

Verification Files

Test/Algorithms

• Test/Algorithms/BinarySearch_double_rev.test.cpp
• Test/Algorithms/BinarySearch_int.test.cpp
• Test/Algorithms/BinarySearch_int_rev.test.cpp
• Test/Algorithms/CoordinateCompression_comp.test.cpp
• Test/Algorithms/CoordinateCompression_to.test.cpp
• Test/Algorithms/Mo.test.cpp

Test/DataStructure

• Test/DataStructure/Accumulation2D_sum.test.cpp
• Test/DataStructure/Accumulation_sum.test.cpp
• Test/DataStructure/Accumulation_xor.test.cpp
• Test/DataStructure/CartesianTree.test.cpp
• Test/DataStructure/ConvexHullTrick.test.cpp
• Test/DataStructure/DisjointSetUnion.test.cpp
• Test/DataStructure/DisjointSetUnion_Potential.test.cpp
• Test/DataStructure/DisjointSparseTable_RMQ.test.cpp
• Test/DataStructure/DisjointSparseTable_xor.test.cpp
• Test/DataStructure/DynamicLiChaoTree.test.cpp
• Test/DataStructure/DynamicLiChaoTree_segment.test.cpp
• Test/DataStructure/DynamicSegmentTree.test.cpp
• Test/DataStructure/DynamicSegmentTree_RMQ.test.cpp
• Test/DataStructure/DynamicSegmentTree_RSQ.test.cpp
• Test/DataStructure/LazySegmentTree_RAQRMQ.test.cpp
• Test/DataStructure/LazySegmentTree_RAQRSQ.test.cpp
• Test/DataStructure/LazySegmentTree_RUQRMQ.test.cpp
• Test/DataStructure/LazySegmentTree_RUQRSQ.test.cpp
• Test/DataStructure/LazySegmentTree_maxright.test.cpp
• Test/DataStructure/LiChaoTree.test.cpp
• Test/DataStructure/LiChaoTree_bias.test.cpp
• Test/DataStructure/LiChaoTree_segment.test.cpp
• Test/DataStructure/RunLengthEncoding.test.cpp
• Test/DataStructure/SegmentMap.test.cpp
• Test/DataStructure/SegmentTree_RMQ.test.cpp
• Test/DataStructure/SegmentTree_RSQ.test.cpp
• Test/DataStructure/SegmentTree_maxright.test.cpp
• Test/DataStructure/SegmentTree_minleft.test.cpp
• Test/DataStructure/SternBrocotTree.test.cpp

Test/Graph/Flow

• Test/Graph/Flow/Dinic.test.cpp
• Test/Graph/Flow/FordFulkerson.test.cpp
• Test/Graph/Flow/SuccessiveShortestPath.test.cpp

Test/Graph/Normal

• Test/Graph/Normal/BFS.test.cpp
• Test/Graph/Normal/Dijkstra.test.cpp
• Test/Graph/Normal/Kruskal.test.cpp
• Test/Graph/Normal/Prim.test.cpp
• Test/Graph/Normal/StronglyConnectedComponents.test.cpp
• Test/Graph/Normal/Topological.test.cpp
• Test/Graph/Normal/WarshallFloyd.test.cpp

Test/Graph/Tree

• Test/Graph/Tree/AuxiliaryTree.test.cpp
• Test/Graph/Tree/EulerTour.test.cpp
• Test/Graph/Tree/HeavyLightDecomposition_LCA.test.cpp
• Test/Graph/Tree/HeavyLightDecomposition_edge.test.cpp
• Test/Graph/Tree/LowestCommonAncestor.test.cpp
• Test/Graph/Tree/ReRootingDP.test.cpp
• Test/Graph/Tree/ReRootingDP_cost.test.cpp
• Test/Graph/Tree/TreeDP.test.cpp

Test/Math

• Test/Math/BabyStepGiantStep.test.cpp
• Test/Math/Convolution_and.test.cpp
• Test/Math/EuclideanAlgorithm.test.cpp
• Test/Math/EuclideanAlgorithm_gcd.test.cpp
• Test/Math/Math.test.cpp
• Test/Math/Math_dynamic.test.cpp
• Test/Math/Math_log.test.cpp
• Test/Math/Math_pow.test.cpp
• Test/Math/Math_pow_dynamic.test.cpp
• Test/Math/Matrix_pow.test.cpp
• Test/Math/Prime.test.cpp

Test/PlaneGeometry

• Test/PlaneGeometry/ConvexHull.test.cpp

Test/Range

• Test/Range/bit_subset.test.cpp
• Test/Range/flatten.test.cpp

Test/String

• Test/String/LCPArray.test.cpp
• Test/String/PalindromicTree.test.cpp
• Test/String/PalindromicTree_large.test.cpp
• Test/String/SuffixArray.test.cpp
• Test/String/TrieTree.test.cpp
• Test/String/ZAlgorithm.test.cpp

Test/Utility

• Test/Utility/Ycombinator.test.cpp

Test/sample

• Test/sample/sample1.test.cpp