rcpl

Library Files

algebra/acted_monoid

• algebra/acted_monoid/acted_monoid_inversion01_flip.hpp
• algebra/acted_monoid/acted_monoid_max01_flip.hpp
• algebra/acted_monoid/acted_monoid_max_assign.hpp
• algebra/acted_monoid/acted_monoid_max_index_plus.hpp
• algebra/acted_monoid/acted_monoid_max_plus.hpp
• algebra/acted_monoid/acted_monoid_min_assign.hpp
• algebra/acted_monoid/acted_monoid_min_index_plus.hpp
• algebra/acted_monoid/acted_monoid_min_plus.hpp
• algebra/acted_monoid/acted_monoid_plus_affine.hpp
• algebra/acted_monoid/acted_monoid_plus_assign.hpp
• algebra/acted_monoid/acted_monoid_plus_plus.hpp
• algebra/acted_monoid/acted_monoid_product_sum_add2.hpp

algebra/monoid

• algebra/monoid/monoid_affine.hpp
• algebra/monoid/monoid_and.hpp
• algebra/monoid/monoid_assign.hpp
• algebra/monoid/monoid_gcd.hpp
• algebra/monoid/monoid_max.hpp
• algebra/monoid/monoid_max_index.hpp
• algebra/monoid/monoid_min.hpp
• algebra/monoid/monoid_min_index.hpp
• algebra/monoid/monoid_or.hpp
• algebra/monoid/monoid_plus.hpp
• monoid_rolling_hash (algebra/monoid/monoid_rolling_hash.hpp)
• algebra/monoid/monoid_times.hpp
• algebra/monoid/monoid_xor.hpp

algebra

• algebra/monoid_template.hpp
• algebra/value_index.hpp

convolution

• convolution/bitwise_and_convolution.hpp
• convolution/bitwise_or_convolution.hpp
• Fast Zeta / Mobius Transform (高速ゼータ変換・高速メビウス変換) (convolution/fast_zeta_mobius_transform.hpp)

data_structure

• 累積和 (data_structure/cumulative_sum.hpp)
• 2次元累積和 (data_structure/cumulative_sum_2d.hpp)
• 斜め累積和 (data_structure/cumulative_sum_diag.hpp)
• Dice (サイコロ) (data_structure/dice.hpp)
• Erasable Priority Queue (削除可能優先度付きキュー) (data_structure/erasable_priority_queue.hpp)
• Matrix (行列) (data_structure/matrix.hpp)
• 区間の k 番目に小さい値を求めるクエリ (data_structure/range_kth_smallest.hpp)
• Static Matrix (行列, サイズ固定) (data_structure/static_matrix.hpp)

.

• debug.hpp
• my_template.hpp
• my_template_int128.hpp

dp

• Histogram Largest Rectangle (ヒストグラムの最大長方形) (dp/histogram_largest_rectangle.hpp)
• Inversion Number (転倒数) (dp/inversion_number.hpp)
• Knapsack Limitations (個数制限付きナップサック問題) (dp/knapsack_limitations.hpp)
• Levenshtein Distance (レーベンシュタイン距離) (dp/levenshtein_distance.hpp)
• Longest Common Subsequence (最長共通部分列) (dp/longest_common_subsequence.hpp)
• Longest Increasing Subsequence (最長増加部分列) (dp/longest_increasing_subsequence.hpp)
• Meet in the middle (半分全列挙) (dp/meet_in_the_middle.hpp)
• Sliding Window Minimum (スライド最小値) (dp/sliding_window_minimum.hpp)

enumerate

• $ 0 \leq p_{i} < a_{i} $ を満たす整数列 $p$ の列挙 (enumerate/enumerate_product.hpp)

geometry

