library

Library Files

algorithm

• algorithm/knuthyao.cpp
• algorithm/largestrectangle.cpp
• algorithm/mo.cpp
• algorithm/monotoneminima.cpp
• algorithm/offlineonline.cpp
• algorithm/optimalbinarytree.cpp
• algorithm/parallelbinarysearch.cpp
• algorithm/partialsum.cpp

bbst

• bbst/pb_ds_tree.cpp

bbst/rbst/data

• bbst/rbst/data/array.cpp
• bbst/rbst/data/dual.cpp
• bbst/rbst/data/lazy.cpp
• bbst/rbst/data/ushi.cpp

bbst/rbst/impl

• bbst/rbst/impl/basic.cpp
• bbst/rbst/impl/persistent.cpp

bbst/rbst

• bbst/rbst/rbst.cpp

bflow

• Minimum Cost Flow with Capacity Scaling (bflow/capacityscaling.cpp)

combinatorics

• combinatorics/bell.cpp
• combinatorics/bernoulli.cpp
• combinatorics/enumeration.cpp
• combinatorics/partition.cpp
• combinatorics/partitiontable.cpp
• combinatorics/stirling1st.cpp
• combinatorics/stirling2nd.cpp
• combinatorics/surjection.cpp

convexhulltrick

• convexhulltrick/convexhulltrick.cpp
• convexhulltrick/linecontainer.cpp
• convexhulltrick/segmentcontainer.cpp
• convexhulltrick/withindex.cpp

convolution

• convolution/arbitrarymod.cpp
• convolution/convolution2D.cpp
• convolution/divisor.cpp
• convolution/fastfouriertransform.cpp
• convolution/garner.cpp
• convolution/naive.cpp
• convolution/numbertheoretictransform.cpp

convolution/bitwise

• convolution/bitwise/and.cpp
• convolution/bitwise/fwht.cpp
• convolution/bitwise/or.cpp
• convolution/bitwise/xor.cpp

datastructure

• datastructure/BIT2D.cpp
• datastructure/absolutesum.cpp
• Binary Indexed Tree (datastructure/binaryindexedtree.cpp)
• datastructure/binarytrie.cpp
• datastructure/bitvector.cpp
• datastructure/cartesiantree.cpp
• datastructure/cumulativesum.cpp
• datastructure/disjointsparsetable.cpp
• datastructure/kdtree.cpp
• datastructure/pb_ds_cc_hash_table.cpp
• datastructure/prioritysum.cpp
• datastructure/quickfind.cpp
• datastructure/radixheap.cpp
• datastructure/rangeslide.cpp
• datastructure/rotcev.cpp
• datastructure/skewheap.cpp
• datastructure/slidingwindowaggregation.cpp
• datastructure/slope.cpp
• datastructure/sparsetable.cpp
• datastructure/unionfind.cpp
• Wavelet Matrix (datastructure/waveletmatrix.cpp)
• datastructure/weightedunionfind.cpp

formalpowerseries

• formalpowerseries/998244353.cpp
• formalpowerseries/base.cpp
• formalpowerseries/diff.cpp
• formalpowerseries/div.cpp
• formalpowerseries/exp.cpp
• formalpowerseries/integral.cpp
• formalpowerseries/inv.cpp
• formalpowerseries/log.cpp
• formalpowerseries/mod.cpp
• formalpowerseries/pow.cpp
• formalpowerseries/shift.cpp
• formalpowerseries/sqrt.cpp

geometry/3D

• geometry/3D/geometry3D.cpp

geometry

• geometry/argsort.cpp
• geometry/geometry.cpp
• geometry/projectilemotion.cpp

graph

