algorithm-dev
This documentation is automatically generated by online-judge-tools/verification-helper
algorithm-dev
Library Files
algorithm/DataStructure/Others
Binary Heap（二分ヒープ）
(algorithm/DataStructure/Others/binary_heap.hpp)
- Binary Trie（二分トライ木）
(algorithm/DataStructure/Others/binary_trie.hpp)
algorithm/DataStructure/SegmentTree
- Binary Indexed Tree
(algorithm/DataStructure/SegmentTree/binary_indexed_tree.hpp)
- 二次元Binary Indexed Tree
(algorithm/DataStructure/SegmentTree/binary_indexed_tree_2d.hpp)
- Dynamic Segment Tree（動的セグメント木）
(algorithm/DataStructure/SegmentTree/dynamic_segment_tree.hpp)
- Lazy Segment Tree（遅延評価セグメント木）
(algorithm/DataStructure/SegmentTree/lazy_segment_tree.hpp)
- Segment Tree
(algorithm/DataStructure/SegmentTree/segment_tree.hpp)
- Sparse Table
(algorithm/DataStructure/SegmentTree/sparse_table.hpp)
algorithm/DataStructure/UnionFind
Partially Persistent Union-Find（部分永続Unionf-Find）
(algorithm/DataStructure/UnionFind/partially_persistent_union_find.hpp)
- 重み付きUnion-Find
(algorithm/DataStructure/UnionFind/potentialized_union_find.hpp)
- Rollback付きUnion-Find
(algorithm/DataStructure/UnionFind/rollback_union_find.hpp)
- Union-Find（素集合データ構造）
(algorithm/DataStructure/UnionFind/union_find.hpp)
algorithm/Graph/Flow
- Dinic's Algorithm（最大流問題）
(algorithm/Graph/Flow/dinic.hpp)
- Ford-Fulkerson Algorithm（最大流問題）
(algorithm/Graph/Flow/ford_fulkerson.hpp)
- 最小費用流問題
(algorithm/Graph/Flow/primal_dual.hpp)
algorithm/Graph/Others
- Low-Link（橋，関節点）
(algorithm/Graph/Others/low_link.hpp)
- Prim's Algorithm（最小全域木）
(algorithm/Graph/Others/prim.hpp)
- Strongly Connected Components（強連結成分分解）
(algorithm/Graph/Others/strongly_connected_components.hpp)
- Topological Sort（トポロジカルソート）
(algorithm/Graph/Others/topological_sort.hpp)
algorithm/Graph/ShortestPath
- Bellman-Ford Algorithm（単一始点最短経路）
(algorithm/Graph/ShortestPath/bellman_ford.hpp)
- Dijkstra's Algorithm（単一始点最短経路）
(algorithm/Graph/ShortestPath/dijkstra.hpp)
algorithm/Graph/Tree
- Double Sweep（木の直径）
(algorithm/Graph/Tree/double_sweep.hpp)
- Heavy-Light Decomposition（HL分解，重軽分解）
(algorithm/Graph/Tree/heavy_light_decomposition.hpp)
- Lowest Common Ancestor（最近共通祖先）
(algorithm/Graph/Tree/lowest_common_ancestor.hpp)
algorithm/Math/Algebra
- Algebraic Structure（代数的構造）
(algorithm/Math/Algebra/algebra.hpp)
- きたまさ法
(algorithm/Math/Algebra/kitamasa.hpp)
- 累乗根（ニュートン法）
(algorithm/Math/Algebra/nth_root.hpp)
- 繰り返し二乗法
(algorithm/Math/Algebra/power.hpp)
- 平方根（ニュートン法）
(algorithm/Math/Algebra/square_root.hpp)
algorithm/Math/Combinatorics
- 数え上げ（mod付き）
(algorithm/Math/Combinatorics/combination.hpp)
- 完全順列の総数，モンモール数
(algorithm/Math/Combinatorics/montmort.hpp)
- 順列，組合せ，重複組合せ
(algorithm/Math/Combinatorics/naive_combination.hpp)
- Pascal's Triangle（パスカルの三角形）
(algorithm/Math/Combinatorics/pascal_triangle.hpp)
algorithm/Math/Convolution
- Discrete Fourier Transform（離散フーリエ変換）
(algorithm/Math/Convolution/discrete_fourier_transform.hpp)
- Fast Fourier Transform（高速フーリエ変換）
(algorithm/Math/Convolution/fast_fourier_transform.hpp)
- Number Theoretic Transform（数論変換）
(algorithm/Math/Convolution/number_theoretic_transform.hpp)
algorithm/Math/ModularArithmetic
- 動的Modint構造体
(algorithm/Math/ModularArithmetic/dynamic_modint.hpp)
- モジュラ逆数（乗法逆元）
(algorithm/Math/ModularArithmetic/mod_inv.hpp)
- 繰り返し二乗法（mod付き）
(algorithm/Math/ModularArithmetic/mod_pow.hpp)
- Modint構造体
(algorithm/Math/ModularArithmetic/modint.hpp)
- Modint構造体の基底クラス
(algorithm/Math/ModularArithmetic/modint_base.hpp)
- algorithm/Math/ModularArithmetic/modulo.hpp
algorithm/Math/NumberTheory
- 多倍長整数
(algorithm/Math/NumberTheory/bigint.hpp)
- algorithm/Math/NumberTheory/bigint_utils.hpp
- 多倍長整数（16進数）
(algorithm/Math/NumberTheory/binary_bigint.hpp)
- 約数列挙
(algorithm/Math/NumberTheory/divisors.hpp)
- Extended Euclidean Algorithm（拡張ユークリッドの互除法）
(algorithm/Math/NumberTheory/extgcd.hpp)
- Greatest Common Divisor（最大公約数）
(algorithm/Math/NumberTheory/greatest_common_divisor.hpp)
- 素数判定
(algorithm/Math/NumberTheory/is_prime.hpp)
- Least Common Multiple（最小公倍数）
(algorithm/Math/NumberTheory/least_common_multiple.hpp)
- 線形篩
(algorithm/Math/NumberTheory/linear_sieve.hpp)
- 素因数分解
(algorithm/Math/NumberTheory/prime_factorize.hpp)
- 区間篩
(algorithm/Math/NumberTheory/segment_sieve.hpp)
- Sieve of Eratosthenes（エラトステネスの篩）
(algorithm/Math/NumberTheory/sieve.hpp)
- Euler's Totient Function（オイラーのトーシェント関数）
(algorithm/Math/NumberTheory/totient.hpp)
algorithm/Others
- Binary Search（二分探索）
(algorithm/Others/binary_search.hpp)
- 座標圧縮
(algorithm/Others/compress.hpp)
- 二次元いもす法
(algorithm/Others/imos_2d.hpp)
- Interval Set（区間をsetで管理するデータ構造）
(algorithm/Others/interval_set.hpp)
- 最大長方形問題
(algorithm/Others/largest_rectangle.hpp)
- Longest Increasing Subsequence（最長増加部分列）
(algorithm/Others/longest_increasing_subsequence.hpp)
- Mo's Algorithm（クエリ平方分割）
(algorithm/Others/mo_algorithm.hpp)
- Population Count (popcount)
(algorithm/Others/popcount.hpp)
algorithm/String
- Edit Distance（編集距離）
(algorithm/String/edit_distance.hpp)
- Longest Common Subsequence（最長共通部分列）
(algorithm/String/longest_common_subsequence.hpp)
- Manacher's Algorithm（最長回文）
(algorithm/String/manacher.hpp)
- 文字列分割
(algorithm/String/trie.hpp)
- Z algorithm（最長共通接頭辞）
(algorithm/String/z_algorithm.hpp)
algorithm/Utils
- 値の変換を行うユーティリティライブラリ
(algorithm/Utils/convert.hpp)
- デバッグ用関数形式マクロ
(algorithm/Utils/debug.hpp)
- グリッド問題に関連するユーティリティライブラリ
(algorithm/Utils/grid.hpp)
- My Template
(algorithm/Utils/my_template.hpp)
- algorithm/Utils/random.hpp
- 文字列分割
(algorithm/Utils/split.hpp)
- 多次元配列生成
(algorithm/Utils/table.hpp)
- 処理時間計測クラス
(algorithm/Utils/timer.hpp)
algorithm/internal
Verification Files
verify
- verify/aoj-0425-mo_algorithm.test.cpp
- verify/aoj-1276-linear_sieve.test.cpp
- verify/aoj-2842-binary_indexed_tree_2d.test.cpp
- verify/aoj-2880-interval_set.test.cpp
- verify/aoj-ALDS1_10_A-kitamasa.test.cpp
- verify/aoj-ALDS1_10_C-longest_common_subsequence.test.cpp
- verify/aoj-ALDS1_12_A.test.cpp
- verify/aoj-ALDS1_1_C-is_prime.test.cpp
- verify/aoj-ALDS1_1_C-linear_sieve.test.cpp
- verify/aoj-ALDS1_1_C-sieve.test.cpp
- verify/aoj-ALDS1_4_B-binary_search.test.cpp
- verify/aoj-ALDS1_9_C-binary_heap.test.cpp
- verify/aoj-DPL_1_D-longest_increasing_subsequence.test.cpp
- verify/aoj-DPL_1_E-edit_distance.test.cpp
- verify/aoj-DPL_3_B-largest_rectangle.test.cpp
- verify/aoj-DPL_3_C-largest_rectangle.test.cpp
- verify/aoj-DSL_1_A-union_find.test.cpp
- verify/aoj-DSL_1_B-potentialized_union_find.test.cpp
- verify/aoj-DSL_2_A-dynamic_segment_tree.test.cpp
- verify/aoj-DSL_2_A-segment_tree.test.cpp
- verify/aoj-DSL_2_B-binary_indexed_tree.test.cpp
- verify/aoj-DSL_2_B-binary_trie.test.cpp
- verify/aoj-DSL_2_B-dynamic_segment_tree.test.cpp
- verify/aoj-DSL_2_B-segment_tree.test.cpp
- verify/aoj-DSL_2_F-lazy_segment_tree.test.cpp
- verify/aoj-DSL_2_G-lazy_segment_tree.test.cpp
- verify/aoj-DSL_2_H-lazy_segment_tree.test.cpp
- verify/aoj-DSL_2_I-lazy_segment_tree.test.cpp
- verify/aoj-DSL_4_A-imos_2d.test.cpp
- verify/aoj-GRL_1_A-dijkstra.test.cpp
- verify/aoj-GRL_1_B-bellman_ford.test.cpp
- verify/aoj-GRL_3_A-low_link.test.cpp
- verify/aoj-GRL_3_B-low_link.test.cpp
- verify/aoj-GRL_3_C-strongly_connected_components.test.cpp
- verify/aoj-GRL_5_A-double_sweep.test.cpp
- verify/aoj-GRL_5_C-lowest_common_ancestor.test.cpp
- verify/aoj-GRL_6_A-dinic.test.cpp
- verify/aoj-GRL_6_A-ford_fulkerson.test.cpp
- verify/aoj-GRL_6_B-primal_dual.test.cpp
- verify/aoj-ITP1_10_A-isqrt.test.cpp
- verify/aoj-ITP1_10_D-nth_root.test.cpp
- verify/aoj-ITP1_1_A-discrete_fourier_transform.test.cpp
- verify/aoj-ITP1_1_A-fast_fourier_transform.test.cpp
- verify/aoj-ITP1_1_A-popcount.test.cpp
- verify/aoj-ITP1_3_D-divisors.test.cpp
- verify/aoj-NTL_1_A-prime_factorize.test.cpp
- verify/aoj-NTL_1_B-mod_pow.test.cpp
- verify/aoj-NTL_1_C-least_common_multiple.test.cpp
- verify/aoj-NTL_1_E-extgcd.test.cpp
- verify/aoj-NTL_2_A-bigint.test.cpp
- verify/aoj-NTL_2_B-bigint.test.cpp
- verify/aoj-NTL_2_C-bigint.test.cpp
- verify/aoj-NTL_2_D-bigint.test.cpp
- verify/aoj-NTL_2_E-bigint.test.cpp
- verify/yosupo-addition_of_big_integers-bigint.test.cpp
- verify/yosupo-addition_of_hex_big_integers-binary_bigint.test.cpp
- verify/yosupo-convolution_mod-number_theoretic_transform.test.cpp
- verify/yosupo-enumerate_palindromes-manacher.test.cpp
- verify/yosupo-longest_increasing_subsequence-longest_increasing_subsequence.test.cpp
- verify/yosupo-persistent_unionfind-rollback_union_find.test.cpp
- verify/yosupo-point_add_range_sum-binary_indexed_tree.test.cpp
- verify/yosupo-point_add_range_sum-segment_tree.test.cpp
- verify/yosupo-point_set_range_composite-segment_tree.test.cpp
- verify/yosupo-range_affine_range_sum-lazy_segment_tree.test.cpp
- verify/yosupo-scc-strongly_connected_components.test.cpp
- verify/yosupo-set_xor_min-binary_trie.test.cpp
- verify/yosupo-staticrmp-sparse_table.test.cpp
- verify/yosupo-tree_diameter-double_sweep.test.cpp
- verify/yosupo-vertex_add_path_sum-heavy_light_decomposition.test.cpp
- verify/yosupo-vertex_add_subtree_sum-heavy_light_decomposition.test.cpp
- verify/yosupo-zalgorithm-z_algorithm.test.cpp
- verify/yuki-117-combination.test.cpp