• geometry/all.hpp
• Circle (円) (geometry/circle.hpp)
• Circumscribed Circle (外接円) (geometry/circumscribed_circle.hpp)
• Closest Pair (最近点対) (geometry/closest_pair.hpp)
• Common Area (共通部分の面積) (geometry/common_area.hpp)
• Contain (多角形や円と点の位置関係) (geometry/contain.hpp)
• Convex Hull (凸包) (geometry/convex_hull_monotone_chain.hpp)
• Convex Polygon Cut (凸多角形の直線での切断) (geometry/convex_polygon_cut.hpp)
• Convex Polygon Diameter (凸多角形の直径) (geometry/convex_polygon_diameter.hpp)
• Cross Point (交点) (geometry/cross_point.hpp)
• Distance (距離) (geometry/distance.hpp)
• Farthest Pair (最遠点対) (geometry/farthest_pair.hpp)
• 幾何テンプレート (geometry/geometry_template.hpp)
• Incircle (内接円) (geometry/incircle.hpp)
• Intersection (交差判定) (geometry/is_intersect.hpp)
• Line / Segment (直線・線分) (geometry/line.hpp)
• Point (点) (geometry/point.hpp)
• Polygon (多角形) (geometry/polygon.hpp)
• Tangent (接線) (geometry/tangent.hpp)

graph

• Auxiliary Tree (虚树) (graph/auxiliary_tree.hpp)
• Bellman-Ford algorithm (ベルマンフォード法) (graph/bellman_ford.hpp)
• Dijkstra's algorithm (ダイクストラ法) (graph/dijkstra.hpp)
• Euler Tour (オイラーツアー) (graph/euler_tour.hpp)
• グラフテンプレート (graph/graph_template.hpp)
• Heavy-Light Decomposition (重軽分解) (graph/heavy_light_decomposition.hpp)
• Kruskal's algorithm (クラスカル法) (graph/kruskal.hpp)
• Low Link (関節点・橋) (graph/low_link.hpp)
• Lowest Common Ancestor (最小共通祖先) (graph/lowest_common_ancestor.hpp)
• Minimum Steiner Tree (最小シュタイナー木) (graph/minimum_steiner_tree.hpp)
• グラフ入力ライブラリ (graph/read_graph.hpp)
• Restore path (graph/restore_path.hpp)
• Shortest Path Tree (最短経路木) (graph/shortest_path_tree.hpp)
• Strongly Connected Component (強連結成分) (graph/strongly_connected_component.hpp)
• Topological Sort (トポロジカルソート) (graph/topological_sort.hpp)
• Traveling Salesman Problem (巡回セールスマン問題) (graph/traveling_salesman_problem.hpp)
• Tree Diameter (木の直径) (graph/tree_diameter.hpp)
• Warshall-Floyd algorithm (ワーシャルフロイド法) (graph/warshall_floyd.hpp)
• 01-BFS (graph/zero_one_bfs.hpp)

icpc

• icpc/binary_trie.hpp
• icpc/binomal.hpp
• icpc/dice.hpp
• icpc/lca.hpp
• icpc/matrix.hpp
• icpc/modint.hpp
• icpc/ntt.hpp
• icpc/scc.hpp
• icpc/segtree.hpp
• icpc/template.hpp
• icpc/uf.hpp

math

• math/baby_step_giant_step.hpp
• Binomial (二項係数ライブラリ) (math/binomial.hpp)
• Chinese Remainder Theorem (中国剰余定理) (math/chinese_remainder_theorem.hpp)
• math/divisor.hpp
• Dynamic Modint (math/dynamic_modint.hpp)
• math/enumerate_primes.hpp
• math/extended_gcd.hpp
• Gauss-Jordan elimination (ガウスジョルダンの掃き出し法) (math/gauss_jordan_elimination.hpp)
• math/inv_mod.hpp
• 線形ディオファントス方程式 ($ ax + by = c $) / 線形合同式 ( $ ax \equiv b \pmod m $ ) (math/linear_diophantine.hpp)
• Linear Equation (線形方程式) (math/linear_equation.hpp)
• Modint $\pmod{2^{61}-1} $ (math/modint261.hpp)
• math/osak.hpp
• math/pow_mod.hpp
• math/prime_factor.hpp
• math/prime_table.hpp
• math/quotient_enumeration.hpp
• Static Modint (math/static_modint.hpp)
• math/totient.hpp
• math/totient_table.hpp

misc

• Bit Ceil (misc/bit_ceil.hpp)
• Countl Zero (misc/countl_zero.hpp)
• Countr Zero (misc/countr_zero.hpp)
• misc/custom_hash.hpp
• Lowbit (misc/lowbit.hpp)
• Mo's Algorithm (misc/mo.hpp)
• Popcount (misc/popcount.hpp)
• misc/timer.hpp
• TopTwo (misc/top_two.hpp)
• Topbit (misc/topbit.hpp)
• misc/xor_shift.hpp

random