• graph/arborescence_edmond.cpp
• graph/arborescence_tarjan.cpp
• graph/bellmanford.cpp
• graph/bfs.cpp
• graph/bipartitedecomposition.cpp
• graph/chromatic.cpp
• graph/cycle.cpp
• graph/dijkstra.cpp
• graph/dominatortree.cpp
• graph/dynamicconnectivity.cpp
• graph/girth.cpp
• graph/grid.cpp
• graph/independentset.cpp
• graph/kruskal.cpp
• graph/lowlink.cpp
• graph/manhattanmst.cpp
• graph/multipleeuleriantrail.cpp
• graph/nicetree.cpp
• Range to Range (graph/rangetorange.cpp)
• graph/semikernel.cpp
• graph/stronglyconnectedcomponent.cpp
• graph/topologicalsort.cpp
• graph/triangle.cpp
• graph/twoedgeconnectedcomponents.cpp
• graph/twosatisfiability.cpp
• graph/voronoiminimumspanningtree.cpp

includes

• includes/formalpowerseries.h

io

• io/precision.cpp
• io/single.cpp
• io/space.cpp
• io/tuple.cpp
• io/yesno.cpp

linearalgebra

• linearalgebra/binarymatrix.cpp
• linearalgebra/matrix.cpp
• linearalgebra/squarematrix.cpp
• linearalgebra/tree_theorem.cpp

linkcuttree

• linkcuttree/base.cpp
• linkcuttree/farthest.cpp
• linkcuttree/path.cpp
• linkcuttree/subtree.cpp

matching

• matching/bipartite.cpp
• matching/hopcroft_karp.cpp
• matching/tutte.cpp

math

• math/affine.cpp
• math/bostanmori.cpp
• math/carmichael.cpp
• math/combination.cpp
• math/convertbase.cpp
• math/dual.cpp
• math/enumerate_primes.cpp
• math/extgcd.cpp
• math/factorize.cpp
• math/fraction.cpp
• math/isprime.cpp
• math/kitamasa.cpp
• math/linearcongruence.cpp
• math/linearfunction.cpp
• math/moebius.cpp
• math/quotients.cpp
• math/sum_of_floor.cpp
• math/sum_of_geometric_sequence.cpp
• math/tetrahedra.cpp
• math/totient.cpp
• math/totient_table.cpp
• math/twoway.cpp

maxflow

• 最大流 (maxflow/dinic.cpp)
• 最大流 (計算量が流量依存) (maxflow/fordfulkerson.cpp)
• 最小流量制限付き最大流 (maxflow/leastflow.cpp)
• 最大二品種流 (maxflow/twocommodity.cpp)

mincostflow

• 最小費用流の負辺除去 (mincostflow/negativeedge.cpp)
• 最小費用流 (mincostflow/primaldual.cpp)

mod

• mod/factorial.cpp
• mod/inverse.cpp
• mod/log.cpp
• mod/mint.cpp
• mod/montmort.cpp
• mod/order.cpp
• mod/pow.cpp
• mod/rint.cpp
• mod/sqrt.cpp
• mod/tetration.cpp

polynomial

• polynomial/berlekampmassey.cpp
• polynomial/hash.cpp
• polynomial/interpolate.cpp
• polynomial/lagrangeinterpolation.cpp
• polynomial/multieval.cpp
• polynomial/polynomial.cpp
• polynomial/recursivesequence.cpp

segtree/2d

• segtree/2d/ushi.cpp

segtree/basic

• segtree/basic/dual.cpp
• 遅延伝播セグメント木 (segtree/basic/lazy.cpp)
• segtree/basic/ushi.cpp

segtree/count

• segtree/count/dynamic_offline.cpp
• segtree/count/static.cpp

segtree/persistent

• segtree/persistent/ushi.cpp

segtree/types

• segtree/types/offline.cpp
• segtree/types/online.cpp

string

• string/ahocorasick.cpp
• string/editdistance.cpp
• string/knuthmorrispratt.cpp
• Longest Common Prefix (string/longestcommonprefix.cpp)
• string/longestcommonsubstring.cpp
• string/manacher.cpp
• string/morrispratt.cpp
• string/palindromictree.cpp
• string/parse.cpp
• string/rectanglehash.cpp
• string/rollinghash.cpp
• string/run.cpp
• string/split.cpp
• Suffix Array (string/suffixarray.cpp)
• string/trie.cpp
• string/zalgorithm.cpp

tools

