cplib-cpp
This documentation is automatically generated by online-judge-tools/verification-helper
cplib-cpp
Library Files
combinatorial_opt
combinatorial_opt/basepolyhedron.hpp
引数総和に関する等式制約下の互いに独立な一引数離散凸関数和の最小化
(combinatorial_opt/convex_sum.hpp)
- Edge disjoint minimum spanning forests （無向グラフにおける最大辺数最小重みの辺素な二つの全域森）
(combinatorial_opt/edge_disjoint_min_spanning_forests.hpp)
- Linear matroid parity (unweighted) （線形マトロイドパリティ）
(combinatorial_opt/linear_matroid_parity.hpp)
- Linear sum assignment problem, Hungarian algorithm （割当問題に対するハンガリアン法）
(combinatorial_opt/linear_sum_assignment.hpp)
- (Weighted) matroid intersection （（重みつき）マトロイド交叉）
(combinatorial_opt/matroid_intersection.hpp)
- Weighted matroid intersection using Dijkstra's algorithm
(combinatorial_opt/matroid_intersection_dijkstra.hpp)
- Matroid union （マトロイドの合併）
(combinatorial_opt/matroid_union.hpp)
- Simplex method （単体法）
(combinatorial_opt/simplex.hpp)
combinatorial_opt/matroids
- Binary matroid （二値マトロイド）
(combinatorial_opt/matroids/binary_matroid.hpp)
- Graphic matroid （グラフマトロイド）
(combinatorial_opt/matroids/graphic_matroid.hpp)
- マトロイドクラスのインターフェースの説明
(combinatorial_opt/matroids/matroid_example.hpp)
- Partition matroid （分割マトロイド）
(combinatorial_opt/matroids/partition_matroid.hpp)
- Transversal matroid （横断マトロイド）
(combinatorial_opt/matroids/transversal_matroid.hpp)
combinatorics
convex_hull_trick
- convex_hull_trick/add-get-monotone_cht.hpp
- convex_hull_trick/add-monotone_cht.hpp
- convex_hull_trick/convex_hull_trick.hpp
- Li-Chao tree
(convex_hull_trick/li_chao_tree.hpp)
convolution
- Convolution on rooted tree （根付き木上の畳み込み）
(convolution/convolution_on_tree.hpp)
- convolution/convolutive_translation_2d.hpp
- convolution/fft_arbitrary_mod.hpp
- convolution/fft_double.hpp
- convolution/hadamard.hpp
- Multivariate linear convolution （多変数線形畳み込み）
(convolution/multivar_ntt.hpp)
- convolution/ntt.hpp
- Relaxed multiplication / relaxed convolution （オンライン畳み込み）
(convolution/relaxed_multiplication.hpp)
- Semi-relaxed multiplication / semi-relaxed convolution （片方先読み可能な場合のオンライン畳み込み）
(convolution/semirelaxed_multiplication.hpp)
data_structure
- Area of union of rectangles （2 次元平面上の長方形たちが覆う面積）
(data_structure/area_of_union_of_rectangles.hpp)
- Binary trie
(data_structure/binary_trie.hpp)
- Fast set of integers （64分木で整数集合を高速に処理するデータ構造）
(data_structure/fast_set.hpp)
- data_structure/fibonacci_heap.hpp
- k-d tree (2D)
(data_structure/kd_tree_2d.hpp)
- Randomized binary search tree with lazy propagation
(data_structure/lazy_rbst.hpp)
- data_structure/light_forward_list.hpp
- Link-Cut tree
(data_structure/link_cut_tree.hpp)
- Offline dynamic connectivity
(data_structure/offline_dynamic_connectivity.hpp)
- data_structure/persistent_array.hpp
- data_structure/persistent_queue.hpp
- Radix heap （基数ヒープ）
(data_structure/radix_heap.hpp)
- Array-like radix heap with decrease query（chmin 操作が可能な基数ヒープ）
(data_structure/radix_heap_array.hpp)
- data_structure/range_kth_smallest_offline.hpp
- Static rectangle add rectangle sum （矩形一様加算・矩形総和取得）
(data_structure/rectangle_add_rectangle_sum.hpp)
- data_structure/rectangle_sum.hpp
- data_structure/sliding_window_aggregation.hpp
- data_structure/static_range_inversion.hpp
- Static top tree
(data_structure/static_toptree.hpp)
- Wavelet matrix （ウェーブレット行列）
(data_structure/wavelet_matrix.hpp)
flow
- flow/b-flow.hpp
- flow/maxflow.hpp
- Maxflow with lower bound （流量下限付き最大流）
(flow/maxflow_lowerbound.hpp)
- Maxflow (push-relabel, Goldberg & Tarjan) （Push-relabel による最大流）
(flow/maxflow_pushrelabel.hpp)
- Minimum cost flow (cost scaling, Goldberg & Tarjan) （コストスケーリングによる最小費用流）
(flow/mcf_costscaling.hpp)
- Minimum cost flow (primal-dual, based on AC Library)
(flow/mincostflow.hpp)
- Minimum cost flow without negative cycle （負辺ループなしの最小費用流）
(flow/mincostflow_nonegativeloop.hpp)
- Network simplex method （ネットワーク単体法，based on LEMON）
(flow/networksimplex.hpp)
- Submodular function optimization via graph cut （最小カット帰着による劣モジュラ関数の最小化）
(flow/submodular_optimization_via_graph_cut.hpp)
formal_power_series
- 線形漸化式に関する高速計算（Bostan-Mori algorithm）
(formal_power_series/coeff_of_rational_function.hpp)
- factorial power （階乗冪に関する演算）
(formal_power_series/factorial_power.hpp)
- f(x)g(x) = 1 (mod x^deg)
(formal_power_series/formal_power_series.hpp)
- Lagrange interpolation（多項式の Lagrange 補間）
(formal_power_series/lagrange_interpolation.hpp)
- 線形漸化式の発見・第 $N$ 項推定
(formal_power_series/linear_recurrence.hpp)
- formal_power_series/multipoint_evaluation.hpp
- formal_power_series/polynomial_divmod.hpp
- Power of sparse formal power series （非零な項が疎な形式的冪級数の累乗）
(formal_power_series/pow_of_sparse_fps.hpp)
- Sum of exponential times polynomial ($\sum_{i=0}^{N - 1} r^i f(i)$)
(formal_power_series/sum_of_exponential_times_polynomial.hpp)
- Sum of exponential times polynomial limit ($\sum_{i=0}^\infty r^i f(i)$)
(formal_power_series/sum_of_exponential_times_polynomial_limit.hpp)
.
geometry
- geometry/geometry.hpp
- geometry/point2d_w_error.hpp
- geometry/point3d.hpp
- geometry/problem_of_apollonius.hpp
- geometry/sort_by_argument.hpp
- geometry/triangle.hpp
graph
- Bipartite matching (Hopcroft–Karp)
(graph/bipartite_matching.hpp)
- Chromatic number of undirected graph （無向グラフの彩色数）
(graph/chromatic_number.hpp)
- graph/directed_mst.hpp
- Dulmage–Mendelsohn decomposition （DM 分解）
(graph/dulmage_mendelsohn_decomposition.hpp)
- Enumerate cliques （グラフのクリーク全列挙）
(graph/enumerate_cliques.hpp)
- graph/eulerian_trail.hpp
- Extended block cut tree （Block cut tree の亜種）
(graph/extended_block_cut_trees.hpp)
- graph/general_matching.hpp
- graph/grid_graph_template.hpp
- graph/incremental_bridge_connectivity.hpp
- Incremental SCC （強連結成分）
(graph/incremental_scc.hpp)
- Lowlink （無向グラフの DFS tree, lowlink, 橋・二重辺連結成分・関節点・二重頂点連結成分）
(graph/lowlink.hpp)
- Manhattan MST （二次元平面上の頂点たちのマンハッタン距離による最小全域木構成）
(graph/manhattan_mst.hpp)
- Max weight independent set （重み最大独立集合）
(graph/max_weight_independent_set.hpp)
- Maximum independent set （最大独立集合）
(graph/maximum_independent_set.hpp)
- Minimum Steiner tree （最小シュタイナー木）
(graph/minimum_steiner_tree.hpp)
- Shortest Non-zero Path in Group-Labeled Graphs （無向グラフの群ラベル制約付き最短路）
(graph/nonzero_path_of_group_labeled_graph.hpp)
- 無向グラフの長さ 2 のパスへの分解
(graph/paths_of_length_two_decomposition.hpp)
- graph/segment_edge_shortest_path.hpp
- graph/shortest_cycle.hpp
- graph/shortest_cycle01.hpp
- Shortest Path （単一始点最短路）
(graph/shortest_path.hpp)
- graph/strongly_connected_components.hpp
- graph/strongly_connected_components_bitset.hpp
heuristic
- Fast sampler of exponential distribution （高速指数分布サンプラー・擬似焼きなまし法の遷移判定）
(heuristic/exponential_dist_sampler.hpp)
- Multivariate Gaussian Distribution, Kalman filter / 多変量正規分布・カルマンフィルタ
(heuristic/multivariate_gaussian.hpp)
linear_algebra_matrix
- Black box linear algebra を利用した各種高速計算
(linear_algebra_matrix/blackbox_algorithm.hpp)
- Black box linear algebra のための行列
(linear_algebra_matrix/blackbox_matrices.hpp)
- Characteristic polynomial （行列の特性多項式）
(linear_algebra_matrix/characteristic_poly.hpp)
- linear_algebra_matrix/circular_binary_expansion.hpp
- Determinant of $M_0 + M_1 x$ （各要素が高々 $1$ 次の行列の行列式）
(linear_algebra_matrix/determinant_of_first_degree_poly_mat.hpp)
- $\mathbb{F}_{2}$ linear space ($\mathbb{F}_{2}$ 線形空間)
(linear_algebra_matrix/f2_linear_space.hpp)
- Hafnian （行列のハフニアン，無向グラフの完全マッチングの数え上げ）
(linear_algebra_matrix/hafnian.hpp)
- Hessenberg reduction of matrix
(linear_algebra_matrix/hessenberg_reduction.hpp)
- Hessenberg linear system
(linear_algebra_matrix/hessenberg_system.hpp)
- Levinson recursion (Levinson-Durbin algorithm)
(linear_algebra_matrix/levinson.hpp)
- Linear algebra on $\mathbb{F}_{2}$ using std::bitset (std::bitset を使用した $\mathbb{F}_{2}$ 線形代数)
(linear_algebra_matrix/linalg_bitset.hpp)
- linear_algebra_matrix/linalg_longlong.hpp
- linear_algebra_matrix/matrix.hpp
- Pfaffian of skew-symmetric matrix （歪対称行列のパフィアン）
(linear_algebra_matrix/pfaffian.hpp)
- linear_algebra_matrix/system_of_linear_equations.hpp
multithread
number
- number/acl_modint.hpp
- Cumulative sum of arithmetic functions （数論的関数の累積和）
(number/arithmetic_cumsum.hpp)
- number/bare_mod_algebra.hpp
- number/big_combination_logarithm.hpp
- Binary GCD
(number/binary_gcd.hpp)
- number/bs_sieve.hpp
- Combination （${}_n \mathrm{C}_r \bmod{m}$，Lucas の定理の拡張）
(number/combination.hpp)
- Counting primes （素数の個数）
(number/count_primes.hpp)
- Cyclotomic polynomials （円分多項式）
(number/cyclotomic_polynomials.hpp)
- Discrete logarithm / Baby-step giant-step （離散対数問題）
(number/discrete_logarithm.hpp)
- Dual number （二重数）
(number/dual_number.hpp)
- Dyadic rational number （2進有理数）
(number/dyadic_rational.hpp)
- number/enumerate_partitions.hpp
- Euler's totient function（オイラーのトーシェント関数）
(number/euler_totient_phi.hpp)
- Integer factorization （素因数分解）
(number/factorize.hpp)
- Min-max semiring（(min, max) 半環）
(number/min_max_semiring.hpp)
- Min-plus semiring / tropical semiring（(min, +) 半環・トロピカル半環）
(number/min_plus_semiring.hpp)
- $\mathbb{F}_{2^{61} - 1}$ （ハッシュ用メルセンヌ素数 modint）
(number/modint_mersenne61.hpp)
- number/modint_runtime.hpp
- Nimber, Nim product （ニム数，$\mathbb{F}_{2^{64}}$）
(number/nimber.hpp)
- Primitive root modulo $n$ （原始根の発見）
(number/primitive_root.hpp)
- Rational approximation （有理数近似）
(number/rational_approximation.hpp)
- Linear sieve （線形篩）
(number/sieve.hpp)
- Stern–Brocot tree
(number/stern_brocot_tree.hpp)
- Zeta transform / Moebius transform （約数包除）
(number/zeta_moebius_transform.hpp)
other_algorithms
- Binary lifting / doubling （ダブリング）
(other_algorithms/binary_lifting.hpp)
- Binary search （二分探索）
(other_algorithms/bisect.hpp)
- Bounded knapsack problem (Pisinger's algorithm)
(other_algorithms/bounded_knapsack.hpp)
- other_algorithms/doubling.hpp
- Dual slope trick
(other_algorithms/dual_slope_trick.hpp)
- 無向グラフに含まれる三角形の列挙
(other_algorithms/enumerate_triangles.hpp)
- Mo's algorithm by Hilbert order （Hilbert order による区間クエリ平方分割）
(other_algorithms/hilbert_order_mos.hpp)
- 3D points to Hilbert order, used for Mo with update （3 次元空間の点の Hilbert order への変換， Mo's algorithm （「時空間 Mo」）への応用）
(other_algorithms/hilbert_order_mos_3d.hpp)
- Longest increasing subsequence （LIS, 最長増加部分列）
(other_algorithms/longest_increasing_subsequence.hpp)
- Monge checker
(other_algorithms/monge_checker.hpp)
- Shortest paths of DAG with Monge weights using $d = 1, \ldots, d_{\mathrm{max}}$ edges （Monge 重み DAG の使用辺数毎の最短路長列挙）
(other_algorithms/monge_d_edge_shortest_paths_enum.hpp)
- Shortest path of DAG with Monge weights （Monge 重みの DAG の最短路長・辺数上下限指定可能）
(other_algorithms/monge_shortest_path.hpp)
- Monotone minima （Monotone な行列の行最小値の効率的な探索）
(other_algorithms/monotone_minima.hpp)
- Mo's algorithm （区間クエリに関する平方分割テクニック）
(other_algorithms/mos_algorithm.hpp)
- Permutation tree （順列木）
(other_algorithms/permutation_tree.hpp)
- Slope trick （区分線形凸関数に関する特定の更新を高速に扱う手法）
(other_algorithms/slope_trick.hpp)
- Totally Monotone Matrix Searching (SMAWK), concave max-plus / min-plus convolution
(other_algorithms/smawk.hpp)
- Tree pop order optimization / "01 on Tree" （木の根から 2 次元ベクトルや 01 文字列などを pop する順列に関する最小化）
(other_algorithms/tree_pop_order_optimization.hpp)
random
- random/custom_hash.hpp
- random/rand_nondeterministic.hpp
- random/shuffle_container.hpp
- random/xorshift.hpp
rational
segmenttree
- Segment Tree Beats (based on atcoder::lazy_segtree)
(segmenttree/acl_beats.hpp)
- Lazy Segtree (based on atcoder::lazy_segtree)
(segmenttree/acl_lazysegtree.hpp)
- Segtree (based on atcoder::segtree)
(segmenttree/acl_segtree.hpp)
- Binary indexed tree / Fenwick tree （BIT・フェニック木）
(segmenttree/binary_indexed_tree.hpp)
- segmenttree/binary_indexed_tree_2d.hpp
- Merge sort tree （静的な列の部分列に含まれる閾値以下の要素数クエリ）
(segmenttree/merge_sort_tree.hpp)
- segmenttree/point-update-range-get_nonrecursive.hpp
- Range Add Range Min (known as the Starry sky tree)
(segmenttree/range-add-range-min.hpp)
- segmenttree/range_minimum_query.hpp
- Range Tree （領域木）
(segmenttree/rangetree.hpp)
- Range Tree with binary indexed tree （領域木）
(segmenttree/rangetree_bit.hpp)
segmenttree/trees
- segmenttree/trees/acl_range-add-chmax-range-min.hpp
- segmenttree/trees/acl_range-add-chmax-range-sum.hpp
- segmenttree/trees/acl_range-affine-range-sum.hpp
- segmenttree/trees/acl_range-bitwiseandor-range-max.hpp
- segmenttree/trees/acl_range-update-gcd-range-max-sum.hpp
- segmenttree/trees/acl_range-update-range-sum-min.hpp
set_power_series
sparse_table
- Disjoint sparse table
(sparse_table/disjoint_sparse_table.hpp)
- sparse_table/rmq_sparse_table.hpp
- Sparse table
(sparse_table/sparse_table.hpp)
- 2D sparse table
(sparse_table/sparse_table_2d.hpp)
string
- string/aho_corasick.hpp
- string/aho_corasick_online.hpp
- string/incremental_matching.hpp
- string/longest_common_prefix.hpp
- Lyndon words （Lyndon 文字列に関する各種関数）
(string/lyndon.hpp)
- Longest palindromic substring enumeration (Manacher's algorithm) （回文長配列構築）
(string/manacher.hpp)
- string/mp_algorithm.hpp
- Palindromic tree / eertree （回文木）
(string/palindromic_tree.hpp)
- Rolling hash (one dimensional) （一次元ローリングハッシュ）
(string/rolling_hash_1d.hpp)
- Rolling hash (two dimensional) （二次元ローリングハッシュ）
(string/rolling_hash_2d.hpp)
- string/suffix_array.hpp
- string/suffix_array_doubling.hpp
- string/trie_light.hpp
- string/z_algorithm.hpp
syntactic_analysis
tree
- LCA-based auxiliary tree / virtual tree, online （"虚树"）
(tree/auxiliary_tree.hpp)
- Cartesian tree
(tree/cartesian_tree.hpp)
- Centroid decomposition （森の重心分解）
(tree/centroid_decomposition.hpp)
- Tree diameter （木の直径）
(tree/diameter.hpp)
- Euler tour （木のオイラーツアー）
(tree/euler_tour.hpp)
- Frequency table of tree distance
(tree/frequency_table_of_tree_distance.hpp)
- Guni (Sack) / DSU on tree （根付き木の全ての部分木を経由するような頂点追加・削除操作列の生成）
(tree/guni.hpp)
- Heavy-light decomposition （HLD, 木の重軽分解）
(tree/heavy_light_decomposition.hpp)
- Lowest common ancestor of tree based on sparse table （クエリ $O(1)$ の最小共通祖先）
(tree/lca_rmq.hpp)
- Lowest common ancestor （最小共通祖先）
(tree/lowest_common_ancestor.hpp)
- Preorder tree DFS （木の行きがけ順 DFS）
(tree/preorder_tree_dfs.hpp)
- Rerooting （全方位木 DP）
(tree/rerooting.hpp)
- Tree isomrphism （木の同型判定）
(tree/tree_isomorphism.hpp)
tsp
- tsp/calc_lkh_alpha.hpp
- tsp/csr_distance_matrix.hpp
- tsp/dense_distance_matrix.hpp
- tsp/held_karp.hpp
- tsp/minimum_one_tree.hpp
- tsp/mst_edges.hpp
- Symmetric traveling salesperson problem （Symmetric TSP, 対称巡回セールスマン問題）
(tsp/symmetric_tsp.hpp)
unionfind
- unionfind/fully_persistent_uf.hpp
- unionfind/grid_unionfind.hpp
- unionfind/partially_persistent_uf.hpp
- Potentialized UnionFind （重み付き UnionFind）
(unionfind/potentialized_unionfind.hpp)
- UnionFind with Undo operation, monoid weights （Undo 可能・重み和取得可能 UnionFind）
(unionfind/undo_monoid_unionfind.hpp)
- UnionFind with Undo operation （Undo 可能 UnionFind）
(unionfind/undo_unionfind.hpp)
- unionfind/unionfind.hpp
utilities
- floor sum
(utilities/floor_sum.hpp)
- utilities/gnu_pbds.hpp
- groupby
(utilities/groupby.hpp)
- int128
(utilities/int128.hpp)
- utilities/int_kth_root.hpp
- utilities/integer_segments.hpp
- Sum of $k$-th powers of first $n$ positive integers （自然数の $k$ 乗和）
(utilities/kth_power_sum.hpp)
- utilities/momentum_deque.hpp
- Multidimensional index
(utilities/multidim_index.hpp)
- utilities/multiprecision_int.hpp
- utilities/next_combination.hpp
- Offline sum of linear segments （区間一次関数加算クエリの累積和を用いたオフライン処理）
(utilities/offline_sum_of_linear.hpp)
- Power （累乗）
(utilities/pow.hpp)
- Power (general monoid)
(utilities/pow_op.hpp)
- power sum （累乗和）
(utilities/pow_sum.hpp)
- Static range product query with precalculation （前計算埋め込み）
(utilities/product_embedding.hpp)
- utilities/quadratic_solver.hpp
- Quotients of integer （商列挙）
(utilities/quotients.hpp)
- 高速標準入力
(utilities/reader.hpp)
- 一行入力
(utilities/readline.hpp)
- utilities/rotate90.hpp
- Run length encoding （ランレングス圧縮，連長圧縮）
(utilities/run_length_encoding.hpp)
- 非再帰セグメント木で区間に対応する頂点番号の列挙
(utilities/segtree_range_covering_nodes.hpp)
- utilities/timer.hpp
- utilities/transpose.hpp
- 標準出力
(utilities/writer.hpp)
- XOR of interval
(utilities/xor_of_interval.hpp)
Verification Files
combinatorial_opt/test
- combinatorial_opt/test/convex_sum.test.cpp
- combinatorial_opt/test/linear_matroid_parity.yuki1773.test.cpp
- combinatorial_opt/test/linear_matroid_parity_size.yuki1773.test.cpp
- combinatorial_opt/test/linear_sum_assignment.aoj1163.test.cpp
- combinatorial_opt/test/linear_sum_assignment.test.cpp
- combinatorial_opt/test/matroid_intersection.aoj1605.test.cpp
- combinatorial_opt/test/matroid_intersection.aoj_grl_2_b.test.cpp
- combinatorial_opt/test/matroid_intersection_dijkstra.aoj1605.test.cpp
- combinatorial_opt/test/matroid_intersection_dijkstra.aoj_grl_2_b.test.cpp
- combinatorial_opt/test/simplex.easy.test.cpp
- combinatorial_opt/test/simplex.maxflow.test.cpp
- combinatorial_opt/test/simplex.mcf.test.cpp
- combinatorial_opt/test/simplex.multiprecision.test.cpp
- combinatorial_opt/test/simplex.shortestpath.test.cpp
combinatorics/test
convex_hull_trick/test
convolution/test
- convolution/test/bitwise_and_conv.test.cpp
- convolution/test/bitwise_xor_conv.test.cpp
- convolution/test/convolution_on_tree.test.cpp
- convolution/test/hadamard_xor.test.cpp
- convolution/test/multivar_ntt.test.cpp
- convolution/test/ntt.test.cpp
- convolution/test/ntt_arbitrary_mod.test.cpp
- convolution/test/relaxed_multiplication.exp.test.cpp
- convolution/test/relaxed_multiplication.test.cpp
- convolution/test/semirelaxed_multiplication.test.cpp
data_structure/test
- data_structure/test/area_of_union_of_rectangles.test.cpp
- data_structure/test/assosiative_array.test.cpp
- data_structure/test/binary_trie.test.cpp
- data_structure/test/binary_trie.yuki2977.test.cpp
- data_structure/test/dynamic_graph_vertex_add_component_sum.test.cpp
- data_structure/test/fast_set.test.cpp
- data_structure/test/fibonacci_heap_dijkstra.test.cpp
- data_structure/test/fibonacci_heap_shortestpath.test.cpp
- data_structure/test/fibonacci_heap_spanningtree.test.cpp
- data_structure/test/lazy_rbst.stress.test.cpp
- data_structure/test/lazy_rbst.test.cpp
- data_structure/test/link_cut_tree.aoj2450.test.cpp
- data_structure/test/link_cut_tree.composition.test.cpp
- data_structure/test/link_cut_tree.noncommutative.stress.test.cpp
- data_structure/test/link_cut_tree.noncommutative2.stress.test.cpp
- data_structure/test/link_cut_tree.pathadd.stress.test.cpp
- data_structure/test/link_cut_tree.sum.test.cpp
- data_structure/test/persistent_queue.test.cpp
- data_structure/test/queue_operate_all_composite.test.cpp
- data_structure/test/radix_heap.dijkstra.test.cpp
- data_structure/test/radix_heap_array.dijkstra.test.cpp
- data_structure/test/range_kth_smallest_offline.test.cpp
- data_structure/test/rectangle_add_rectangle_sum.point.test.cpp
- data_structure/test/rectangle_add_rectangle_sum.test.cpp
- data_structure/test/rectangle_sum.test.cpp
- data_structure/test/static_range_inversion.test.cpp
- data_structure/test/static_toptree.test.cpp
- data_structure/test/wavelet_matrix.yuki3207.test.cpp
- data_structure/test/wavelet_matrix_point_add_rectangle_sum.test.cpp
- data_structure/test/wavelet_matrix_range_sum_upper_bound.test.cpp
- data_structure/test/wavelet_matrix_rectangle_sum.test.cpp
flow/test
- flow/test/assignment_problem.test.cpp
- flow/test/b_flow.test.cpp
- flow/test/bflow_ns.test.cpp
- flow/test/maxflow.pushrelabel.test.cpp
- flow/test/maxflow.pushrelabel.yuki957.test.cpp
- flow/test/maxflow.test.cpp
- flow/test/mcf_costscaling.bflow.test.cpp
- flow/test/mcf_costscaling.test.cpp
- flow/test/mcf_costscaling.yuki1615.test.cpp
- flow/test/mcf_ns.test.cpp
- flow/test/mincostflow.test.cpp
- flow/test/mincostflow.yuki1288.test.cpp
- flow/test/mincostflow.yuki1324.test.cpp
- flow/test/submodular_opt.aoj2496.test.cpp
- flow/test/submodular_opt.aoj2903.test.cpp
- flow/test/submodular_opt.aoj2943.test.cpp
- flow/test/submodular_opt.aoj3058.test.cpp
- flow/test/submodular_opt.yuki119.test.cpp
- flow/test/submodular_opt.yuki1479.test.cpp
- flow/test/submodular_opt.yuki1541.test.cpp
- flow/test/submodular_opt.yuki1900.test.cpp
- flow/test/submodular_opt.yuki1984.test.cpp
- flow/test/submodular_opt.yuki2320.test.cpp
- flow/test/submodular_opt.yuki2713.test.cpp
- flow/test/submodular_opt.yuki3201.test.cpp
- flow/test/submodular_opt.yuki957.test.cpp
formal_power_series/test
- formal_power_series/test/bernoulli_number.test.cpp
- formal_power_series/test/coeff_of_rational_function.test.cpp
- formal_power_series/test/division_number.test.cpp
- formal_power_series/test/factorial_power.stirling_number_of_2nd.test.cpp
- formal_power_series/test/fps_exp.test.cpp
- formal_power_series/test/fps_exp_modintruntime.test.cpp
- formal_power_series/test/fps_inv.test.cpp
- formal_power_series/test/fps_log.test.cpp
- formal_power_series/test/fps_pow.test.cpp
- formal_power_series/test/fps_sqrt.test.cpp
- formal_power_series/test/fps_sqrt_modintruntime.test.cpp
- formal_power_series/test/kitamasa.test.cpp
- formal_power_series/test/kth_term_of_linearly_recurrent_sequence.test.cpp
- formal_power_series/test/linear_recurrence.test.cpp
- formal_power_series/test/multipoint_evaluation.test.cpp
- formal_power_series/test/poly_taylor_shift.test.cpp
- formal_power_series/test/polynomial_divmod.test.cpp
- formal_power_series/test/polynomial_interpolation.test.cpp
- formal_power_series/test/pow_of_sparse_fps.stress.test.cpp
- formal_power_series/test/pow_of_sparse_fps.yuki1939.test.cpp
- formal_power_series/test/sharp_p_subset_sum.test.cpp
- formal_power_series/test/shift_of_sampling_points.test.cpp
- formal_power_series/test/stirling_number_of_1st.test.cpp
- formal_power_series/test/stirling_number_of_2nd.test.cpp
- formal_power_series/test/sum_of_exponential_times_polynomial.test.cpp
- formal_power_series/test/sum_of_exponential_times_polynomial_limit.test.cpp
geometry/test
- geometry/test/circumcenter.test.cpp
- geometry/test/convex_cut.test.cpp
- geometry/test/convex_hull.test.cpp
- geometry/test/sort_by_argument.test.cpp
graph/test
- graph/test/2sat_solver.test.cpp
- graph/test/articulation_points.test.cpp
- graph/test/bellman_ford.test.cpp
- graph/test/biconnected_components.test.cpp
- graph/test/bipartite_matching.test.cpp
- graph/test/bridge.test.cpp
- graph/test/chromatic_number.test.cpp
- graph/test/cycle_detection_directed.test.cpp
- graph/test/directed_mst.aoj.test.cpp
- graph/test/dulmage_mendelsohn.yuki1615.test.cpp
- graph/test/dulmage_mendelsohn.yuki1744.test.cpp
- graph/test/dulmage_mendelsohn.yuki1745.test.cpp
- graph/test/enumerate_cliques.aoj2306.test.cpp
- graph/test/enumerate_cliques.test.cpp
- graph/test/extended_block_cut_trees.test.cpp
- graph/test/extended_block_cut_trees.yuki1326.test.cpp
- graph/test/general_matching.test.cpp
- graph/test/incremental-bridge-connectivity.test.cpp
- graph/test/manhattan_mst.test.cpp
- graph/test/max_weight_independent_set.aoj3519.test.cpp
- graph/test/max_weight_independent_set.lc.test.cpp
- graph/test/maximum_independent_set.test.cpp
- graph/test/minimum_steiner_tree.test.cpp
- graph/test/minimum_steiner_tree.yuki114.test.cpp
- graph/test/nonzero_path_of_group_labeled_graph.test.cpp
- graph/test/shortest_cycle.test.cpp
- graph/test/shortest_path.test.cpp
- graph/test/shortest_path_dag.test.cpp
- graph/test/shortest_path_dial.yuki160.test.cpp
- graph/test/shortest_path_dial.yuki1695.test.cpp
- graph/test/spfa.test.cpp
- graph/test/strongly_connected_components.test.cpp
- graph/test/strongly_connected_components_bitset.test.cpp
- graph/test/topological_sort.test.cpp
- graph/test/two-edge-connected-components.test.cpp
- graph/test/warshallfloyd.test.cpp
- graph/test/zero_one_bfs.yuki1695.test.cpp
linear_algebra_matrix/test
- linear_algebra_matrix/test/blackbox_matrix_stress.test.cpp
- linear_algebra_matrix/test/characteristic_poly.test.cpp
- linear_algebra_matrix/test/det_of_blackbox_matrix.test.cpp
- linear_algebra_matrix/test/determinant_arbitrary_mod.test.cpp
- linear_algebra_matrix/test/determinant_of_first_degree_poly_mat.yuki1907.test.cpp
- linear_algebra_matrix/test/f2_intersection.test.cpp
- linear_algebra_matrix/test/hafnian.test.cpp
- linear_algebra_matrix/test/hessenberg_system.stress.test.cpp
- linear_algebra_matrix/test/inverse_matrix.test.cpp
- linear_algebra_matrix/test/linalg_aclmodint_determinant.test.cpp
- linear_algebra_matrix/test/linalg_bitset.test.cpp
- linear_algebra_matrix/test/linalg_bitset.yuki1421.test.cpp
- linear_algebra_matrix/test/linalg_bitset_det.test.cpp
- linear_algebra_matrix/test/linalg_bitset_mul.test.cpp
- linear_algebra_matrix/test/linalg_ll_det.test.cpp
- linear_algebra_matrix/test/linalg_longlong.test.cpp
- linear_algebra_matrix/test/linalg_longlong_matmul.test.cpp
- linear_algebra_matrix/test/linalg_min_plus_semiring.yuki1780.test.cpp
- linear_algebra_matrix/test/linalg_modint_determinant.test.cpp
- linear_algebra_matrix/test/linalg_modint_multiplication.test.cpp
- linear_algebra_matrix/test/linalg_modint_pow.test.cpp
- linear_algebra_matrix/test/linalg_semirings.yuki1340.test.cpp
- linear_algebra_matrix/test/matrix_det_dual_number.yuki1303.test.cpp
- linear_algebra_matrix/test/matrix_determinant.test.cpp
- linear_algebra_matrix/test/matrix_pow.test.cpp
- linear_algebra_matrix/test/matrix_product.test.cpp
- linear_algebra_matrix/test/matrix_rank.test.cpp
- linear_algebra_matrix/test/matrix_rank.yuki1773.test.cpp
- linear_algebra_matrix/test/pfaffian.test.cpp
- linear_algebra_matrix/test/system_of_linear_equations.test.cpp
number/test
- number/test/arithmetic_function_totient.test.cpp
- number/test/binary_gcd.stress.test.cpp
- number/test/bs_sieve.test.cpp
- number/test/combination.stress.test.cpp
- number/test/combination.test.cpp
- number/test/count_primes.test.cpp
- number/test/discrete_logarithm_matrix.yuki3170.test.cpp
- number/test/discrete_logarithm_matrix.yuki950.test.cpp
- number/test/discrete_logarithm_mod.test.cpp
- number/test/discrete_logarithm_symmetric_group.yuki101.test.cpp
- number/test/discrete_logarithm_symmetric_group.yuki261.test.cpp
- number/test/enumerate_primes.test.cpp
- number/test/factorize_aoj.test.cpp
- number/test/factorize_longlong.test.cpp
- number/test/gcd_convolution.test.cpp
- number/test/gen_primes.test.cpp
- number/test/is_prime.test.cpp
- number/test/lcm_convolution.test.cpp
- number/test/miller-rabin-5e7.test.cpp
- number/test/miller-rabin.test.cpp
- number/test/min_max_semiring.test.cpp
- number/test/montmort_number_mod.test.cpp
- number/test/multiple_moebius.yuki1627.test.cpp
- number/test/multiple_moebius.yuki886.test.cpp
- number/test/nimber.test.cpp
- number/test/prime_factorization.test.cpp
- number/test/primitive_root.test.cpp
- number/test/primitive_root_1e18.test.cpp
- number/test/rational_approximation.test.cpp
- number/test/sieve.stress.test.cpp
- number/test/sqrt_modint_runtime.test.cpp
- number/test/stern_brocot_tree.test.cpp
- number/test/zeta_moebius_transform.test.cpp
other_algorithms/test
- other_algorithms/test/binary_lifting.yuki1013.test.cpp
- other_algorithms/test/bisect_yuki2352.test.cpp
- other_algorithms/test/concave_max_plus_convolution.test.cpp
- other_algorithms/test/concave_min_plus_convolution.test.cpp
- other_algorithms/test/dual_slope_trick.yuki2114.test.cpp
- other_algorithms/test/enumerate_triangles.test.cpp
- other_algorithms/test/longest_increasing_subsequence.test.cpp
- other_algorithms/test/monge_d_edge_shortest_paths_enum.yuki952.test.cpp
- other_algorithms/test/monge_shortest_path.yuki705.test.cpp
- other_algorithms/test/permutation_tree.yuki1720.test.cpp
- other_algorithms/test/slope_trick_stress.test.cpp
- other_algorithms/test/tree_pop_order_optimization.test.cpp
- other_algorithms/test/tree_pop_order_optimization.yuki3148.test.cpp
segmenttree/test
- segmenttree/test/acl_range-affine-range-sum.test.cpp
- segmenttree/test/acl_rmq.test.cpp
- segmenttree/test/acl_rsq.test.cpp
- segmenttree/test/beats.test.cpp
- segmenttree/test/beats_gcd.test.cpp
- segmenttree/test/beats_random_test.test.cpp
- segmenttree/test/beats_range-add-chmax-range-sum.test.cpp
- segmenttree/test/binary_indexed_tree.test.cpp
- segmenttree/test/countandsumlessthan.test.cpp
- segmenttree/test/merge_sort_tree.aoj2426.test.cpp
- segmenttree/test/point-add-range-sum.test.cpp
- segmenttree/test/point-set-range-composite.test.cpp
- segmenttree/test/point-update-range-min.test.cpp
- segmenttree/test/rangetree.test.cpp
- segmenttree/test/rangetree.yuki1625.test.cpp
- segmenttree/test/rangetree_bit.test.cpp
- segmenttree/test/rmq_nonrecursive.test.cpp
set_power_series/test
- set_power_series/test/subset_conv.test.cpp
- set_power_series/test/subset_exp.stress.test.cpp
- set_power_series/test/subset_exp.test.cpp
- set_power_series/test/subset_pow.stress.test.cpp
- set_power_series/test/subset_pow.yuki1594.test.cpp
sparse_table/test
- sparse_table/test/disjoint_sparse_table_rmq.test.cpp
- sparse_table/test/disjoint_sparse_table_rsq.test.cpp
- sparse_table/test/sparse_table.test.cpp
- sparse_table/test/sparse_table_2d.test.cpp
- sparse_table/test/sparse_table_aoj.test.cpp
string/test
- string/test/aho_corasick_forwardlist.test.cpp
- string/test/aho_corasick_online.test.cpp
- string/test/aho_corasick_unorderedmap.test.cpp
- string/test/aho_corasick_vector.test.cpp
- string/test/incremental_matching.test.cpp
- string/test/lcp.test.cpp
- string/test/lyndon.test.cpp
- string/test/manacher.test.cpp
- string/test/manacher_mp.test.cpp
- string/test/palindromic_tree.yuki2606.test.cpp
- string/test/palindromic_tree.yuki263.test.cpp
- string/test/rolling_hash.test.cpp
- string/test/rolling_hash_2d.aoj.test.cpp
- string/test/rolling_hash_lcp.test.cpp
- string/test/rolling_hash_mersenne61.test.cpp
- string/test/rolling_hash_w_modint.test.cpp
- string/test/run_enumerate_lyndon_hash.test.cpp
- string/test/run_enumerate_lyndon_mersenne61.test.cpp
- string/test/run_enumerate_lyndon_rmq.test.cpp
- string/test/sa_count_keyword.reader.test.cpp
- string/test/sa_count_keyword.test.cpp
- string/test/suffix_array.test.cpp
- string/test/z_algorithm.test.cpp
tree/test
- tree/test/auxiliary_tree.yuki901.test.cpp
- tree/test/cartesian_tree.test.cpp
- tree/test/diameter.test.cpp
- tree/test/frequency_table_of_tree_distance.stress.test.cpp
- tree/test/frequency_table_of_tree_distance.test.cpp
- tree/test/frequency_table_of_tree_distance_ntt.test.cpp
- tree/test/hl_decomposition.test.cpp
- tree/test/hld_subtree_query.test.cpp
- tree/test/jump_on_tree.test.cpp
- tree/test/jump_on_tree_hld.test.cpp
- tree/test/lca.test.cpp
- tree/test/lca.yuki898.test.cpp
- tree/test/lca_rmq.test.cpp
- tree/test/preorder_tree_dfs.test.cpp
- tree/test/rerooting.aoj1595.test.cpp
- tree/test/rerooting.yuki1718.test.cpp
- tree/test/subtree_isomorphism.lc.test.cpp
- tree/test/tree_isomorphism.aoj1613.test.cpp
- tree/test/vertex-add-path-sum.test.cpp
- tree/test/vertex-add-subtree-sum.guni.test.cpp
- tree/test/vertex-add-subtree-sum.test.cpp
- tree/test/vertex-set-path-composite.test.cpp
unionfind/test
- unionfind/test/fully_persistent_uf.test.cpp
- unionfind/test/potentialized_unionfind.aoj_dsl_1_b.test.cpp
- unionfind/test/potentialized_unionfind_F2.yuki1420.test.cpp
- unionfind/test/potentialized_unionfind_int.aoj3142.test.cpp
- unionfind/test/potentialized_unionfind_modint.test.cpp
- unionfind/test/unionfind.test.cpp
utilities/test
- utilities/test/floor_sum.test.cpp
- utilities/test/integer_segments.test.cpp
- utilities/test/kth_power_sum.yuki665.test.cpp
- utilities/test/kth_root_integer.test.cpp
- utilities/test/multidim_index.zeta.test.cpp
- utilities/test/pow.test.cpp
- utilities/test/pow_op.test.cpp
- utilities/test/predecessor_problem.test.cpp
- utilities/test/product_embedding.test.cpp
- utilities/test/quotients.test.cpp