Fu_L's Library

競プロ用ライブラリです．
g++/C++20で書かれています．

Library Files

src/convolution

• and_convolution (src/convolution/and_convolution.hpp)
• convolution (src/convolution/convolution.hpp)
• convolution_arbitrary (src/convolution/convolution_arbitrary.hpp)
• convolution_ll (src/convolution/convolution_ll.hpp)
• gcd_convolution (src/convolution/gcd_convolution.hpp)
• lcm_convolution (src/convolution/lcm_convolution.hpp)
• or_convolution (src/convolution/or_convolution.hpp)
• xor_convolution (src/convolution/xor_convolution.hpp)

src/data_structure

• BinaryTrie (src/data_structure/binary_trie.hpp)
• ConvexHullTrick (src/data_structure/convex_hull_trick.hpp)
• CumulativeSum2D (src/data_structure/cumulative_sum_2d.hpp)
• DisjointSparseTable (src/data_structure/disjoint_sparse_table.hpp)
• DynamicLiChaoTree (src/data_structure/dynamic_li_chao_tree.hpp)
• FenwickTree (src/data_structure/fenwick_tree.hpp)
• FenwickTree2D (src/data_structure/fenwick_tree_2d.hpp)
• FenwickTreeonWaveletMatrix (src/data_structure/fenwick_tree_on_wavelet_matrix.hpp)
• LazySegmentTree (src/data_structure/lazy_segment_tree.hpp)
• Mo (src/data_structure/mo.hpp)
• RectangleSum (src/data_structure/rectangle_sum.hpp)
• RollbackUnionFind (src/data_structure/rollback_union_find.hpp)
• SegmentSet (src/data_structure/segment_set.hpp)
• SegmentTree (src/data_structure/segment_tree.hpp)
• SlideWindowAggregation (src/data_structure/slide_window_aggregation.hpp)
• SlideWindowAggregationDeque (src/data_structure/slide_window_aggregation_deque.hpp)
• SortedSet (src/data_structure/sorted_set.hpp)
• SparseTable (src/data_structure/sparse_table.hpp)
• SparseTable2D (src/data_structure/sparse_table_2d.hpp)
• UnionFind (src/data_structure/union_find.hpp)
• WaveletMatrix (src/data_structure/wavelet_matrix.hpp)
• WeightedUnionFind (src/data_structure/weighted_union_find.hpp)

src/dp

• longest_increasing_sequence (src/dp/longest_increasing_sequence.hpp)

src/fps

• all_product (src/fps/all_product.hpp)
• berlekamp_massey (src/fps/berlekamp_massey.hpp)
• bostan_mori (src/fps/bostan_mori.hpp)
• FormalPowerSeries (src/fps/formal_power_series.hpp)
• FormalPowerSeriesArbitrary (src/fps/formal_power_series_arbitrary.hpp)
• FormalPowerSeriesLL (src/fps/formal_power_series_ll.hpp)
• nth_term (src/fps/nth_term.hpp)

src/geometry

• circle_2d (src/geometry/circle_2d.hpp)
• line_and_segment_2d (src/geometry/line_and_segment_2d.hpp)
• point_2d (src/geometry/point_2d.hpp)
• polygon_2d (src/geometry/polygon_2d.hpp)
• template (src/geometry/template.hpp)

src/graph

• bfs (src/graph/bfs.hpp)
• bfs01 (src/graph/bfs01.hpp)
• BiconnectedComponents (src/graph/biconnected_components.hpp)
• bipartite (src/graph/bipartite.hpp)
• CompressedSparseRow (src/graph/compressed_sparse_row.hpp)
• counting_spanning_tree_directed (src/graph/counting_spanning_tree_directed.hpp)
• counting_spanning_tree_undirected (src/graph/counting_spanning_tree_undirected.hpp)
• cycle_detection (src/graph/cycle_detection.hpp)
• dijkstra (src/graph/dijkstra.hpp)
• Graph (src/graph/graph_template.hpp)
• kruskal (src/graph/kruskal.hpp)
• LowLink (src/graph/low_link.hpp)
• MaxFlow (src/graph/max_flow.hpp)
• max_matching (src/graph/max_matching.hpp)
• MinCostFlow (src/graph/min_cost_flow.hpp)
• strongly_connected_components (src/graph/strongly_connected_components.hpp)
• topological_sort (src/graph/topological_sort.hpp)
• TwoEdgeConnectedComponents (src/graph/two_edge_connected_components.hpp)

src/math