• tools/all_permutations.cpp
• tools/avx2.cpp
• tools/bigint.cpp
• tools/cc_hash.cpp
• tools/chminmax.cpp
• tools/debug.cpp
• tools/defaultdict.cpp
• tools/dice.cpp
• tools/drop.cpp
• tools/fastio.cpp
• tools/fixpoint.cpp
• tools/gridbfs.cpp
• tools/int128.cpp
• tools/iskado.cpp
• tools/trio.cpp

toptree

• toptree/base.cpp
• toptree/distancesum.cpp
• toptree/farthest.cpp
• toptree/steiner.cpp
• Top Tree (toptree/toptree.cpp)

tree

• 根付き木の同型性判定 (tree/ahu.cpp)
• Auxiliary Tree (tree/auxiliarytree.cpp)
• tree/centroid.cpp
• tree/construct_from_distances_to_farthest_vertex.cpp
• tree/diameterforedge.cpp
• tree/diameterforvertex.cpp
• tree/eulertourforbfs.cpp
• tree/eulertourforedge.cpp
• tree/eulertourforvertex.cpp
• Heavy Light Decomposition (tree/heavylightdecomposition.cpp)
• tree/lca.cpp
• tree/levelancestor.cpp
• tree/lowestcommonancestor.cpp
• tree/mo_on_tree.cpp
• ReRooting (tree/rerooting.cpp)
• Sack (dsu on tree) (tree/sack.cpp)

vector

• vector/compress.cpp
• vector/fusion.cpp
• vector/identity.cpp
• vector/inversion.cpp
• vector/multi.cpp
• vector/near.cpp
• vector/powers.cpp
• vector/reversed.cpp
• vector/runlength.cpp
• vector/sorted.cpp
• vector/zip.cpp

Verification Files

test/aoj

