軽量ライブラリ（64 KiB）

名前・ファイル名・関数名で検索できます。各ページの Bundle で依存ヘッダーを展開し、Copy でコピーできます。

Bit Vector やアロケータなど、主にライブラリ内部で使う部品は 補助部品 にまとめています。

ライブラリをコピーするボタンを押すと 1 行目に参照 URL を含むコメント行が自動で添付されるようになっています。

Codeforces などコード長制限が厳しいコンテスト向けに軽量版サイトを用意しています。詳細はサイズ制限と提出方法を参照してください。

設計をあまり練れていない・使い方がよく分かっていないアルゴリズムは一覧末尾の 応用ライブラリ にまとめています。

参照URLのコメントと依存ヘッダーを含め、全体サイトと同じ分類・項目順で掲載しています。64 KiB以内の実装がない項目は高速実装へリンクします。解答本体や複数ライブラリを合わせた提出コードは、合計サイズを確認してください。

352項目（補助部品を含む） · 軽量実装 328件

ライブラリを検索

変換

• Bitwise Zeta / Möbius Transformcomponents/bitwise_zeta.hpp
• Divisor Zeta / Möbius Transformcomponents/divisor_zeta.hpp
• FFTcomponents/fft.hpp
• NTT（998244353）（軽量版）components/fps_light_ntt.hpp
• NTT（法指定）components/ntt_mod.hpp
• Walsh–Hadamard Transformcomponents/walsh_hadamard.hpp

convolution

• AND・OR・XOR 畳み込みconvolution/bitwise_convolution.hpp
• AND-OR などの論理畳み込みconvolution/boolean_convolution.hpp
• 通常の畳み込み（軽量版）convolution/convolution_light.hpp
• 実数・複素数の畳み込みconvolution/convolution_fft.hpp
• 任意 mod・整数の畳み込みconvolution/convolution_mod.hpp
• 一般の環の畳み込みconvolution/convolution_ring.hpp
• 巡回・負巡回畳み込み（軽量版）convolution/cyclic_convolution_light.hpp
• GCD-plus・LCM-plus 畳み込みconvolution/gcd_lcm_convolution.hpp
• max-min・min-max 畳み込み（軽量版）convolution/max_min_convolution_light.hpp
• 凸・凹 min-plus / max-plus 畳み込みconvolution/min_plus_convolution.hpp
• 素数 mod 上の乗法畳み込み（軽量版）convolution/multiplicative_convolution_light.hpp
• 多変数の切り捨て畳み込み（軽量版）convolution/multivariate_convolution_light.hpp
• Online Convolution（軽量版）convolution/online_convolution_light.hpp
• i < j 制約付き畳み込み（軽量版）convolution/ordered_convolution_light.hpp
• Subset 畳み込みconvolution/subset_convolution.hpp
• 対称群上の畳み込みconvolution/symmetric_group_convolution.hpp

data_structure

• Dynamic Bitsetdata_structure/dynamic_bitset.hpp
• Fenwick Treedata_structure/fenwick_tree.hpp
• Flat Hash Mapdata_structure/flat_hash_map.hpp
• Interval Mapdata_structure/interval_map.hpp
• Interval Setdata_structure/interval_set.hpp
• Kd-tree（最近傍・矩形範囲検索）data_structure/kd_tree.hpp
• Lazy Reversible Treap（遅延伝搬・反転可能乱択平衡二分木）data_structure/lazy_reversible_treap.hpp
• 静的矩形和（クエリ先読み）data_structure/offline_rectangle_sum.hpp
• Priority Search Tree（三辺矩形内の点の列挙）data_structure/priority_search_tree.hpp
• Sliding Window Aggregationdata_structure/sliding_window_aggregation.hpp
• Slope Trickdata_structure/slope_trick.hpp
• Static Threshold Searchdata_structure/static_threshold_search.hpp
• Top K Sumdata_structure/top_k_sum.hpp
• XOR の最小値・最大値を求める整数集合data_structure/xor_set.hpp

data_structure/range_query

