sotanishy's competitive programming library

Using C++20

This documentation is automatically generated by online-judge-tools/verification-helper

Library Files

convolution

• Arbitrary Mod Convolution (convolution/arbitrary_mod_convolution.hpp)
• Convex Min-Plus Convolution (convolution/convex_min_plus_convolution.hpp)
• Multiple/Divisor Fast Zeta/Möbius Transform (convolution/divisor_zeta_moebius_transform.hpp)
• Fast Fourier Transform (convolution/fft.hpp)
• GCD/LCM Convolution (convolution/gcd_lcm_convolution.hpp)
• Number Theoretic Transform (convolution/ntt.hpp)
• Relaxed Convolution (convolution/relaxed_convolution.hpp)
• Fast Walsh-Hadamard Transform (convolution/walsh_hadamard_transform.hpp)
• Bitwise XOR Convolution (convolution/xor_convolution.hpp)

data-structure

• Binary Trie (data-structure/binary_trie.hpp)
• Rank/Select Dictionary (data-structure/bit_vector.hpp)
• Disjoint Sparse Table (data-structure/disjoint_sparse_table.hpp)
• Fenwick Tree (data-structure/fenwick_tree.hpp)
• 2D Fenwick Tree (data-structure/fenwick_tree_2d.hpp)
• Foldable Deque (data-structure/foldable_deque.hpp)
• Inner-Product Search (data-structure/inner_product_search.hpp)
• k-d Tree (data-structure/kd_tree.hpp)
• Leftist Heap (data-structure/leftist_heap.hpp)
• Min-Max Heap (data-structure/min_max_heap.hpp)
• Partition Refinement (data-structure/partition_refinement.hpp)
• Persistent Array (data-structure/persistent_array.hpp)
• Persistent Queue (data-structure/persistent_queue.hpp)
• Persistent Stack (data-structure/persistent_stack.hpp)
• Quadtree (data-structure/quadtree.hpp)
• Fenwick Tree with Range Update (data-structure/range_fenwick_tree.hpp)
• Range Tree (data-structure/range_tree.hpp)
• Sliding Window Minimum (data-structure/slide_min.hpp)
• Sliding Window Aggregation (data-structure/sliding_window_aggregation.hpp)
• Slope Trick (data-structure/slope_trick.hpp)
• Sparse Table (data-structure/sparse_table.hpp)
• Sqrt Tree (data-structure/sqrt_tree.hpp)
• Wavelet Matrix (data-structure/wavelet_matrix.hpp)

data-structure/bst

• Treap with Lazy Propagation (data-structure/bst/lazy_treap.hpp)
• Randomized Binary Search Tree (data-structure/bst/rbst.hpp)
• Red Black Tree (data-structure/bst/red_black_tree.hpp)
• Splay Tree (data-structure/bst/splay_tree.hpp)
• Treap (data-structure/bst/treap.hpp)

data-structure/cht

• Convex Hull Trick (data-structure/cht/convex_hull_trick.hpp)
• Convex Hull Trick (Binary Search Tree) (data-structure/cht/convex_hull_trick_binsearchtree.hpp)
• Li Chao Tree (data-structure/cht/li_chao_tree.hpp)
• Nonlinear Convex Hull Trick (data-structure/cht/nonlinear_convex_hull_trick.hpp)
• Offline Deletable Convex Hull Trick (data-structure/cht/offline_deletable_convex_hull_trick.hpp)
• Undoable Li Chao Tree (data-structure/cht/undoable_li_chao_tree.hpp)

data-structure/segtree

• Dual Segment Tree (data-structure/segtree/dual_segment_tree.hpp)
• 2D Dual Segment Tree (data-structure/segtree/dual_segment_tree_2d.hpp)
• Dynamic Segment Tree with Lazy Propagation (data-structure/segtree/dynamic_lazy_segment_tree.hpp)
• Dynamic Segment Tree (data-structure/segtree/dynamic_segment_tree.hpp)
• Segment Tree with Lazy Propagation (data-structure/segtree/lazy_segment_tree.hpp)
• Persistent Segment Tree (data-structure/segtree/persistent_segment_tree.hpp)
• Segment Tree (data-structure/segtree/segment_tree.hpp)
• 2D Segment Tree (data-structure/segtree/segment_tree_2d.hpp)
• Segment Tree Beats (data-structure/segtree/segment_tree_beats.hpp)
• Sortable Segment Tree (data-structure/segtree/sortable_segment_tree.hpp)
• Xor Segment Tree (data-structure/segtree/xor_segment_tree.hpp)

