library

Library Files

library/convolution

• Fast Fourier Transform (library/convolution/FFT.cpp)
• Fast Zeta Transform (library/convolution/FZT.cpp)
• Number Theoretic Transform (library/convolution/NTT.cpp)

library/dp

• library/dp/rekkyo.cpp

library/graph/connected-components

• Strongly Connected Components (library/graph/connected-components/StronglyConnectedComponents.cpp)
• 2-SAT (library/graph/connected-components/TwoSat.cpp)

library/graph/distance

• travelling salesman problem (library/graph/distance/TSP.cpp)
• bellman ford (library/graph/distance/bellman_ford.cpp)
• bfs dial (library/graph/distance/bfs_dial.cpp)
• dijkstra (library/graph/distance/dijkstra.cpp)
• grid bfs (library/graph/distance/grid_bfs.cpp)
• multi-source dijkstra (library/graph/distance/multi_source_dijkstra.cpp)
• library/graph/distance/warshall_floyd.cpp

library/graph/flow

• 二部グラフの最大マッチング (library/graph/flow/BipartiteMatching.cpp)
• library/graph/flow/MinCostFlow.cpp
• 最大流 (library/graph/flow/max_flow.cpp)

library/graph/others

• library/graph/others/LowLink.cpp

library/graph/tree

• library/graph/tree/HLD.cpp
• library/graph/tree/ReRooting.cpp

library/heuristic

• start_temp: 一回の遷移で動きうるスコア幅の最大値程度, end_temp: 一回の遷移で動きうるスコア幅の最小値程度 (library/heuristic/annealing.cpp)
• library/heuristic/beam_search.cpp
• 連結数: 周囲9マスのうち値がcであるような連結成分の数．1なら連結 (library/heuristic/connection_number.cpp)

library/math

• library/math/BitMatrix.cpp
• Formal Power Series (library/math/FormalPowerSeries.cpp)
• library/math/Matrix.cpp
• Combination(P, C, H, Stirling number, Bell number) (library/math/combination.cpp)
• library/math/convert_base.cpp
• 拡張ユークリッドの互除法 (library/math/extgcd.cpp)
• is_prime(miller-rabin) (library/math/is_prime.cpp)
• factorization(pollard) (library/math/pollard.cpp)
• library/math/sparse_mul_div.cpp

library/mod

• library/mod/ArbitaryModInt.cpp
• library/mod/mod_sqrt.cpp
• library/mod/modint.cpp

library/others

• library/others/Doubling.cpp
• library/others/dfs_grid.cpp
• library/others/transpose.cpp
• library/others/worm.cpp

library/string

• library/string/LongestCommonPrefixArray.cpp
• library/string/RollingHash.cpp
• library/string/SuffixArray.cpp

library/structure/BIT

• library/structure/BIT/BIT.cpp

library/structure/UnionFind

• UnionFind (library/structure/UnionFind/UnionFind.cpp)
• library/structure/UnionFind/UnionFindUndo.cpp
• library/structure/UnionFind/merge_tree.cpp

library/structure/segtree

• library/structure/segtree/DualSegmentTree.cpp
• Lazy-Segment-Tree(遅延伝搬セグメント木) (library/structure/segtree/LazySegmentTree.cpp)
• Segment Tree (library/structure/segtree/SegmentTree.cpp)

library/structure/wavelet

• library/structure/wavelet/WaveletMatrix.cpp

library/template

• library/template/template.cpp

typical/dp

• typical/dp/hakone.cpp
• typical/dp/sort.cpp

typical/others

• 牛ゲー (typical/others/cow_game.cpp)

verify

• verify/aoj.cpp
• verify/atcoder-Doubling.cpp
• verify/yuki-1408.cpp

Verification Files

verify

• verify/ArticulationPoint.test.cpp
• verify/FZT.test.cpp
• verify/aoj-1595.test.cpp
• verify/aoj-ALDS1_12_B.test.cpp
• verify/aoj-ALDS1_14_B.test.cpp
• verify/aoj-ALDS1_14_D.test.cpp
• verify/aoj-DPL_5_G.test.cpp
• verify/aoj-DSL_2_B.test.cpp
• verify/aoj-DSL_2_G.test.cpp
• verify/aoj-GRL_6_B.test.cpp
• verify/aoj-GRL_7_A.test.cpp
• verify/aoj-NTL_1_A.test.cpp
• verify/aoj-NTL_1_E.test.cpp
• verify/aoj-TSP.test.cpp
• verify/aoj-dsl-1-a.test.cpp
• verify/aoj-max_flow.test.cpp
• verify/aoj-single_source_shortest_path.test.cpp
• verify/aoj-single_source_shortest_path_negative_edges.test.cpp
• verify/range_arithmetic_progression_add.test.cpp
• verify/yosupo-convolution_mod_1000000007.test.cpp
• verify/yosupo-range_kth_smallest.test.cpp
• verify/yosupo-two_sat.test.cpp
• verify/yuki-1301.test.cpp
• verify/yuki-184.test.cpp
• verify/yuki-545.test.cpp
• verify/yuki-650.test.cpp
• verify/yuki-FPS.power.test.cpp