• Random (random/base.hpp)

segment_tree

• Dual Segment Tree (双対セグメント木) (segment_tree/dual_segment_tree.hpp)
• Dynamic Segment Tree (動的セグメント木) (segment_tree/dynamic_segment_tree.hpp)
• Segment Tree の 1 点変更や区間総積を行う際にアクセスするノード番号の列挙 (segment_tree/enumerate_segment_tree_nodes.hpp)
• segment_tree/fenwick_tree.hpp
• Lazy Segment Tree (遅延セグメント木) (segment_tree/lazy_segment_tree.hpp)
• Persistent Segment Tree (永続セグメント木) (segment_tree/persistent_segment_tree.hpp)
• Segment Tree (セグメント木) (segment_tree/segment_tree.hpp)
• 2D Segment Tree (2 次元セグメント木) (segment_tree/segment_tree_2d.hpp)
• Segment Tree (再帰 + ポインタ木) (segment_tree/segment_tree_recursion.hpp)

string

• 回文判定 (string/is_palindrome.hpp)
• Next Element Index (次の各要素の登場位置) (string/next_element_index.hpp)
• Rolling Hash (ローリングハッシュ) (string/rolling_hash.hpp)
• Run Length Encoding (ランレングス圧縮) (string/run_length_encoding.hpp)
• Trie (トライ木) (string/trie.hpp)
• string/z_algorithm.hpp

unionfind

• Potentialized Unionfind（重み付き Unionfind） (unionfind/potentialized_unionfind.hpp)
• Unionfind (unionfind/unionfind.hpp)

Verification Files

data_structure/test

• data_structure/test/erasable_priority_queue.test.cpp
• data_structure/test/range_kth_smallest.test.cpp

dp/test

• dp/test/inversion_number.test.cpp

enumerate/test

• enumerate/test/enumerate_product.test.cpp

misc/test

• misc/test/bit_operation.test.cpp
• misc/test/top_two.test.cpp

random/test

• random/test/base.test.cpp

segment_tree/test

• segment_tree/test/dual_segment_tree_assign.test.cpp
• segment_tree/test/dual_segment_tree_plus.test.cpp
• segment_tree/test/dynamic_segment_tree.test.cpp
• segment_tree/test/enumerate_segment_tree_nodes.test.cpp
• segment_tree/test/fenwick_tree_plus.test.cpp
• segment_tree/test/lazy_segment_tree_inversion01_flip.test.cpp
• segment_tree/test/lazy_segment_tree_max01_flip.test.cpp
• segment_tree/test/lazy_segment_tree_min_assign.test.cpp
• segment_tree/test/lazy_segment_tree_min_index_plus.test.cpp
• segment_tree/test/lazy_segment_tree_min_plus.test.cpp
• segment_tree/test/lazy_segment_tree_plus_assign.test.cpp
• segment_tree/test/lazy_segment_tree_plus_plus.test.cpp
• segment_tree/test/lazy_segment_tree_product_sum_add2.test.cpp
• segment_tree/test/lazy_segment_tree_sum_affine.test.cpp
• segment_tree/test/segment_tree_2d.test.cpp
• segment_tree/test/segment_tree_and.test.cpp
• segment_tree/test/segment_tree_gcd.test.cpp
• segment_tree/test/segment_tree_min.test.cpp
• segment_tree/test/segment_tree_or.test.cpp
• segment_tree/test/segment_tree_plus.test.cpp
• segment_tree/test/segment_tree_recursion.test.cpp
• segment_tree/test/segment_tree_rolling_hash.test.cpp
• segment_tree/test/segment_tree_times.test.cpp
• segment_tree/test/segment_tree_xor.test.cpp

unionfind/test

• unionfind/test/potentialized_unionfind.test.cpp
• unionfind/test/potentialized_unionfind_groups.test.cpp
• unionfind/test/unionfind.test.cpp
• unionfind/test/unionfind_groups.test.cpp

verify/aoj_alds1

• verify/aoj_alds1/aoj_alds1_1_c.test.cpp
• verify/aoj_alds1/aoj_alds1_1_c_osa_k.test.cpp

verify/aoj_dpl

• verify/aoj_dpl/aoj_dpl_1_g.test.cpp
• verify/aoj_dpl/aoj_dpl_3_c.test.cpp

verify/aoj_dsl