• test/aoj/0109.test.cpp
• test/aoj/0168.test.cpp
• test/aoj/0233.test.cpp
• test/aoj/0294.test.cpp
• test/aoj/0314.test.cpp
• test/aoj/0343.test.cpp
• test/aoj/0367.linkcuttree.test.cpp
• test/aoj/0367.test.cpp
• test/aoj/0367.toptree.test.cpp
• test/aoj/0377.test.cpp
• test/aoj/0391.test.cpp
• test/aoj/0402.test.cpp
• test/aoj/0403.test.cpp
• test/aoj/0415.test.cpp
• test/aoj/0422.test.cpp
• test/aoj/0423.test.cpp
• test/aoj/0424.test.cpp
• test/aoj/0425.test.cpp
• test/aoj/0437.test.cpp
• test find_by_order, order_of_key (test/aoj/0438.test.cpp)
• test/aoj/0439.test.cpp
• test/aoj/0502.test.cpp
• test/aoj/0558.test.cpp
• test find_by_order (test/aoj/0563.test.cpp)
• test/aoj/0596.test.cpp
• test/aoj/0613.test.cpp
• test/aoj/1069.test.cpp
• test/aoj/1197.test.cpp
• test/aoj/1254.test.cpp
• test/aoj/1293.test.cpp
• test/aoj/1300.test.cpp
• test/aoj/1308.test.cpp
• test/aoj/1312.test.cpp
• test/aoj/1328.test.cpp
• test/aoj/1338.test.cpp
• test/aoj/1508.test.cpp
• test succ, pred (test/aoj/1549.test.cpp)
• test/aoj/1579.test.cpp
• test/aoj/1595.linkcuttree.test.cpp
• test/aoj/1595.test.cpp
• test/aoj/1595.toptree.test.cpp
• test/aoj/1599.test.cpp
• test/aoj/1607.test.cpp
• test/aoj/1613.test.cpp
• test/aoj/1615.test.cpp
• test/aoj/1630.test.cpp
• test/aoj/1642.test.cpp
• test/aoj/2060.test.cpp
• test/aoj/2187.test.cpp
• test/aoj/2212.test.cpp
• test/aoj/2222.test.cpp
• test/aoj/2230.test.cpp
• test/aoj/2235.test.cpp
• test/aoj/2257.test.cpp
• test/aoj/2270.test.cpp
• test/aoj/2286.test.cpp
• initialize potential (test/aoj/2290.test.cpp)
• test/aoj/2292.test.cpp
• test/aoj/2294.test.cpp
• test/aoj/2308.test.cpp
• test/aoj/2309.tarjan.test.cpp
• test/aoj/2309.test.cpp
• test link cut (test/aoj/2313.test.cpp)
• test/aoj/2324.test.cpp
• test/aoj/2328.test.cpp
• test/aoj/2359.test.cpp
• test/aoj/2370.test.cpp
• test/aoj/2397.test.cpp
• test/aoj/2405.test.cpp
• test/aoj/2415.knuthyao.test.cpp
• test/aoj/2415.test.cpp
• test/aoj/2444.test.cpp
• test/aoj/2446.test.cpp
• test/aoj/2450.linkcuttree.test.cpp
• test/aoj/2450.test.cpp
• test/aoj/2488.test.cpp
• test/aoj/2513.test.cpp
• test/aoj/2560.test.cpp
• test/aoj/2563.test.cpp
• test/aoj/2603.test.cpp
• test/aoj/2624.test.cpp
• test/aoj/2627.test.cpp
• Distance Sum (test/aoj/2636.test.cpp)
• test/aoj/2644.test.cpp
• test/aoj/2646.test.cpp
• test/aoj/2647.test.cpp
• test/aoj/2659.test.cpp
• Path & Subtree Queries (test/aoj/2667.test.cpp)
• test/aoj/2674.count.test.cpp
• test/aoj/2674.test.cpp
• lexicographical cost (test/aoj/2679.test.cpp)
• test/aoj/2687.test.cpp
• test lcp (test/aoj/2711.test.cpp)
• test/aoj/2720.test.cpp
• test MaxLineContainer (test/aoj/2725.linecontainer.test.cpp)
• test/aoj/2725.test.cpp
• test/aoj/2736.test.cpp
• test/aoj/2790.test.cpp
• test/aoj/2842.BIT2D.test.cpp
• test/aoj/2842.test.cpp
• test/aoj/2871.test.cpp
• test/aoj/2872.test.cpp
• test order_of_key (test/aoj/2890.test.cpp)
• test/aoj/2891.test.cpp
• test/aoj/2934.test.cpp
• test/aoj/2948.test.cpp
• test/aoj/2951.test.cpp
• test/aoj/2959.test.cpp
• test/aoj/2968.test.cpp
• test/aoj/2969.test.cpp
• test/aoj/2970.test.cpp
• test/aoj/2971.test.cpp
• test/aoj/2975.test.cpp
• test/aoj/2977.test.cpp
• test/aoj/2979.test.cpp
• test/aoj/2981.test.cpp
• test/aoj/2983.test.cpp
• test/aoj/2985.garner.test.cpp
• test/aoj/2985.test.cpp
• test/aoj/2995.test.cpp
• test/aoj/3024.test.cpp
• test/aoj/3033.test.cpp
• test/aoj/3035.test.cpp
• test/aoj/3037.test.cpp
• test/aoj/3047.test.cpp
• test/aoj/3053.test.cpp
• test/aoj/3058.test.cpp
• test/aoj/3062.test.cpp
• test/aoj/3063.test.cpp
• test MinLineContainer (test/aoj/3069.test.cpp)
• test/aoj/3072.test.cpp
• test/aoj/3073.test.cpp
• test/aoj/3074.test.cpp
• test/aoj/3081.test.cpp
• test/aoj/3084.test.cpp
• test/aoj/3086.test.cpp
• test/aoj/3102.test.cpp
• test query (test/aoj/3112.test.cpp)
• test order_of_key (test/aoj/3117.test.cpp)
• test/aoj/3120.test.cpp
• test/aoj/3138.test.cpp
• test/aoj/3142.test.cpp
• Farthest (with index) (test/aoj/3143.test.cpp)
• test/aoj/3148.test.cpp
• test/aoj/3168.test.cpp
• test/aoj/3179.test.cpp
• test/aoj/3183.test.cpp
• test/aoj/3198.test.cpp
• test/aoj/3208.test.cpp
• test/aoj/3213.test.cpp
• test/aoj/3506.test.cpp
• test/aoj/3518.test.cpp
• test/aoj/ALDS1_10_C.test.cpp
• test/aoj/ALDS1_14_B.knuthmorrispratt.test.cpp
• test/aoj/ALDS1_14_B.test.cpp
• test/aoj/ALDS1_14_C.test.cpp
• test/aoj/ALDS1_15_B.test.cpp
• test/aoj/ALDS1_1_C.test.cpp
• test/aoj/ALDS1_5_D.test.cpp
• test/aoj/ALDS1_9_C.test.cpp
• test/aoj/DPL_1_E.test.cpp
• test/aoj/DPL_3_B.test.cpp
• test/aoj/DPL_3_C.test.cpp
• test/aoj/DPL_5_A.test.cpp
• test/aoj/DPL_5_B.test.cpp
• test/aoj/DPL_5_C.test.cpp
• test/aoj/DPL_5_D.test.cpp
• test/aoj/DPL_5_E.test.cpp
• test/aoj/DPL_5_F.test.cpp
• test/aoj/DPL_5_G.test.cpp
• test/aoj/DPL_5_H.test.cpp
• test/aoj/DPL_5_I.test.cpp
• test/aoj/DPL_5_J.test.cpp
• test/aoj/DPL_5_K.test.cpp
• test/aoj/DPL_5_L.test.cpp
• test/aoj/DSL_1_A.quickfind.test.cpp
• test/aoj/DSL_1_A.test.cpp
• test/aoj/DSL_1_B.test.cpp
• test/aoj/DSL_2_B.test.cpp
• test/aoj/DSL_2_C.test.cpp
• test/aoj/DSL_2_D.test.cpp
• test/aoj/DSL_2_E.test.cpp
• test/aoj/DSL_2_F.bbst.test.cpp
• RMQ & RUQ (test/aoj/DSL_2_F.test.cpp)
• test/aoj/DSL_2_G.bbst.test.cpp
• test/aoj/DSL_2_H.bbst.test.cpp
• RMQ & RAQ (test/aoj/DSL_2_H.test.cpp)
• test/aoj/DSL_2_I.bbst.test.cpp
• RSQ & RUQ (test/aoj/DSL_2_I.test.cpp)
• test/aoj/DSL_3_D.cartesiantree.test.cpp
• test/aoj/DSL_3_D.disjointsparsetable.test.cpp
• test/aoj/DSL_3_D.slidingwindowaggregation.test.cpp
• test/aoj/DSL_3_D.sparsetable.test.cpp
• test/aoj/DSL_3_D.test.cpp
• test/aoj/GRL_1_A.test.cpp
• test/aoj/GRL_1_B.test.cpp
• test/aoj/GRL_2_A.test.cpp
• test/aoj/GRL_2_B.tarjan.test.cpp
• test/aoj/GRL_2_B.test.cpp
• test/aoj/GRL_3_A.test.cpp
• test/aoj/GRL_3_B.test.cpp
• test/aoj/GRL_5_A.linkcuttree.test.cpp
• test/aoj/GRL_5_A.test.cpp
• test/aoj/GRL_5_C.lca.test.cpp
• test/aoj/GRL_5_C.test.cpp
• test/aoj/GRL_5_D.linkcuttree.test.cpp
• test/aoj/GRL_5_D.test.cpp
• test/aoj/GRL_5_E.linkcuttree.test.cpp
• test/aoj/GRL_6_A.test.cpp
• test/aoj/GRL_6_B.test.cpp
• test/aoj/GRL_7_A.test.cpp
• test/aoj/ITP1_11_A.test.cpp
• test/aoj/ITP1_11_B.test.cpp
• test/aoj/ITP1_11_C.test.cpp
• test/aoj/ITP1_11_D.test.cpp
• test/aoj/NTL_1_A.test.cpp
• test/aoj/NTL_1_B.test.cpp
• test/aoj/NTL_1_D.test.cpp
• test/aoj/NTL_1_E.test.cpp
• test/aoj/NTL_2_A.test.cpp
• test/aoj/NTL_2_B.test.cpp
• test/aoj/NTL_2_C.test.cpp
• test/aoj/NTL_2_D.test.cpp
• test/aoj/NTL_2_E.test.cpp
• test/aoj/NTL_2_F.test.cpp