• Binomial (src/math/binomial.hpp)
• chinese_remainder_theorem (src/math/chinese_remainder_theorem.hpp)
• divisor (src/math/divisor.hpp)
• Divisor/MultipleTransform (src/math/divisor_multiple_transform.hpp)
• EratosthenesSieve (src/math/eratosthenes_sieve.hpp)
• euler_phi (src/math/euler_phi.hpp)
• extgcd (src/math/extgcd.hpp)
• floor_sum (src/math/floor_sum.hpp)
• inv_gcd (src/math/inv_gcd.hpp)
• is_prime (src/math/is_prime.hpp)
• log_mod (src/math/log_mod.hpp)
• Lucas (src/math/lucas.hpp)
• miller_rabin (src/math/miller_rabin.hpp)
• moebius (src/math/moebius.hpp)
• pow_mod (src/math/pow_mod.hpp)
• prime_factors (src/math/prime_factors.hpp)
• primitive_root (src/math/primitive_root.hpp)
• TwoSAT (src/math/two_sat.hpp)
• walsh_hadamard_transform (src/math/walsh_hadamard_transform.hpp)
• xor_base (src/math/xor_base.hpp)
• zeta_transform (src/math/zeta_transform.hpp)

src/matrix

• gauss_elimination (src/matrix/gauss_elimination.hpp)
• inverse (src/matrix/inverse.hpp)
• linear_equation (src/matrix/linear_equation.hpp)
• Matrix (src/matrix/matrix.hpp)

src/others

• dice (src/others/dice.hpp)

src/random

• PermutedCongruentialGenerator (src/random/permuted_congruential_generator.hpp)
• RandomNumberGenerator (src/random/random_number_generator.hpp)

src/string

• AhoCorasick (src/string/aho_corasick.hpp)
• DynamicRollingHash (src/string/dynamic_rolling_hash.hpp)
• manacher (src/string/manacher.hpp)
• RollingHash (src/string/rolling_hash.hpp)
• suffix_array (src/string/suffix_array.hpp)
• Trie (src/string/trie.hpp)
• wildcard_pattern_matching (src/string/wildcard_pattern_matching.hpp)
• z_algorithm (src/string/z_algorithm.hpp)

src/template

• debug (src/template/debug.hpp)
• DynamicModint (src/template/dynamic_modint.hpp)
• Modint_2_61m1 (src/template/modint_2_61m1.hpp)
• policy_based_data_structure (src/template/policy_based_data_structure.hpp)
• StaticModint (src/template/static_modint.hpp)
• template (src/template/template.hpp)

src/tree

• cartesian_tree (src/tree/cartesian_tree.hpp)
• centroid (src/tree/centroid.hpp)
• centroid_decomposition (src/tree/centroid_decomposition.hpp)
• HeavyLightDecomposition (src/tree/heavy_light_decomposition.hpp)
• LowestCommonAncestor (src/tree/lowest_common_ancestor.hpp)
• rerooting (src/tree/rerooting.hpp)
• rooted_tree_hash (src/tree/rooted_tree_hash.hpp)
• tree_diameter (src/tree/tree_diameter.hpp)

Verification Files

verify/aizu_online_judge/alds1

• verify/aizu_online_judge/alds1/prime_numbers.test.cpp
• verify/aizu_online_judge/alds1/prime_numbers_2.test.cpp
• verify/aizu_online_judge/alds1/string_search.test.cpp

verify/aizu_online_judge/cgl

• verify/aizu_online_judge/cgl/area.test.cpp
• verify/aizu_online_judge/cgl/area_of_intersection_between_two_circles.test.cpp
• verify/aizu_online_judge/cgl/circumscribed_circle_of_a_triangle.test.cpp
• verify/aizu_online_judge/cgl/closest_pair.test.cpp
• verify/aizu_online_judge/cgl/common_tangent.test.cpp
• verify/aizu_online_judge/cgl/convex_cut.test.cpp
• verify/aizu_online_judge/cgl/convex_hull.test.cpp
• verify/aizu_online_judge/cgl/counter_clockwise.test.cpp
• verify/aizu_online_judge/cgl/cross_point.test.cpp
• verify/aizu_online_judge/cgl/cross_points_of_a_circle_and_a_line.test.cpp
• verify/aizu_online_judge/cgl/cross_points_of_circles.test.cpp
• verify/aizu_online_judge/cgl/diameter_of_a_convex_polygon.test.cpp
• verify/aizu_online_judge/cgl/distance.test.cpp
• verify/aizu_online_judge/cgl/incircle_of_a_triangle.test.cpp
• verify/aizu_online_judge/cgl/intersection.test.cpp
• verify/aizu_online_judge/cgl/intersection_circle.test.cpp
• verify/aizu_online_judge/cgl/intersection_of_a_circle_and_a_polygon.test.cpp
• verify/aizu_online_judge/cgl/is_convex.test.cpp
• verify/aizu_online_judge/cgl/parallel_orthogonal.test.cpp
• verify/aizu_online_judge/cgl/polygon_point_containment.test.cpp
• verify/aizu_online_judge/cgl/projection.test.cpp
• verify/aizu_online_judge/cgl/reflection.test.cpp
• verify/aizu_online_judge/cgl/tangent_to_a_circle.test.cpp

