rcpl

Library Files

algebra/monoid_f

• algebra/monoid_f/monoid_add.hpp
• algebra/monoid_f/monoid_affine.hpp
• algebra/monoid_f/monoid_flip.hpp
• algebra/monoid_f/monoid_set.hpp

algebra/monoid_s

• algebra/monoid_s/monoid_gcd.hpp
• algebra/monoid_s/monoid_max.hpp
• algebra/monoid_s/monoid_max_index.hpp
• algebra/monoid_s/monoid_min.hpp
• algebra/monoid_s/monoid_min_index.hpp
• ローリングハッシュ (algebra/monoid_s/monoid_rolling_hash.hpp)
• algebra/monoid_s/monoid_sum.hpp
• algebra/monoid_s/monoid_sum_size.hpp
• algebra/monoid_s/monoid_xor.hpp

algebra/monoid_s_f

• algebra/monoid_s_f/monoid_inversion_flip.hpp
• algebra/monoid_s_f/monoid_max01_flip.hpp
• algebra/monoid_s_f/monoid_max_add.hpp
• algebra/monoid_s_f/monoid_max_index_add.hpp
• algebra/monoid_s_f/monoid_max_index_set.hpp
• algebra/monoid_s_f/monoid_max_set.hpp
• algebra/monoid_s_f/monoid_min_add.hpp
• algebra/monoid_s_f/monoid_min_index_add.hpp
• algebra/monoid_s_f/monoid_min_index_set.hpp
• algebra/monoid_s_f/monoid_min_set.hpp
• algebra/monoid_s_f/monoid_sum_size_add.hpp
• algebra/monoid_s_f/monoid_sum_size_affine.hpp
• algebra/monoid_s_f/monoid_sum_size_set.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)
• Dual Segment Tree (双対セグメント木) (data_structure/dual_segment_tree.hpp)
• Segment Tree の 1 点変更や区間総積を行う際にアクセスするノード番号の列挙 (data_structure/enumerate_segment_tree_nodes.hpp)
• Erasable Priority Queue (削除可能優先度付きキュー) (data_structure/erasable_priority_queue.hpp)
• Fenwick Tree (Binary Indexed Tree) (data_structure/fenwick_tree.hpp)
• Lazy Segment Tree (遅延セグメント木) (data_structure/lazy_segment_tree.hpp)
• Matrix (行列) (data_structure/matrix.hpp)
• Segment Tree (セグメント木) (data_structure/segment_tree.hpp)
• 2D Segment Tree (2次元セグメント木) (data_structure/segment_tree_2d.hpp)
• Static Matrix (行列, サイズ固定) (data_structure/static_matrix.hpp)
• UnionFind (data_structure/unionfind.hpp)
• Weighted UnionFind (重みつき UnionFind) (data_structure/weighted_unionfind.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)
• Meet in the middle (半分全列挙) (dp/meet_in_the_middle.hpp)
• Sliding Window Minimum (スライド最小値) (dp/sliding_window_minimum.hpp)
• Traveling Salesman Problem (巡回セールスマン問題) (dp/traveling_salesman_problem.hpp)

geometry

• geometry/all.hpp
• geometry/ccw.hpp
• geometry/circle.hpp
• geometry/circumscribed_circle.hpp
• 最近点対 (geometry/closest_pair.hpp)
• geometry/convex_polygon_cut.hpp
• geometry/convex_polygon_diameter.hpp
• geometry/cross_point_cc.hpp
• geometry/cross_point_cl.hpp
• geometry/cross_point_ll.hpp
• geometry/cross_point_ss.hpp
• geometry/distance_lp.hpp
• geometry/distance_sp.hpp
• geometry/distance_ss.hpp
• 最遠点対 (geometry/farthest_pair.hpp)
• geometry/incircle.hpp
• geometry/is_intersect_cc.hpp
• geometry/is_intersect_cl.hpp
• geometry/is_intersect_cp.hpp
• geometry/is_intersect_ll.hpp
• geometry/is_intersect_lp.hpp
• geometry/is_intersect_sp.hpp
• geometry/is_intersect_ss.hpp
• geometry/is_orthogonal.hpp
• geometry/is_parallel.hpp
• geometry/line.hpp
• geometry/monotone_chain.hpp
• geometry/point.hpp
• geometry/polygon.hpp
• geometry/polygon_area.hpp
• geometry/polygon_contain.hpp
• geometry/polygon_is_convex.hpp
• geometry/projection.hpp
• geometry/reflection.hpp
• geometry/segment.hpp
• geometry/tangent_number_cc.hpp
• geometry/tangent_point_cp.hpp

graph