• verify/aoj_dsl/aoj_dsl_3_d.test.cpp
• verify/aoj_dsl/aoj_dsl_5_b.test.cpp

verify/aoj_itp1

• verify/aoj_itp1/aoj_itp1_3_d.test.cpp

verify/aoj_ntl

• verify/aoj_ntl/aoj_ntl_1_a.test.cpp
• verify/aoj_ntl/aoj_ntl_1_b.test.cpp
• verify/aoj_ntl/aoj_ntl_1_d.test.cpp
• verify/aoj_ntl/aoj_ntl_1_e.test.cpp

verify/aoj_other

• verify/aoj_other/aoj_0360.test.cpp
• verify/aoj_other/aoj_2286.test.cpp
• verify/aoj_other/aoj_2703.test.cpp
• verify/aoj_other/aoj_2748.test.cpp
• verify/aoj_other/aoj_2751.test.cpp
• verify/aoj_other/aoj_3206.test.cpp

verify/dp

• verify/dp/levenshtein_distance.test.cpp
• verify/dp/longest_common_subsequence.test.cpp
• verify/dp/longest_increasing_subsequence.test.cpp

verify/geometry

• verify/geometry/area.test.cpp
• verify/geometry/ccw.test.cpp
• verify/geometry/circumscribed_circle.test.cpp
• verify/geometry/closest_pair.test.cpp
• verify/geometry/common_area_cc.test.cpp
• verify/geometry/common_area_cp.test.cpp
• verify/geometry/compare_atan2.test.cpp
• verify/geometry/contain.test.cpp
• verify/geometry/convex_contain.test.cpp
• verify/geometry/convex_hull_monotone_chain_1.test.cpp
• verify/geometry/convex_hull_monotone_chain_2.test.cpp
• verify/geometry/convex_polygon_cut.test.cpp
• verify/geometry/convex_polygon_diameter.test.cpp
• verify/geometry/cross_point_cc.test.cpp
• verify/geometry/cross_point_cl.test.cpp
• verify/geometry/cross_point_ss.test.cpp
• verify/geometry/distance_ss.test.cpp
• verify/geometry/incircle.test.cpp
• verify/geometry/is_convex.test.cpp
• verify/geometry/is_intersect_ss.test.cpp
• verify/geometry/is_orthogonal_is_parallel.test.cpp
• verify/geometry/projection.test.cpp
• verify/geometry/reflection.test.cpp
• verify/geometry/tangent_cc.test.cpp
• verify/geometry/tangent_cp.test.cpp
• verify/geometry/tangent_number.test.cpp

verify/graph

• verify/graph/auxiliary_tree.test.cpp
• verify/graph/bellman_ford.test.cpp
• verify/graph/dijkstra_1.test.cpp
• verify/graph/dijkstra_2.test.cpp
• verify/graph/euler_tour.test.cpp
• verify/graph/heavy_light_decomposition_path_add_path_sum.test.cpp
• verify/graph/heavy_light_decomposition_vertex_add_path_sum.test.cpp
• verify/graph/heavy_light_decomposition_vertex_add_subtree_sum.test.cpp
• verify/graph/kruskal.test.cpp
• verify/graph/low_link_1.test.cpp
• verify/graph/low_link_2.test.cpp
• verify/graph/lowest_common_ancestor_1.test.cpp
• verify/graph/lowest_common_ancestor_2.test.cpp
• verify/graph/minimum_steiner_tree.test.cpp
• verify/graph/strongly_connected_component_1.test.cpp
• verify/graph/strongly_connected_component_2.test.cpp
• verify/graph/topological_sort.test.cpp
• verify/graph/topological_sort_lexicographical_order.test.cpp
• verify/graph/traveling_salesman_problem.test.cpp
• verify/graph/tree_diameter_1.test.cpp
• verify/graph/tree_diameter_2.test.cpp
• verify/graph/warshall_floyd.test.cpp
• verify/graph/zero_one_bfs.test.cpp

verify/lc_data_structure

• verify/lc_data_structure/lc_static_range_sum.test.cpp

verify/lc_math

• verify/lc_math/lc_enumerate_primes.test.cpp

verify/misc

• verify/misc/mo.test.cpp

verify/string

• verify/string/rolling_hash.test.cpp

verify/yuki

• verify/yuki/yuki_186_chinese_remainder_theorem.test.cpp