verify/aizu_online_judge/dsl

• verify/aizu_online_judge/dsl/the_maximum_number_of_overlaps.test.cpp
• verify/aizu_online_judge/dsl/the_maximum_number_of_overlaps_2.test.cpp
• verify/aizu_online_judge/dsl/weighted_union_find_trees.test.cpp

verify/aizu_online_judge/grl

• verify/aizu_online_judge/grl/articulation_points.test.cpp
• verify/aizu_online_judge/grl/bipartite_matching.test.cpp
• verify/aizu_online_judge/grl/bridges.test.cpp
• verify/aizu_online_judge/grl/cycle_detection_for_a_directed_graph.test.cpp
• verify/aizu_online_judge/grl/diameter_of_a_tree.test.cpp
• verify/aizu_online_judge/grl/height_of_a_tree.test.cpp
• verify/aizu_online_judge/grl/lowest_common_ancestor.test.cpp
• verify/aizu_online_judge/grl/maximum_flow.test.cpp
• verify/aizu_online_judge/grl/minimum_cost_flow.test.cpp
• verify/aizu_online_judge/grl/minimum_spanning_tree.test.cpp
• verify/aizu_online_judge/grl/range_query_on_a_tree.test.cpp
• verify/aizu_online_judge/grl/range_query_on_a_tree_2.test.cpp
• verify/aizu_online_judge/grl/single_source_shortest_path.test.cpp
• verify/aizu_online_judge/grl/strongly_connected_components.test.cpp

verify/aizu_online_judge/itp1

• verify/aizu_online_judge/itp1/how_many_divisors.test.cpp

verify/aizu_online_judge/ntl

• verify/aizu_online_judge/ntl/eulers_phi_function.test.cpp
• verify/aizu_online_judge/ntl/extended_euclid_algorithm.test.cpp
• verify/aizu_online_judge/ntl/power.test.cpp
• verify/aizu_online_judge/ntl/prime_factorize.test.cpp

verify/aizu_online_judge/others

• verify/aizu_online_judge/others/0502.test.cpp
• verify/aizu_online_judge/others/1645.test.cpp

verify/library_checker/convolution

• verify/library_checker/convolution/bitwise_and_convolution.test.cpp
• verify/library_checker/convolution/bitwise_xor_convolution.test.cpp
• verify/library_checker/convolution/convolution.test.cpp
• verify/library_checker/convolution/convolution_mod_1000000007.test.cpp
• verify/library_checker/convolution/gcd_convolution.test.cpp
• verify/library_checker/convolution/lcm_convolution.test.cpp

verify/library_checker/data_structure

• verify/library_checker/data_structure/deque_operate_all_composite.test.cpp
• verify/library_checker/data_structure/line_add_get_min.test.cpp
• verify/library_checker/data_structure/point_add_range_sum.test.cpp
• verify/library_checker/data_structure/point_add_rectangle_sum.test.cpp
• verify/library_checker/data_structure/point_set_range_composite.test.cpp
• verify/library_checker/data_structure/predecessor_problem.test.cpp
• verify/library_checker/data_structure/queue_operate_all_composite.test.cpp
• verify/library_checker/data_structure/range_affine_point_get.test.cpp
• verify/library_checker/data_structure/range_affine_range_sum.test.cpp
• verify/library_checker/data_structure/range_kth_smallest.test.cpp
• verify/library_checker/data_structure/rectangle_sum.test.cpp
• verify/library_checker/data_structure/segment_add_get_min.test.cpp
• verify/library_checker/data_structure/set_xor_min.test.cpp
• verify/library_checker/data_structure/static_range_frequency.test.cpp
• verify/library_checker/data_structure/static_range_inversions_query.test.cpp
• verify/library_checker/data_structure/static_range_sum.test.cpp
• verify/library_checker/data_structure/static_rmq.test.cpp
• verify/library_checker/data_structure/static_rmq_2.test.cpp
• verify/library_checker/data_structure/unionfind.test.cpp
• verify/library_checker/data_structure/unionfind_with_potential.test.cpp

verify/library_checker/enumerative_combinatrics

• verify/library_checker/enumerative_combinatrics/binomial_coefficient_prime_mod.test.cpp
• verify/library_checker/enumerative_combinatrics/counting_spanning_tree_directed.test.cpp
• verify/library_checker/enumerative_combinatrics/counting_spanning_tree_undirected.test.cpp

verify/library_checker/geometry

• verify/library_checker/geometry/sort_points_by_argument.test.cpp