• Bellman-Ford algorithm (ベルマンフォード法) (graph/bellman_ford.hpp)
• Dijkstra's algorithm (ダイクストラ法) (graph/dijkstra.hpp)
• Euler Tour (オイラーツアー) (graph/euler_tour.hpp)
• graph/get_edges.hpp
• graph/graph_template.hpp
• Kruskal's algorithm (クラスカル法) (graph/kruskal.hpp)
• Low Link (関節点・橋) (graph/low_link.hpp)
• Lowest Common Ancestor (最小共通祖先) (graph/lowest_common_ancestor.hpp)
• graph/read_graph.hpp
• Shortest Path Tree (最短経路木) (graph/shortest_path_tree.hpp)
• Strongly Connected Component (強連結成分) (graph/strongly_connected_component.hpp)
• Topological Sort (トポロジカルソート) (graph/topological_sort.hpp)
• Tree Diameter (木の直径) (graph/tree_diameter.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
• math/enumerate_primes.hpp
• math/extended_gcd.hpp
• math/inv_mod.hpp
• 線形ディオファントス方程式 ($ ax + by = c $) / 線形合同式 ( $ ax \equiv b \pmod m $ ) (math/linear_diophantine.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/static_modint.hpp
• math/totient.hpp
• math/totient_table.hpp

misc

• misc/custom_hash.hpp
• Mo's Algorithm (misc/mo.hpp)
• misc/timer.hpp
• misc/xor_shift.hpp

string

• string/rolling_hash.hpp
• Run Length Encoding (ランレングス圧縮) (string/run_length_encoding.hpp)

Verification Files

verify/aoj_alds1

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

verify/aoj_cgl

• verify/aoj_cgl/aoj_cgl_1_a.test.cpp
• verify/aoj_cgl/aoj_cgl_1_b.test.cpp
• verify/aoj_cgl/aoj_cgl_1_c.test.cpp
• verify/aoj_cgl/aoj_cgl_2_a.test.cpp
• verify/aoj_cgl/aoj_cgl_2_b.test.cpp
• verify/aoj_cgl/aoj_cgl_2_c.test.cpp
• verify/aoj_cgl/aoj_cgl_2_d.test.cpp
• verify/aoj_cgl/aoj_cgl_3_a.test.cpp
• verify/aoj_cgl/aoj_cgl_3_b.test.cpp
• verify/aoj_cgl/aoj_cgl_3_c.test.cpp
• verify/aoj_cgl/aoj_cgl_4_a.test.cpp
• verify/aoj_cgl/aoj_cgl_4_b.test.cpp
• verify/aoj_cgl/aoj_cgl_4_c.test.cpp
• verify/aoj_cgl/aoj_cgl_5_a.test.cpp
• verify/aoj_cgl/aoj_cgl_7_a.test.cpp
• verify/aoj_cgl/aoj_cgl_7_b.test.cpp
• verify/aoj_cgl/aoj_cgl_7_c.test.cpp
• verify/aoj_cgl/aoj_cgl_7_d.test.cpp
• verify/aoj_cgl/aoj_cgl_7_e.test.cpp
• verify/aoj_cgl/aoj_cgl_7_f.test.cpp

verify/aoj_dpl

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

verify/aoj_dsl

• verify/aoj_dsl/aoj_dsl_1_b.test.cpp
• verify/aoj_dsl/aoj_dsl_2_d_dual_segment_tree.test.cpp
• verify/aoj_dsl/aoj_dsl_2_e_dual_segment_tree.test.cpp
• verify/aoj_dsl/aoj_dsl_2_f_lazy_segment_tree.test.cpp
• verify/aoj_dsl/aoj_dsl_2_g_lazy_segment_tree.test.cpp
• verify/aoj_dsl/aoj_dsl_2_h_lazy_segment_tree.test.cpp
• verify/aoj_dsl/aoj_dsl_2_i_lazy_segment_tree.test.cpp
• verify/aoj_dsl/aoj_dsl_3_d.test.cpp
• verify/aoj_dsl/aoj_dsl_5_b.test.cpp

verify/aoj_grl

• verify/aoj_grl/aoj_grl_1_b.test.cpp
• verify/aoj_grl/aoj_grl_2_a.test.cpp
• verify/aoj_grl/aoj_grl_3_a.test.cpp
• verify/aoj_grl/aoj_grl_3_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_1068.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/lc_data_structure

• verify/lc_data_structure/lc_point_add_range_sum_fenwick_tree.test.cpp
• verify/lc_data_structure/lc_point_add_range_sum_segment_tree.test.cpp
• verify/lc_data_structure/lc_range_affine_range_sum.test.cpp
• verify/lc_data_structure/lc_static_range_inversions_query.test.cpp
• verify/lc_data_structure/lc_static_range_sum.test.cpp
• verify/lc_data_structure/lc_static_rmq_segment_tree.test.cpp
• verify/lc_data_structure/lc_unionfind.test.cpp

verify/lc_graph

• verify/lc_graph/lc_scc.test.cpp
• verify/lc_graph/lc_shortest_path_dijkstra.test.cpp

verify/lc_math

• verify/lc_math/lc_enumerate_primes.test.cpp

verify/lc_other

• verify/lc_other/lc_aplusb_compare_arg.test.cpp

verify/lc_tree

• verify/lc_tree/lc_lowest_common_ancestor.test.cpp
• verify/lc_tree/lc_tree_diameter.test.cpp

verify/yuki

• verify/yuki/yuki_1036_segment_tree.test.cpp
• verify/yuki/yuki_186_chinese_remainder_theorem.test.cpp