test/aoj/geometry

• test/aoj/geometry/2334.test.cpp
• test/aoj/geometry/2448.test.cpp
• test/aoj/geometry/2454.test.cpp
• test/aoj/geometry/3049.test.cpp
• test/aoj/geometry/3056.test.cpp
• test/aoj/geometry/CGL_1_A.test.cpp
• test/aoj/geometry/CGL_1_B.test.cpp
• test/aoj/geometry/CGL_1_C.test.cpp
• test/aoj/geometry/CGL_2_A.test.cpp
• test/aoj/geometry/CGL_2_B.test.cpp
• test/aoj/geometry/CGL_2_C.test.cpp
• test/aoj/geometry/CGL_2_D.test.cpp
• test/aoj/geometry/CGL_3_A.test.cpp
• test/aoj/geometry/CGL_3_B.test.cpp
• test/aoj/geometry/CGL_3_C.test.cpp
• test/aoj/geometry/CGL_4_A.test.cpp
• test/aoj/geometry/CGL_4_B.test.cpp
• test/aoj/geometry/CGL_4_C.test.cpp
• test/aoj/geometry/CGL_5_A.test.cpp
• test/aoj/geometry/CGL_6_A.test.cpp
• test/aoj/geometry/CGL_7_A.test.cpp
• test/aoj/geometry/CGL_7_D.test.cpp
• test/aoj/geometry/CGL_7_E.test.cpp
• test/aoj/geometry/CGL_7_F.test.cpp
• test/aoj/geometry/CGL_7_G.test.cpp
• test/aoj/geometry/CGL_7_H.test.cpp
• test/aoj/geometry/CGL_7_I.test.cpp