• Disjoint Sparse Tabledata_structure/disjoint_sparse_table.hpp
• Mo's Algorithmdata_structure/mo_order.hpp
• 更新付き Mo's Algorithmdata_structure/mo_with_updates.hpp
• 区間の異なる値の個数（クエリ一括処理）data_structure/offline_range_count_distinct.hpp
• 区間頻度（一点更新・クエリ一括処理）data_structure/offline_range_frequency.hpp
• 区間の k 番目の値（クエリ一括処理）data_structure/offline_range_kth_smallest.hpp
• 値の上限付き区間和（クエリ一括処理）data_structure/offline_range_sum.hpp
• 並列二分探索data_structure/parallel_binary_search.hpp
• Range LIS Query（区間の最長増加部分列）data_structure/range_lis_query.hpp
• Sparse Tabledata_structure/sparse_table.hpp
• 静的区間の転倒数data_structure/static_range_inversions.hpp

data_structure/segment_tree

• Dual Segment Treedata_structure/dual_segtree.hpp
• Dynamic Lazy Segtreedata_structure/dynamic_lazy_segtree.hpp
• Dynamic Segtreedata_structure/dynamic_segtree.hpp
• 遅延セグメント木data_structure/lazy_segtree.hpp
• 区間加算・区間最小値data_structure/range_add_range_min.hpp
• 区間アフィン変換・区間和data_structure/range_affine_range_sum.hpp
• Range Chmin Chmax Add Sumdata_structure/range_chmin_chmax_add_sum.hpp
• セグメント木data_structure/segtree.hpp
• Segtree Beatsdata_structure/segtree_beats.hpp
• Sortable Segtreedata_structure/sortable_segtree.hpp

data_structure/li_chao_tree

• Dynamic Li Chao Treedata_structure/dynamic_li_chao_tree.hpp
• Li Chao Tree (クエリ先読み)data_structure/li_chao_tree.hpp

data_structure/wavelet_matrix

• Dynamic Wavelet Matrix軽量実装なし · 高速実装はこちら
• Point Set Wavelet Matrix (クエリ先読み)data_structure/point_set_wavelet_matrix.hpp
• Wavelet Matrixdata_structure/wavelet_matrix.hpp
• Weighted Wavelet Matrixdata_structure/weighted_wavelet_matrix.hpp

data_structure/persistent

• 永続配列data_structure/persistent_array.hpp
• 永続 Deque・分割連結可能な列data_structure/persistent_deque.hpp
• 永続併合可能ヒープdata_structure/persistent_heap.hpp
• 永続遅延セグメント木data_structure/persistent_lazy_segtree.hpp
• 永続順序付き多重集合data_structure/persistent_multiset.hpp
• 永続キューdata_structure/persistent_queue.hpp
• 永続セグメント木data_structure/persistent_segtree.hpp
• 永続スタックdata_structure/persistent_stack.hpp
• 永続 Union Finddata_structure/persistent_union_find.hpp

data_structure/union_find

• Rollback Union Finddata_structure/rollback_union_find.hpp
• Union-Finddata_structure/union_find.hpp
• 重み付き Union-Finddata_structure/weighted_union_find.hpp

fps

• 線形漸化式の復元（Berlekamp–Massey）fps/berlekamp_massey.hpp
• Bostan–Mori（軽量版）fps/fps_light_algorithms.hpp
• 形式的冪級数の合成（軽量版）fps/compose_light.hpp
• 形式的冪級数の合成逆元（軽量版）fps/compositional_inverse_light.hpp
• 形式的冪級数（軽量版）fps/fps_light.hpp
• 多項式補間（軽量版）fps/fps_light_algorithms.hpp
• 線形漸化式の第 k 項（軽量版）fps/fps_light_algorithms.hpp
• 多点評価（軽量版）fps/fps_light_algorithms.hpp
• 多項式 GCD（軽量版）fps/polynomial_gcd_light.hpp
• Power Projection（軽量版）fps/power_projection_light.hpp
• 有理 FPS の区間係数取得（軽量版）fps/rational_fps_coefficients_light.hpp
• Taylor Shift（軽量版）fps/fps_light_algorithms.hpp