data-structure/unionfind

• Partially Persistent Union Find (data-structure/unionfind/partially_persistent_union_find.hpp)
• Persistent Union Find (data-structure/unionfind/persistent_union_find.hpp)
• Static Range Union Find (data-structure/unionfind/static_range_union_find.hpp)
• Undoable Union Find (data-structure/unionfind/undoable_union_find.hpp)
• Union Find (data-structure/unionfind/union_find.hpp)
• Weighted Union Find (data-structure/unionfind/weighted_union_find.hpp)

dp

• Edit Distance (dp/edit_distance.hpp)
• Hu-Tucker Algorithm (dp/hu_tucker.hpp)
• Largest Rectangle (dp/largest_rectangle.hpp)
• Longest Common Subsequence (dp/lcs.hpp)
• Longest Increasing Subsequence (dp/lis.hpp)
• Monge Shortest Path (dp/monge_shortest_path.hpp)
• Monotone Minima (dp/monotone_minima.hpp)
• SMAWK Algorithm (dp/smawk.hpp)

flow

• Dinic's Algorithm (flow/dinic.hpp)
• Ford-Fulkerson Algorithm (flow/ford_fulkerson.hpp)
• Minimum Cost b-flow (flow/min_cost_b_flow.hpp)
• Minimum Cost Flow (flow/min_cost_flow.hpp)

geometry

• geometry/bisector.hpp
• Closest Pair (geometry/closest_pair.hpp)
• Convex Hull (geometry/convex_hull.hpp)
• Delaunay Diagram (geometry/delaunay_diagram.hpp)
• geometry/dist.hpp
• Furthest Pair (geometry/furthest_pair.hpp)
• Geometry (geometry/geometry.hpp)
• 3D Geometry (geometry/geometry3d.hpp)
• geometry/intersect.hpp
• geometry/intersection.hpp
• Minimum Bounding Circle (geometry/minimum_bounding_circle.hpp)
• geometry/polygon.hpp
• geometry/tangent.hpp
• geometry/triangle.hpp

graph

• Assignment Problem (Maximum Weight Perfect Matching) (graph/assignment.hpp)
• Biconnected Components (graph/biconnected_components.hpp)
• Bipartite Edge Coloring (graph/bipartite_edge_coloring.hpp)
• Bipartite Matching (graph/bipartite_matching.hpp)
• Chordal Graph Recognition (graph/chordal_graph_recognition.hpp)
• Chromatic Number (graph/chromatic_number.hpp)
• BFS on a Complement Graph (graph/complement_bfs.hpp)
• Dulmage-Mendelsohn Decomposition (graph/dm_decomposition.hpp)
• Dominator Tree (graph/dominator_tree.hpp)
• Clique Enumeration (graph/enumerate_cliques.hpp)
• Triangle Enumeration (graph/enumerate_triangles.hpp)
• Eulerian Walk (graph/eulerian_walk.hpp)
• General Matching (graph/general_matching.hpp)
• Junction Tree (Width 2) (graph/junction_tree.hpp)
• Lexicographic BFS (graph/lex_bfs.hpp)
• Lowlink (graph/lowlink.hpp)
• Manhattan Minimum Spanning Tree (graph/manhattan_mst.hpp)
• Maximum Independent Set (graph/maximum_independent_set.hpp)
• Maximum Weight Independent Set (graph/maximum_weight_independent_set.hpp)
• Minimum Spanning Arborescence (graph/minimum_spanning_arborescence.hpp)
• Minimum Steiner Tree (graph/minimum_steiner_tree.hpp)
• Minimum Spanning Tree Algorithms (graph/mst.hpp)
• Offline Dynamic Connectivity (graph/offline_dynamic_connectivity.hpp)
• Pseudotree Cycle (graph/pseudotree_cycle.hpp)
• Range Edge Graph (graph/range_edge_graph.hpp)
• Strongly Connected Components (graph/scc.hpp)
• Shortest Path Algorithms (graph/shortest_path.hpp)
• Topological Sort (graph/topological_sort.hpp)
• 2-Edge-Connected Components (graph/two_edge_connected_components.hpp)