verify/library_checker/graph

• verify/library_checker/graph/assignment_problem.test.cpp
• verify/library_checker/graph/biconnected_components.test.cpp
• verify/library_checker/graph/cycle_detection_directed.test.cpp
• verify/library_checker/graph/cycle_detection_undirected.test.cpp
• verify/library_checker/graph/matching_on_bipartite_graph.test.cpp
• verify/library_checker/graph/matching_on_general_graph.test.cpp
• verify/library_checker/graph/minimum_spanning_tree.test.cpp
• verify/library_checker/graph/shortest_path.test.cpp
• verify/library_checker/graph/strongly_connected_components.test.cpp
• verify/library_checker/graph/two_edge_connected_components.test.cpp

verify/library_checker/linear_algebra

• verify/library_checker/linear_algebra/determinant_of_matric.test.cpp
• verify/library_checker/linear_algebra/inverse_matrix.test.cpp
• verify/library_checker/linear_algebra/matrix_product.test.cpp
• verify/library_checker/linear_algebra/pow_of_matrix.test.cpp
• verify/library_checker/linear_algebra/rank_of_matrix.test.cpp
• verify/library_checker/linear_algebra/system_of_linear_equations.test.cpp

verify/library_checker/number_theory

• verify/library_checker/number_theory/discrete_logarithm.test.cpp
• verify/library_checker/number_theory/primality_test.test.cpp
• verify/library_checker/number_theory/sum_of_floor_of_linear.test.cpp

verify/library_checker/other

• verify/library_checker/other/2_sat.test.cpp
• verify/library_checker/other/find_linear_recurrence.test.cpp
• verify/library_checker/other/kth_term_of_linearly_recurrent_sequence.test.cpp
• verify/library_checker/other/longest_increasing_sequence.test.cpp

verify/library_checker/polynomial

• verify/library_checker/polynomial/division_of_polynomial.test.cpp
• verify/library_checker/polynomial/exp_of_formal_power_series.test.cpp
• verify/library_checker/polynomial/inv_of_formal_power_series.test.cpp
• verify/library_checker/polynomial/log_of_formal_power_series.test.cpp
• verify/library_checker/polynomial/polynomial_taylor_shift.test.cpp
• verify/library_checker/polynomial/pow_of_formal_power_series.test.cpp
• verify/library_checker/polynomial/product_of_polynomial_sequence.test.cpp

verify/library_checker/string

• verify/library_checker/string/enumerate_palindromes.test.cpp
• verify/library_checker/string/number_of_substrings.test.cpp
• verify/library_checker/string/number_of_substrings_2.test.cpp
• verify/library_checker/string/suffix_array.test.cpp
• verify/library_checker/string/wildcard_pattern_matching.test.cpp
• verify/library_checker/string/z_algorithm.test.cpp

verify/library_checker/tree

• verify/library_checker/tree/cartesian_tree.test.cpp
• verify/library_checker/tree/frequency_table_of_tree_distance.test.cpp
• verify/library_checker/tree/jump_on_tree.test.cpp
• verify/library_checker/tree/jump_on_tree_2.test.cpp
• verify/library_checker/tree/lowest_common_ancestor.test.cpp
• verify/library_checker/tree/rooted_tree_isomorphism_classification.test.cpp
• verify/library_checker/tree/tree_diameter.test.cpp
• verify/library_checker/tree/tree_path_composite_sum.test.cpp
• verify/library_checker/tree/vertex_add_path_sum.test.cpp
• verify/library_checker/tree/vertex_add_subtree_sum.test.cpp
• verify/library_checker/tree/vertex_set_path_composite.test.cpp

verify/unit_test/convolution

• verify/unit_test/convolution/convolution_ll.test.cpp
• verify/unit_test/convolution/or_convolution.test.cpp

verify/unit_test/data_structure

• verify/unit_test/data_structure/sparse_table_2d.test.cpp

verify/unit_test/graph

• verify/unit_test/graph/bfs.test.cpp
• verify/unit_test/graph/bfs01.test.cpp
• verify/unit_test/graph/bipartite.test.cpp

verify/unit_test/math

• verify/unit_test/math/eratosthenes_sieve.test.cpp
• verify/unit_test/math/lucas.test.cpp

verify/unit_test/string

• verify/unit_test/string/dynamic_rolling_hash.test.cpp

verify/unit_test/template

• verify/unit_test/template/debug.test.cpp

verify/unit_test/tree

• verify/unit_test/tree/centroid.test.cpp

verify/yukicoder

• verify/yukicoder/1559.test.cpp
• verify/yukicoder/184.test.cpp
• verify/yukicoder/186.test.cpp
• verify/yukicoder/430.test.cpp
• verify/yukicoder/649.test.cpp