geometry

• 円・接線・最小包含円geometry/circle.hpp
• 凸包・凸多角形・最近点対・最遠点対geometry/convex.hpp
• Dynamic Convex Hull（点追加）geometry/dynamic_convex_hull.hpp
• 平面幾何geometry/geometry.hpp
• 幾何の直線・線分geometry/linear.hpp
• 幾何の点・ベクトル・偏角順geometry/point.hpp
• 多角形の面積・内外判定・切断geometry/polygon.hpp

graph

• 有向・無向 Euler 路graph/eulerian_trail.hpp
• Functional Graphgraph/functional_graph.hpp
• Kruskal（最小全域木）graph/kruskal.hpp
• 区間辺グラフgraph/range_edge_graph.hpp
• 最小シュタイナー木graph/steiner_tree.hpp
• トポロジカルソートgraph/topological_sort.hpp
• 2-SATgraph/two_sat.hpp

graph/shortest_path

• Bellman-Fordgraph/bellman_ford.hpp
• 牛ゲー（差分制約系）graph/difference_constraints.hpp
• Dijkstragraph/dijkstra.hpp
• K Shortest Walkgraph/k_shortest_walk.hpp
• Monge グラフの d 辺最短路graph/monge_d_edge_shortest_path.hpp
• ワーシャルフロイド法graph/warshall_floyd.hpp

graph/matching

• 二部グラフ（自動色分け）graph/bipartite_graph.hpp
• 二部マッチングgraph/bipartite_matching.hpp
• General Matching（一般グラフ最大マッチング）graph/general_matching.hpp
• General Weighted Matching（一般グラフ最大重みマッチング）graph/general_weighted_matching.hpp
• Hungarian Algorithm（ハンガリアン法）graph/hungarian.hpp

graph/connectivity

• Block Cut Treegraph/block_cut_tree.hpp
• Online Dynamic Connectivitygraph/dynamic_connectivity.hpp
• Low-Linkgraph/low_link.hpp
• Offline Dynamic Connectivity（クエリ先読み）graph/offline_dynamic_connectivity.hpp
• 強連結成分分解graph/scc.hpp
• 二辺連結成分分解graph/two_edge_connected_components.hpp

graph/flow

• 最大流graph/max_flow.hpp
• 最小費用流graph/min_cost_flow.hpp
• Project Selection（燃やす埋める）graph/project_selection.hpp

math

• 多倍長整数math/bigint.hpp
• 有理数（Fraction）math/fraction.hpp
• modint998244353math/mint.hpp
• 任意の法の modintmath/modint.hpp

math/combinatorics

• 任意 mod の二項係数math/binomial_mod.hpp
• 二項係数の prefix sum（軽量版）math/binomial_prefix_sum_light.hpp
• 二項係数の prefix sum（差分更新）（軽量版）math/binomial_prefix_sum_incremental_light.hpp
• 階乗・逆階乗と二項係数（軽量版）math/comb_light.hpp
• modint を指定する階乗・逆階乗と二項係数math/comb_mod.hpp
• Factorial mod 998244353軽量実装なし · 高速実装はこちら
• 個数指定の部分和集合math/fixed_size_subset_sum.hpp

math/util

• 一般化 CRTmath/crt.hpp
• 等比数列の和math/geometric_sum.hpp
• 整数除算の切り下げ・切り上げmath/integer_division.hpp
• 一次合同式math/linear_congruence.hpp
• 区間制約付き一次不定方程式math/linear_diophantine.hpp
• 剰余累乗・逆元math/modular_arithmetic.hpp

math/number_theory