math

• Arbitrary Mod int (math/arbitrary_modint.hpp)
• Berlekamp-Massey Algorithm (math/berlekamp_massey.cpp)
• Bernoulli Number (math/bernoulli.hpp)
• Bostan-Mori Algorithm (math/bostan_mori.hpp)
• Combination (math/combination.cpp)
• Combination (Arbitrary mod) (math/combination_arbitrary_mod.hpp)
• Combination (Large) (math/combination_large.hpp)
• Base Conversion (math/convert_base.cpp)
• Count Subset Sum (math/count_subset_sum.hpp)
• Factorial (math/factorial.hpp)
• Gaussian Integer (math/gaussian_integer.hpp)
• Polynomial Interpolation (math/interpolation.cpp)
• Kitamasa's Algorithm (math/kitamasa.cpp)
• Lagrange Interpolation (math/lagrange_interpolation.hpp)
• Lagrange Polynomial (math/lagrange_polynomial.hpp)
• Mod int (math/modint.hpp)
• Monmort Number (math/montmort.cpp)
• Multipoint Evaluation (math/multipoint_evaluation.cpp)
• Nimber (math/nimber.hpp)
• Partition Function (math/partition_function.hpp)
• Polynomial (math/polynomial.cpp)
• Product of Polynomial Sequence (math/product_of_polynomial_sequence.hpp)
• q-Analogs (math/q_analogs.hpp)
• Stirling Number of the First Kind (math/stirling_first.hpp)
• Stirling Number of the Second Kind (math/stirling_second.hpp)

math/linalg

• Binary Matrix (math/linalg/binary_matrix.hpp)
• Characteristic Polynomial (math/linalg/characteristic_polynomial.hpp)
• Hafnian (math/linalg/hafnian.hpp)
• Matrix (math/linalg/matrix.hpp)
• System of Linear Equations (math/linalg/system_of_linear_equations.hpp)

math/number-theory

• Carmichael Function (math/number-theory/carmichael.hpp)
• Divisor (math/number-theory/divisor.hpp)
• Euler's Totient Function (math/number-theory/euler_totient.hpp)
• Extended Euclidean Algorithm (math/number-theory/extgcd.hpp)
• Farey Sequence (math/number-theory/farey_sequence.hpp)
• Fast Prime Number Algorithms (math/number-theory/fast_prime.hpp)
• Sum of Floor of Linear (math/number-theory/floor_sum.hpp)
• Garner's Algorithm (math/number-theory/garner.hpp)
• Integer Square Root (math/number-theory/isqrt.hpp)
• Integer Kth Root (math/number-theory/kth_root.hpp)
• Modular Arithmetic (math/number-theory/mod_arithmetic.hpp)
• Möbius Function (math/number-theory/moebius.hpp)
• Prime Number Algorithms (math/number-theory/prime.hpp)
• Prime Counting Function (math/number-theory/prime_count.hpp)
• Primitive Root (math/number-theory/primitive_root.hpp)
• Intervals with Equal Quotients (math/number-theory/quotients.hpp)
• Stern-Brocot Tree (math/number-theory/stern_brocot_tree.hpp)

math/set

• Bitwise AND/OR Convolution (math/set/and_or_convolution.hpp)
• Set Power Series (math/set/set_power_series.hpp)
• Subset Convolution (math/set/subset_convolution.hpp)
• Fast Zeta/Möbius Transform (math/set/zeta_moebius_transform.hpp)

misc

• Coordinate Compression (misc/compress.hpp)
• Die (misc/die.hpp)
• Discrete Logarithm of Monoid Action (misc/discrete_log_monoid_action.hpp)
• Enumerate Subsets (misc/enumerate_subsets.hpp)
• Fraction (misc/fraction.hpp)
• Golden-Section Search (misc/golden_section_search.hpp)
• Interval Set (misc/interval_set.hpp)
• Intervals (misc/intervals.hpp)
• Boyer-Moore Majority Vote Algorithm (misc/majority.hpp)
• misc/marathon_template.cpp
• Matroid Intersection (misc/matroid_intersection.hpp)
• Median Set (misc/median_set.hpp)
• Memo (misc/memo.hpp)
• Minimize Periodic Function (misc/min_periodic_function.hpp)
• Mo's Algorithm (misc/mo.hpp)
• misc/monoids.cpp
• Lexicographic Index of Permutations (in Factorial Number System) (misc/permutation.hpp)
• misc/random.hpp
• Area of Union of Rectangles (misc/rectangle_union.hpp)
• Sorting Algorithms (misc/sorting.hpp)
• Stable Matching (misc/stable_matching.hpp)
• Sum of Top K Values (misc/sum_top_k.hpp)
• misc/timer.hpp

