competitive-programming-library
This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub ageprocpp/competitive-programming-library
competitive-programming-library
Library Files
basic
data-structure
Binary Indexed Tree
(data-structure/BIT.hpp)
Binary Heap
(data-structure/BinaryHeap.hpp)
- Convex Hull Trick
(data-structure/ConvexHullTrick.hpp)
- Dynamic Segment Tree
(data-structure/DynamicSegTree.hpp)
- Interval Segment Tree
(data-structure/IntervalSegTree.hpp)
- Li Chao Tree
(data-structure/LiChaoTree.hpp)
- Convex Hull Trick for monotone queries
(data-structure/MonotoneConvexHullTrick.hpp)
- Persistent Stack
(data-structure/PersistentStack.hpp)
- Prioritizable Binary Heap
(data-structure/PrioritizableBinaryHeap.hpp)
- Randomized Binary Search Tree
(data-structure/RBST.hpp)
- Set based on Randomized Binary Search Tree
(data-structure/RBSTset.hpp)
- Sliding Window Aggregation
(data-structure/SWAG.hpp)
- Segment Tree
(data-structure/SegTree.hpp)
- Segment Tree Beats
(data-structure/SegTreeBeats.hpp)
- Sparse Table
(data-structure/SparseTable.hpp)
- Succinct Bit Vector
(data-structure/SuccinctBitVector.hpp)
- Wavelet Matrix
(data-structure/WaveletMatrix.hpp)
- van Emde Boas Tree
(data-structure/vanEmdeBoasTree.hpp)
graph
- Dijkstra's algorithm
(graph/Dijkstra.hpp)
- Dinic's algorithm
(graph/Dinic.hpp)
- Ford-Fulkerson algorithm
(graph/FordFulkerson.hpp)
- graph/Graph.hpp
- Heavy light decomposition
(graph/HeavyLightDecomposition.hpp)
- Partially persistent disjoint set
(graph/PersistentUnionFind.hpp)
- Primal-dual algorithm
(graph/PrimalDual.hpp)
- Strongly connected components
(graph/StronglyConnectedComponents.hpp)
- Basic algorithms for tree
(graph/Tree.hpp)
- Two-sat solver
(graph/TwoSat.hpp)
- Disjoint set
(graph/UnionFind.hpp)
math
- Combinatorics/ModCombinatorics
(math/Combinatorics.hpp)
- math/CountPrime.hpp
- Discrete Logarithm
(math/DiscreteLogarithm.hpp)
- DynamicModInt
(math/DynamicModInt.hpp)
- math/Factorize.hpp
- FastFactorize
(math/FastFactorize.hpp)
- FastFourierTransform
(math/FastFourierTransform.hpp)
- FloorSum
(math/FloorSum.hpp)
- math/FormalPowerSeries.hpp
- math/Geometry.hpp
- math/Interpolation.hpp
- Matrix
(math/Matrix.hpp)
- MyComplex
(math/MyComplex.hpp)
- NumberTheoreticTransform
(math/NumberTheoreticTransform.hpp)
- StaticModInt
(math/StaticModInt.hpp)
- math/XorConvolution.hpp
other
string
- EerTree
(string/EerTree.hpp)
- Hash library for strings
(string/HashedString.hpp)
- Rolling hash
(string/RollingHash.hpp)
- Suffix array
(string/SuffixArray.hpp)
- Trie
(string/Trie.hpp)
- string/ZAlgorithm.hpp
test/yosupo
Verification Files
test/aoj
- test/aoj/ALDS1_14_B_HashedString.test.cpp
- test/aoj/ALDS1_14_B_SuffixArray.test.cpp
- test/aoj/CGL_1_A.test.cpp
- test/aoj/CGL_1_B.test.cpp
- test/aoj/CGL_1_C.test.cpp
- test/aoj/CGL_2_A.test.cpp
- test/aoj/CGL_2_B.test.cpp
- test/aoj/CGL_2_C.test.cpp
- test/aoj/CGL_2_D.test.cpp
- test/aoj/CGL_3_A.test.cpp
- test/aoj/CGL_3_B.test.cpp
- test/aoj/CGL_3_C.test.cpp
- test/aoj/CGL_4_A.test.cpp
- test/aoj/CGL_4_B.test.cpp
- test/aoj/DSL_2_A.test.cpp
- test/aoj/DSL_2_B.test.cpp
- test/aoj/DSL_2_D.test.cpp
- test/aoj/DSL_2_E.test.cpp
- test/aoj/DSL_2_F.test.cpp
- test/aoj/DSL_2_G.test.cpp
- test/aoj/DSL_2_H.test.cpp
- test/aoj/DSL_2_I.test.cpp
- test/aoj/GRL_6_A_Dinic.test.cpp
- test/aoj/GRL_6_A_FordFulkerson.test.cpp
- test/aoj/GRL_6_B.test.cpp
test/yosupo
- test/yosupo/aplusb.test.cpp
- test/yosupo/associative_array.test.cpp
- test/yosupo/bipartitematching.test.cpp
- test/yosupo/convolution_mod.test.cpp
- test/yosupo/convolution_mod_1000000007.test.cpp
- test/yosupo/convolution_mod_large.test.cpp
- test/yosupo/counting_primes.test.cpp
- test/yosupo/exp_of_formal_power_series.test.cpp
- test/yosupo/factorize.test.cpp
- test/yosupo/factorize_fast.test.cpp
- test/yosupo/inv_of_formal_power_series.test.cpp
- test/yosupo/lca.test.cpp
- test/yosupo/line_add_get_min_ConvexHullTrick.test.cpp
- test/yosupo/line_add_get_min_LiChaoTree.test.cpp
- test/yosupo/log_of_formal_power_series.test.cpp
- test/yosupo/many_aplusb.test.cpp
- test/yosupo/matrix_det.test.cpp
- test/yosupo/matrix_product.test.cpp
- test/yosupo/point_add_range_sum.test.cpp
- test/yosupo/point_set_range_composite.test.cpp
- test/yosupo/pow_of_formal_power_series.test.cpp
- test/yosupo/predecessor_problem.test.cpp
- test/yosupo/queue_operate_all_composite.test.cpp
- test/yosupo/range_affine_range_sum.test.cpp
- test/yosupo/range_chmin_chmax_add_range_sum.test.cpp
- test/yosupo/range_kth_smallest.test.cpp
- test/yosupo/scc.test.cpp
- test/yosupo/segment_add_get_min.test.cpp
- test/yosupo/set_xor_min.test.cpp
- test/yosupo/shortest_path.test.cpp
- test/yosupo/static_range_sum.test.cpp
- test/yosupo/staticrmq.test.cpp
- test/yosupo/suffixarray.test.cpp
- test/yosupo/sum_of_floor_of_linear.test.cpp
- test/yosupo/tree_diameter.test.cpp
- test/yosupo/two_sat.test.cpp
- test/yosupo/unionfind.test.cpp
- test/yosupo/vertex_add_path_sum.test.cpp
- test/yosupo/vertex_add_subtree_sum.test.cpp
- test/yosupo/vertex_set_path_composite.test.cpp