• 離散対数軽量実装なし · 高速実装はこちら
• 素因数分解・素数判定・約数列挙軽量実装なし · 高速実装はこちら
• 素数判定（軽量版）math/is_prime_light.hpp
• 整数 k 乗根math/kth_root.hpp
• 定数時間 mod inv軽量実装なし · 高速実装はこちら
• 定数時間 mod pow軽量実装なし · 高速実装はこちら
• 素数 mod の平方根math/mod_sqrt.hpp
• 約数ごとの乗法的関数の値軽量実装なし · 高速実装はこちら
• 乗法的関数の prefix summath/multiplicative_prefix_sum.hpp
• 素数計数math/prime_count.hpp
• 素数篩math/prime_sieve.hpp
• Stern–Brocot Treemath/stern_brocot_tree.hpp
• Euler φ関数の prefix summath/totient_sum.hpp

math/floor_sum

• Floor Summath/floor_sum.hpp
• Generalized Floor Sum（一般化 floor sum）math/generalized_floor_sum.hpp
• Min of Mod of Linearmath/min_of_mod_of_linear.hpp
• monoid floor summath/monoid_floor_sum.hpp
• Mod of Linear の等差数列分割math/partition_mod_of_linear.hpp
• Mod of Linear の Prefix Minimummath/prefix_min_of_mod_of_linear.hpp

math/linear_algebra

• 行列（軽量版）math/matrix_light.hpp
• XOR 基底math/xor_basis.hpp

sequence

• 転倒数sequence/inversion_count.hpp
• Longest Increasing Subsequencesequence/lis.hpp
• 順列の辞書順順位・復元sequence/permutation_rank.hpp
• 連長圧縮（RLE）sequence/run_length_encoding.hpp

string

• Aho–Corasickstring/aho_corasick.hpp
• Basic Substring Structurestring/basic_substring_structure.hpp
• 文字列結合の辞書順比較・並べ替えstring/concatenation_order.hpp
• Data Dependent Treestring/data_dependent_tree.hpp
• Dynamic Pattern Matching (固定本文)string/dynamic_pattern_matching.hpp
• Edit Distancestring/edit_distance.hpp
• Eertree（回文木）string/eertree.hpp
• LCP Arraystring/lcp_array.hpp
• Longest Common Subsequencestring/lcs.hpp
• 最長共通部分文字列string/longest_common_substring.hpp
• Manacher（回文半径）string/manacher.hpp
• Rolling Hashstring/rolling_hash.hpp
• Run 列挙string/run_enumerate.hpp
• Suffix Arraystring/suffix_array.hpp
• Suffix Automaton（接尾辞オートマトン）string/suffix_automaton.hpp
• Suffix Tree (静的文字列)string/suffix_tree.hpp
• Triestring/trie.hpp
• Z algorithmstring/z_algorithm.hpp

tree

• Auxiliary Treetree/auxiliary_tree.hpp
• Cartesian Treetree/cartesian_tree.hpp
• Tree Contour Sumtree/contour_sum.hpp
• DSU on Treetree/dsu_on_tree.hpp
• LCAtree/lca.hpp
• Link Cut Treetree/link_cut_tree.hpp
• Tree Path Producttree/path_product.hpp
• Permutation Treetree/permutation_tree.hpp
• 永続 Link Cut Treetree/persistent_link_cut_tree.hpp
• Prufer Code（木の符号化・復号）tree/prufer_code.hpp
• 全方位木 DPtree/rerooting.hpp
• 根付き木のハッシュtree/rooted_tree_hash.hpp
• Top Treetree/top_tree.hpp
• 木の中心tree/tree_center.hpp
• 木の直径tree/tree_diameter.hpp
• 木のハッシュtree/tree_hash.hpp
• 木上の Mo's Algorithmtree/tree_mo.hpp

応用ライブラリ

• Kinetic Tournament (固定係数昇順・更新係数非負)data_structure/kinetic_tournament.hpp
• Partially Retroactive Priority Queuedata_structure/partially_retroactive_priority_queue.hpp
• Fully Retroactive Priority Queuedata_structure/retroactive_priority_queue.hpp
• 重心分解tree/centroid_decomposition.hpp
• HLD (Heavy-Light Decomposition)tree/hld.hpp
• Static Top Treetree/static_top_tree.hpp

検証コード