test/yosupo

• test/yosupo/assignment.test.cpp
• test/yosupo/associative_array.test.cpp
• test/yosupo/bernoulli_number.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/convolution_mod.test.cpp
• test/yosupo/convolution_mod_1000000007.garner.test.cpp
• test/yosupo/convolution_mod_1000000007.test.cpp
• test/yosupo/cycle_detection.test.cpp
• test/yosupo/discrete_logarithm_mod.test.cpp
• test/yosupo/dominatortree.test.cpp
• test/yosupo/dynamic_sequence_range_affine_range_sum.test.cpp
• test/yosupo/dynamic_tree_vertex_add_path_sum.test.cpp
• test/yosupo/dynamic_tree_vertex_add_subtree_sum.test.cpp
• test/yosupo/dynamic_tree_vertex_add_subtree_sum.toptree.test.cpp
• test/yosupo/dynamic_tree_vertex_set_path_composite.test.cpp
• test/yosupo/dynamic_tree_vertex_set_path_composite.toptree.test.cpp
• test/yosupo/enumerate_primes.test.cpp
• test/yosupo/enumerate_triangles.test.cpp
• test/yosupo/exp_of_formal_power_series.test.cpp
• test/yosupo/find_linear_recurrence.test.cpp
• test/yosupo/frequency_table_of_tree_distance.test.cpp
• test/yosupo/inv_of_formal_power_series.test.cpp
• test/yosupo/kth_root_integer.test.cpp
• test/yosupo/kth_term_of_linearly_recurrent_sequence.test.cpp
• test/yosupo/lca.linkcuttree.test.cpp
• test/yosupo/lca.test.cpp
• test/yosupo/line_add_get_min.test.cpp
• test/yosupo/log_of_formal_power_series.test.cpp
• test/yosupo/manhattanmst.test.cpp
• test/yosupo/many_aplusb.test.cpp
• test/yosupo/matrix_det.test.cpp
• test/yosupo/maximum_independent_set.test.cpp
• test/yosupo/min_cost_b_flow.test.cpp
• test/yosupo/montmort_number_mod.test.cpp
• test/yosupo/multipoint_evaluation.test.cpp
• test/yosupo/number_of_substrings.test.cpp
• test/yosupo/partition_function.test.cpp
• test/yosupo/persistent_queue.test.cpp
• test/yosupo/point_add_range_sum.test.cpp
• test/yosupo/point_add_rectangle_sum.test.cpp
• test/yosupo/point_set_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/queue_operate_all_composite.test.cpp
• test/yosupo/range_affine_range_sum.test.cpp
• test rquantile (test/yosupo/range_kth_smallest.test.cpp)
• test/yosupo/rectangle_sum.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/sort_points_by_argument.test.cpp
• test/yosupo/sqrt_mod.test.cpp
• test/yosupo/sqrt_of_formal_power_series.test.cpp
• test/yosupo/static_range_frequency.test.cpp
• test/yosupo/static_range_inversions_query.test.cpp
• test/yosupo/static_range_sum.test.cpp
• test/yosupo/staticrmq.disjointsparsetable.test.cpp
• test/yosupo/staticrmq.sparsetable.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/tetration_mod.test.cpp
• test/yosupo/tree_decomposition_width_2.test.cpp
• test/yosupo/tree_diameter.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_path_sum.test.cpp
• test/yosupo/vertex_add_subtree_sum.test.cpp
• test/yosupo/zalgorithm.test.cpp