sat

• Horn-SAT (sat/hornsat.hpp)
• 2-SAT (sat/twosat.hpp)

string

• Aho-Corasick Algorithm (string/aho_corasick.hpp)
• Enumerate Runs (string/enumerate_runs.hpp)
• Knuth-Morris-Pratt Algorithm (string/kmp.hpp)
• Longest Common Prefix Array (string/lcp_array.hpp)
• Longest Common Substring (string/longest_common_substring.hpp)
• Lyndon Factorization (string/lyndon_factorization.hpp)
• Manacher's Algorithm (string/manacher.hpp)
• Minimum Cyclic Shift (string/min_cyclic_shift.hpp)
• Palindromic Tree (string/palindromic_tree.hpp)
• 2D Pattern Search (Baker-Bird Algorithm) (string/pattern_search_2d.hpp)
• Rolling Hash (string/rolling_hash.hpp)
• Suffix Array (string/suffix_array.hpp)
• Trie (string/trie.hpp)
• Z Array (string/z_array.hpp)

tree

• Auxiliary Tree (tree/auxiliary_tree.hpp)
• Binary Lifting (tree/binary_lifting.hpp)
• Cartesian Tree (tree/cartesian_tree.hpp)
• Centroid Decomposition (tree/centroid_decomposition.hpp)
• Euler Tour (tree/euler_tour.hpp)
• Euler Tour Tree (tree/euler_tour_tree.hpp)
• Heavy-Light Decomposition (tree/hld.hpp)
• Lowest Common Ancestor (tree/lca.hpp)
• Link/Cut Tree (tree/link_cut_tree.hpp)
• Permutation Tree (tree/permutation_tree.hpp)
• Range Contour Aggregation (tree/range_contour_aggregation.hpp)
• Rerooting (tree/rerooting.hpp)
• Diameter of a Tree (tree/tree_diameter.hpp)
• Tree Isomorphism (tree/tree_isomorphism.hpp)

Verification Files

test/aoj

• test/aoj/1040.test.cpp
• test/aoj/1208.test.cpp
• test/aoj/1283.test.cpp
• test/aoj/1298.test.cpp
• test/aoj/1508.rbst.test.cpp
• test/aoj/1508.splay_tree.test.cpp
• test/aoj/1508.treap.test.cpp
• test/aoj/2292.test.cpp
• test/aoj/2415.test.cpp
• test/aoj/ALDS1_14_B.kmp.test.cpp
• test/aoj/ALDS1_14_B.rolling_hash.test.cpp
• test/aoj/ALDS1_14_C.test.cpp
• test/aoj/ALDS1_1_C.is_prime.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/CGL_4_C.test.cpp
• test/aoj/CGL_5_A.test.cpp
• test/aoj/CGL_7_A.test.cpp
• test/aoj/CGL_7_B.test.cpp
• test/aoj/CGL_7_C.test.cpp
• test/aoj/CGL_7_D.test.cpp
• test/aoj/CGL_7_E.test.cpp
• test/aoj/CGL_7_F.test.cpp
• test/aoj/CGL_7_G.test.cpp
• test/aoj/CGL_7_I.test.cpp
• test/aoj/DPL_3_C.test.cpp
• test/aoj/DSL_1_B.test.cpp
• test/aoj/DSL_2_B.dynamic_segment_tree.test.cpp
• test/aoj/DSL_2_B.test.cpp
• test/aoj/DSL_2_C.test.cpp
• test/aoj/DSL_2_F.dynamic_lazy_segment_tree.test.cpp
• test/aoj/DSL_2_G.range_fenwick_tree.test.cpp
• test/aoj/DSL_3_D.slide_min.test.cpp
• test/aoj/DSL_3_D.sparse_table.test.cpp
• test/aoj/GRL_1_A.test.cpp
• test/aoj/GRL_1_B.test.cpp
• test/aoj/GRL_1_C.test.cpp
• test/aoj/GRL_2_A.boruvka.test.cpp
• test/aoj/GRL_2_A.kruskal.test.cpp
• test/aoj/GRL_2_A.prim.test.cpp
• test/aoj/GRL_3_A.test.cpp
• test/aoj/GRL_3_B.test.cpp
• test/aoj/GRL_6_A.dinic.test.cpp
• test/aoj/GRL_6_A.ford_fulkerson.test.cpp
• test/aoj/GRL_6_B.test.cpp
• test/aoj/GRL_7_A.test.cpp
• test/aoj/NTL_1_A.test.cpp
• test/aoj/NTL_1_B.test.cpp
• test/aoj/NTL_1_D.test.cpp