• test/aho_corasick.test.cpp
• test/auxiliary_tree.test.cpp
• test/basic_substring_structure_substrings.test.cpp
• test/bellman_ford.test.cpp
• test/bellman_ford_path.test.cpp
• test/berlekamp_massey.test.cpp
• test/biconnected_components.test.cpp
• test/bigint_add.test.cpp
• test/bigint_divide.test.cpp
• test/bigint_multiply.test.cpp
• test/binomial_mod.test.cpp
• test/binomial_prefix_sum.test.cpp
• test/binomial_prefix_sum_light.test.cpp
• test/binomial_prefix_sum_online.test.cpp
• test/binomial_prefix_sum_online_light.test.cpp
• test/bipartite_graph.test.cpp
• test/bipartite_matching.test.cpp
• test/bitwise_and_convolution.test.cpp
• test/bitwise_xor_convolution.test.cpp
• test/cartesian_tree.test.cpp
• test/centroid_decomposition_contour.test.cpp
• test/centroid_decomposition_distance_frequency.test.cpp
• test/comb.test.cpp
• test/comb_light.test.cpp
• test/comb_prime_mod.test.cpp
• test/comb_prime_mod_light.test.cpp
• test/compressed_lazy_segtree_large.test.cpp
• test/convolution.test.cpp
• test/convolution_fft.test.cpp
• test/convolution_light.test.cpp
• test/convolution_mod.test.cpp
• test/convolution_ring.test.cpp
• test/cyclic_convolution.test.cpp
• test/cyclic_convolution_light.test.cpp
• test/data_dependent_tree.test.cpp
• test/deque.test.cpp
• test/difference_constraints.test.cpp
• test/dijkstra.test.cpp
• test/dijkstra_bigint_yuki.test.cpp
• test/dijkstra_path.test.cpp
• test/dijkstra_topological.test.cpp
• test/discrete_log.test.cpp
• test/disjoint_sparse_table_affine.test.cpp
• test/disjoint_sparse_table_min.test.cpp
• test/dsu_on_tree_subtree_sum.test.cpp
• test/dual_segtree.test.cpp
• test/dynamic_bitset_matrix_product.test.cpp
• test/dynamic_connectivity.test.cpp
• test/dynamic_convex_hull.test.cpp
• test/dynamic_lazy_segtree.test.cpp
• test/dynamic_lazy_segtree_large.test.cpp
• test/dynamic_li_chao_tree_line.test.cpp
• test/dynamic_li_chao_tree_segment.test.cpp
• test/dynamic_pattern_matching_array.test.cpp
• test/dynamic_segtree_composite.test.cpp
• test/dynamic_segtree_sum.test.cpp
• test/dynamic_wavelet_matrix_kth.test.cpp
• test/edit_distance.test.cpp
• test/eertree.test.cpp
• test/enumerate_palindromes.test.cpp
• test/enumerate_primes.test.cpp
• test/enumerate_quotients.test.cpp
• test/eulerian_trail_directed.test.cpp
• test/eulerian_trail_undirected.test.cpp
• test/factorial_mod.test.cpp
• test/factorize.test.cpp
• test/fenwick_tree.test.cpp
• test/flat_hash_map.test.cpp
• test/floor_sum.test.cpp
• test/fps_bostan_mori.test.cpp
• test/fps_compose.test.cpp
• test/fps_compose_large.test.cpp
• test/fps_compositional_inverse.test.cpp
• test/fps_compositional_inverse_large.test.cpp
• test/fps_divmod.test.cpp
• test/fps_exp.test.cpp
• test/fps_exp_sparse.test.cpp
• test/fps_interpolate.test.cpp
• test/fps_inv.test.cpp
• test/fps_inv_sparse.test.cpp
• test/fps_light_compose.test.cpp
• test/fps_light_compositional_inverse.test.cpp
• test/fps_light_convolution.test.cpp
• test/fps_light_divmod.test.cpp
• test/fps_light_exp.test.cpp
• test/fps_light_interpolate.test.cpp
• test/fps_light_inv.test.cpp
• test/fps_light_linear_recurrence.test.cpp
• test/fps_light_log.test.cpp
• test/fps_light_multipoint_eval.test.cpp
• test/fps_light_polynomial_extended_gcd.test.cpp
• test/fps_light_polynomial_gcd.test.cpp
• test/fps_light_polynomial_inv_mod.test.cpp
• test/fps_light_pow.test.cpp
• test/fps_light_power_projection.test.cpp
• test/fps_light_rational_coefficients.test.cpp
• test/fps_light_sqrt.test.cpp
• test/fps_light_taylor_shift.test.cpp
• test/fps_linear_recurrence.test.cpp
• test/fps_log.test.cpp
• test/fps_log_sparse.test.cpp
• test/fps_pow.test.cpp
• test/fps_pow_sparse.test.cpp
• test/fps_rational_coefficients.test.cpp
• test/fps_sqrt.test.cpp
• test/fps_sqrt_sparse.test.cpp
• test/fps_taylor_shift.test.cpp
• test/fraction.test.cpp
• test/functional_graph_jump.test.cpp
• test/gcd_convolution.test.cpp
• test/general_matching.test.cpp
• test/general_weighted_matching.test.cpp
• test/generalized_floor_sum.test.cpp
• test/generalized_floor_sum_yuki.test.cpp
• test/geometry_argument_sort.test.cpp
• test/geometry_circle_line.test.cpp
• test/geometry_circle_polygon.test.cpp
• test/geometry_closest_pair.test.cpp
• test/geometry_convex_cut.test.cpp
• test/geometry_convex_hull.test.cpp
• test/geometry_furthest_pair.test.cpp
• test/geometry_polygon_contains.test.cpp
• test/geometry_projection.test.cpp
• test/geometry_segment_distance.test.cpp
• test/hld_jump.test.cpp
• test/hld_path_composite.test.cpp
• test/hld_path_sum.test.cpp
• test/hld_subtree_sum.test.cpp
• test/hungarian.test.cpp
• test/interval_map.test.cpp
• test/interval_set_predecessor.test.cpp
• test/inversion_count.test.cpp
• test/is_prime.test.cpp
• test/is_prime_light.test.cpp
• test/k_shortest_walk.test.cpp
• test/kd_tree.test.cpp
• test/kinetic_tournament.test.cpp
• test/kth_root.test.cpp
• test/lazy_reversible_treap_affine.test.cpp
• test/lazy_reversible_treap_reverse.test.cpp
• test/lazy_segtree.test.cpp
• test/lazy_segtree_min.test.cpp
• test/lca_path_sum.test.cpp
• test/lcm_convolution.test.cpp
• test/lcs.test.cpp
• test/lcs_restore.test.cpp
• test/li_chao_tree_line.test.cpp
• test/li_chao_tree_segment.test.cpp
• test/link_cut_tree_composite.test.cpp
• test/link_cut_tree_sum.test.cpp
• test/lis.test.cpp
• test/longest_common_substring.test.cpp
• test/low_link_articulation.test.cpp
• test/low_link_bridge.test.cpp
• test/lowest_common_ancestor.test.cpp
• test/matrix_adjugate.test.cpp
• test/matrix_characteristic_polynomial.test.cpp
• test/matrix_det.test.cpp
• test/matrix_inverse.test.cpp
• test/matrix_pow.test.cpp
• test/matrix_product.test.cpp
• test/matrix_rank.test.cpp
• test/matrix_solve.test.cpp
• test/max_flow.test.cpp
• test/max_flow_yuki.test.cpp
• test/min_cost_b_flow.test.cpp
• test/min_cost_flow.test.cpp
• test/min_of_mod_of_linear.test.cpp
• test/min_plus_concave.test.cpp
• test/min_plus_convex.test.cpp
• test/min_plus_convex_convex.test.cpp
• test/minimum_spanning_tree.test.cpp
• test/mo_inversions.test.cpp
• test/mod_pow_log.test.cpp
• test/mod_sqrt.test.cpp
• test/monoid_floor_sum.test.cpp
• test/monotone_minima.test.cpp
• test/multiplicative_convolution.test.cpp
• test/multiplicative_convolution_light.test.cpp
• test/multiplicative_prefix_sum.test.cpp
• test/multiplicative_prefix_sum_large.test.cpp
• test/multiplicative_prefix_sum_totient.test.cpp
• test/multipoint_eval.test.cpp
• test/multivariate_convolution.test.cpp
• test/multivariate_convolution_light.test.cpp
• test/ntt.test.cpp
• test/offline_dynamic_connectivity.test.cpp
• test/offline_point_set_range_frequency.test.cpp
• test/offline_range_frequency.test.cpp
• test/offline_range_kth_smallest.test.cpp
• test/offline_range_sum.test.cpp
• test/offline_rectangle_sum.test.cpp
• test/online_convolution.test.cpp
• test/online_convolution_exp.test.cpp
• test/online_convolution_inv.test.cpp
• test/online_convolution_light.test.cpp
• test/ordered_convolution.test.cpp
• test/ordered_convolution_light.test.cpp
• test/ordered_set.test.cpp
• test/parallel_binary_search.test.cpp
• test/partially_retroactive_priority_queue.test.cpp
• test/permutation_tree.test.cpp
• test/persistent_deque.test.cpp
• test/persistent_heap.test.cpp
• test/persistent_lazy_segtree.test.cpp
• test/persistent_multiset.test.cpp
• test/persistent_queue.test.cpp
• test/persistent_queue_batch.test.cpp
• test/persistent_segtree_unionfind.test.cpp
• test/persistent_union_find.test.cpp
• test/point_set_tree_path_composite_sum.test.cpp
• test/point_set_tree_path_composite_sum_fixed_root.test.cpp
• test/polynomial_inv_mod.test.cpp
• test/power_projection.test.cpp
• test/predecessor_set.test.cpp
• test/predecessor_set_priority_queue.test.cpp
• test/prefix_min_of_mod_of_linear.test.cpp
• test/prime_count.test.cpp
• test/range_add_range_min.test.cpp
• test/range_affine_point_get.test.cpp
• test/range_affine_range_sum.test.cpp
• test/range_chmin_chmax_add_sum.test.cpp
• test/range_edge_graph.test.cpp
• test/range_lis_query.test.cpp
• test/rerooting.test.cpp
• test/rerooting_diameter.test.cpp
• test/rollback_union_find.test.cpp
• test/rollback_union_find_persistent.test.cpp
• test/rolling_hash.test.cpp
• test/rooted_tree_hash.test.cpp
• test/run_enumerate.test.cpp
• test/scc.test.cpp
• test/segtree_beats.test.cpp
• test/segtree_composite.test.cpp
• test/set_xor_min.test.cpp
• test/sliding_window_aggregation.test.cpp
• test/slope_trick.test.cpp
• test/smawk.test.cpp
• test/sortable_segtree.test.cpp
• test/sparse_table_min.test.cpp
• test/static_range_count_distinct.test.cpp
• test/static_range_min.test.cpp
• test/static_range_sum.test.cpp
• test/static_threshold_search.test.cpp
• test/steiner_tree.test.cpp
• test/stern_brocot_binary_search.test.cpp
• test/stern_brocot_tree.test.cpp
• test/subset_convolution.test.cpp
• test/suffix_array_public.test.cpp
• test/suffix_automaton_lcs.test.cpp
• test/suffix_automaton_substrings.test.cpp
• test/suffix_tree_array.test.cpp
• test/suffix_tree_substrings.test.cpp
• test/top_k_sum.test.cpp
• test/top_tree_composite.test.cpp
• test/top_tree_subtree_sum.test.cpp
• test/topological_sort.test.cpp
• test/tree_diameter.test.cpp
• test/trie.test.cpp
• test/two_edge_connected_components.test.cpp
• test/two_sat.test.cpp
• test/union_find.test.cpp
• test/warshall_floyd.test.cpp
• test/weighted_union_find.test.cpp
• test/weighted_wavelet_matrix_rectangle.test.cpp
• test/xor_basis_intersection.test.cpp
• test/z_algorithm.test.cpp