test/yukicoder

• test/yukicoder/0022.test.cpp
• test/yukicoder/0104.test.cpp
• test/yukicoder/0143.test.cpp
• test/yukicoder/0206.test.cpp
• test/yukicoder/0222.test.cpp
• test/yukicoder/0399.test.cpp
• test/yukicoder/0444.test.cpp
• test/yukicoder/0472.test.cpp
• test/yukicoder/0771.test.cpp
• test/yukicoder/0831.test.cpp
• test/yukicoder/1013.test.cpp
• test/yukicoder/1504.test.cpp
• test/yukicoder/1580.test.cpp
• test/yukicoder/1665.test.cpp
• test quantile (test/yukicoder/1732.test.cpp)
• test/yukicoder/1923.test.cpp
• test rangefreq (test/yukicoder/1937.test.cpp)
• test/yukicoder/1948.test.cpp
• test/yukicoder/1950.test.cpp
• test/yukicoder/1973.test.cpp
• test/yukicoder/2063.test.cpp
• test/yukicoder/2085.test.cpp
• test/yukicoder/2113.test.cpp
• test/yukicoder/2125.test.cpp
• test/yukicoder/2147.test.cpp
• test/yukicoder/2520.test.cpp
• test/yukicoder/2587.test.cpp
• test/yukicoder/2600.test.cpp
• test/yukicoder/2744.test.cpp
• test/yukicoder/2772.test.cpp
• test/yukicoder/3211.test.cpp
• test/yukicoder/3227.test.cpp
• test GCDConvolution (test/yukicoder/3267.test.cpp)
• test/yukicoder/3277.test.cpp
• test/yukicoder/3354.test.cpp
• test/yukicoder/3405.test.cpp
• test/yukicoder/3407.test.cpp
• Minimum Steiner Tree (test/yukicoder/3453.test.cpp)
• test/yukicoder/3592.test.cpp
• test/yukicoder/3912.test.cpp
• test/yukicoder/3961.test.cpp
• test/yukicoder/4072.test.cpp
• test/yukicoder/4117.test.cpp
• test/yukicoder/4271.avx2.test.cpp
• test/yukicoder/4271.test.cpp
• test/yukicoder/4387.test.cpp
• test/yukicoder/4474.test.cpp
• test/yukicoder/4569.test.cpp
• test/yukicoder/4706.test.cpp
• test/yukicoder/4778.test.cpp
• test/yukicoder/4852.test.cpp
• test/yukicoder/4862.test.cpp
• test/yukicoder/4872.test.cpp
• test/yukicoder/4918.test.cpp
• test/yukicoder/4941.test.cpp
• test/yukicoder/5011.test.cpp
• test/yukicoder/5025.test.cpp
• test/yukicoder/5061.test.cpp
• test/yukicoder/5223.test.cpp
• test/yukicoder/5633.test.cpp
• test/yukicoder/6680.test.cpp
• test LCMConvolution (test/yukicoder/7107.test.cpp)
• test/yukicoder/9158.test.cpp