test/yosupo

• test/yosupo/area_of_union_of_rectangles.test.cpp
• test/yosupo/assignment.test.cpp
• test/yosupo/bernoulli_number.test.cpp
• test/yosupo/biconnected_components.test.cpp
• test/yosupo/binomial_coefficient_prime_mod.test.cpp
• test/yosupo/bipartite_edge_coloring.test.cpp
• test/yosupo/bipartitematching.test.cpp
• test/yosupo/bitwise_and_convolution.test.cpp
• test/yosupo/bitwise_xor_convolution.test.cpp
• test/yosupo/cartesian_tree.test.cpp
• test/yosupo/characteristic_polynomial.test.cpp
• test/yosupo/chordal_graph_recognition.test.cpp
• test/yosupo/chromatic_number.test.cpp
• test/yosupo/closest_pair.test.cpp
• test/yosupo/common_interval_decomposition_tree.test.cpp
• test/yosupo/convolution_mod.test.cpp
• test/yosupo/convolution_mod_1000000007.test.cpp
• test/yosupo/counting_primes.test.cpp
• test/yosupo/deque_operate_all_composite.test.cpp
• test/yosupo/directedmst.test.cpp
• test/yosupo/discrete_logarithm_mod.test.cpp
• test/yosupo/division_of_polynomials.test.cpp
• test/yosupo/dominatortree.test.cpp
• test/yosupo/double_ended_priority_queue.test.cpp
• test/yosupo/dynamic_graph_vertex_add_component_sum.test.cpp
• test/yosupo/dynamic_sequence_range_affine_range_sum.treap.test.cpp
• test/yosupo/dynamic_tree_subtree_add_subtree_sum.test.cpp
• test/yosupo/dynamic_tree_vertex_add_subtree_sum.test.cpp
• test/yosupo/dynamic_tree_vertex_set_path_composite.test.cpp
• test/yosupo/enumerate_cliques.test.cpp
• test/yosupo/enumerate_palindromes.test.cpp
• test/yosupo/enumerate_primes.test.cpp
• test/yosupo/enumerate_quotients.test.cpp
• test/yosupo/enumerate_triangles.test.cpp
• test/yosupo/exp_of_formal_power_series.test.cpp
• test/yosupo/exp_of_set_power_series.test.cpp
• test/yosupo/factorial.test.cpp
• test/yosupo/factorize.test.cpp
• test/yosupo/find_linear_recurrence.test.cpp
• test/yosupo/frequency_table_of_tree_distance.test.cpp
• test/yosupo/furthest_pair.test.cpp
• test/yosupo/gcd_convolution.test.cpp
• test/yosupo/gcd_of_gaussian_integers.test.cpp
• test/yosupo/general_matching.test.cpp
• test/yosupo/hafnian_of_matrix.test.cpp
• test/yosupo/inv_of_formal_power_series.test.cpp
• test/yosupo/inverse_matrix.test.cpp
• test/yosupo/jump_on_tree.test.cpp
• test/yosupo/kth_root_integer.test.cpp
• test/yosupo/kth_term_of_linearly_recurrent_sequence.test.cpp
• test/yosupo/lca.test.cpp
• test/yosupo/lcm_convolution.test.cpp
• test/yosupo/line_add_get_min.cht.test.cpp
• test/yosupo/line_add_get_min.lct.test.cpp
• test/yosupo/log_of_formal_power_series.test.cpp
• test/yosupo/longest_common_substring.test.cpp
• test/yosupo/longest_increasing_subsequence.test.cpp
• test/yosupo/lyndon_factorization.test.cpp
• test/yosupo/manhattanmst.test.cpp
• test/yosupo/matrix_det.test.cpp
• test/yosupo/matrix_product.test.cpp
• test/yosupo/matrix_product_mod_2.test.cpp
• test/yosupo/matrix_rank.test.cpp
• test/yosupo/maximum_independent_set.test.cpp
• test/yosupo/min_cost_b_flow.test.cpp
• test/yosupo/min_plus_convolution_convex_arbitrary.test.cpp
• test/yosupo/montmort_number_mod.test.cpp
• test/yosupo/multipoint_evaluation.test.cpp
• test/yosupo/nim_product_64.test.cpp
• test/yosupo/number_of_subsequences.test.cpp
• test/yosupo/number_of_substrings.test.cpp
• test/yosupo/partition_function.test.cpp
• test/yosupo/persistent_queue.test.cpp
• test/yosupo/persistent_unionfind.test.cpp
• test/yosupo/point_add_rectangle_sum.2d_segtree.test.cpp
• test/yosupo/point_add_rectangle_sum.quadtree.test.cpp
• test/yosupo/point_set_range_composite.test.cpp
• test/yosupo/point_set_range_sort_range_composite.test.cpp
• test/yosupo/polynomial_interpolation.test.cpp
• test/yosupo/polynomial_taylor_shift.test.cpp
• test/yosupo/pow_of_formal_power_series.test.cpp
• test/yosupo/pow_of_matrix.test.cpp
• test/yosupo/primality_test.test.cpp
• test/yosupo/primitive_root.test.cpp
• test/yosupo/product_of_polynomial_sequence.test.cpp
• test/yosupo/queue_operate_all_composite.test.cpp
• test/yosupo/range_affine_point_get.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/range_reverse_range_sum.splay_tree.test.cpp
• test/yosupo/range_reverse_range_sum.treap.test.cpp
• test/yosupo/rectangle_add_point_get.2d_dual_segtree.test.cpp
• test/yosupo/rectangle_sum.persistent_segment_tree.test.cpp
• test/yosupo/rectangle_sum.range_tree.test.cpp
• test/yosupo/rooted_tree_isomorphism_classification.ahu.test.cpp
• test/yosupo/rooted_tree_isomorphism_classification.hash.test.cpp
• test/yosupo/runenumerate.test.cpp
• test/yosupo/scc.test.cpp
• test/yosupo/segment_add_get_min.test.cpp
• test/yosupo/set_xor_min.test.cpp
• test/yosupo/sharp_p_subset_sum.test.cpp
• test/yosupo/shortest_path.test.cpp
• test/yosupo/sqrt_mod.test.cpp
• test/yosupo/static_convex_hull.test.cpp
• test/yosupo/static_range_frequency.test.cpp
• test/yosupo/static_range_inversions_query.test.cpp
• test/yosupo/staticrmq.sqrt_tree.test.cpp
• test/yosupo/staticrmq.test.cpp
• test/yosupo/stirling_number_of_the_first_kind.test.cpp
• test/yosupo/stirling_number_of_the_second_kind.test.cpp
• test/yosupo/subset_convolution.test.cpp
• test/yosupo/suffixarray.test.cpp
• test/yosupo/sum_of_floor_of_linear.test.cpp
• test/yosupo/sum_of_totient_function.test.cpp
• test/yosupo/system_of_linear_equations.test.cpp
• test/yosupo/tetration_mod.test.cpp
• test/yosupo/tree_decomposition_width_2.test.cpp
• test/yosupo/tree_diameter.test.cpp
• test/yosupo/tree_path_composite_sum.test.cpp
• test/yosupo/two_edge_connected_components.test.cpp
• test/yosupo/two_sat.test.cpp
• test/yosupo/unionfind.test.cpp
• test/yosupo/vertex_add_range_contour_sum_on_tree.test.cpp
• test/yosupo/vertex_add_subtree_sum.euler_tour.test.cpp
• test/yosupo/vertex_add_subtree_sum.hld.test.cpp
• test/yosupo/vertex_set_path_composite.test.cpp
• test/yosupo/zalgorithm.test.cpp