cpp_lib

Library Files

combinatorics/

• Combinatorics(組合せ数学) (combinatorics/combinatorics.cpp)
• nCr mod p ($r \leq 10^7$, クエリ $O(1)$ or $O(r)$) (combinatorics/ncr2.cpp)
• combinatorics/npr.cpp
• nCr mod p ($n > p$) (combinatorics/small_p_ncr.cpp)

dp/

• 2D-Cumulative-Sum( $2$ 次元累積和) (dp/2d_cumulative_sum.cpp)
• Doubling(ダブリング) (dp/doubling.cpp)
• ヒストグラム上の最大長方形 (dp/largest_histogram_rectangle.cpp)
• LCS(最長共通部分列) (dp/lcs.cpp)
• levenshtein_distance(編集距離) (dp/levenshtein_distance.cpp)
• LIS(最長増加部分列) (dp/lis.cpp)

graph/

• Centroid Decomposition (木の重心分解) (graph/centroid_decomposition.cpp)
• Dijkstra(経路復元付ダイクストラ) (graph/dijkstra.cpp)
• maxflow(最大流) (graph/maxflow.cpp)
• mincostflow(最小費用流) (graph/mincostflow.cpp)
• mincostflow_nega(最小費用流) (graph/mincostflow_nega.cpp)
• Topological-Sort(トポロジカルソート) (graph/topological_sort.cpp)
• Union-Find木 (graph/union_find.cpp)

math/

• Binary-Power(繰り返し二乗法) (math/binpow.cpp)
• Chinese-Remainder-Theorem(中国剰余定理) (math/chinese_remainder_theorem.cpp)
• Divisor(約数列挙) (math/divisor.cpp)
• extgcd(拡張ユークリッドの互除法) (math/extgcd.cpp)
• Factorial(階乗) (math/factorial.cpp)
• Garner's Algorithm (math/garner.cpp)
• Inversion-Number(転倒数) (math/inversion_number.cpp)
• Isprime(素数判定) (math/isprime.cpp)
• Millor-Rabin(ミラー・ラビン素数判定法) (math/millor_rabin.cpp)
• math/montgomery.cpp
• Prime-Factorization(素因数分解) (math/primefact.cpp)
• Sieve-of-Eratosthenes(エラトステネスの篩) (math/sieve_of_eratosthenes.cpp)

mod/

• ModInt (mod/modint.cpp)

string/

• KMP algorithm (string/kmp.cpp)
• Manacher's Algorithm(最長回文) (string/manacher.cpp)
• Rolling-Hash (string/rolling_hash.cpp)
• Suffix Array (SA-IS) (string/suffix_array.cpp)
• Z-Algorithm(最長共通接頭辞) (string/z_algorithm.cpp)

structure/

• 2D-Array( $2$ 次元配列) (structure/2d_array.cpp)
• Matrix(行列) (structure/matrix.cpp)
• Segment Set(区間をsetで管理するやつ) (structure/segment_set.cpp)

tree/

• binary_indexed_tree(BIT) (tree/binary_indexed_tree.cpp)
• segtree(セグメント木) (tree/segtree.cpp)
• segtree_lazy(遅延評価セグメント木) (tree/segtree_lazy.cpp)

Verification Files

test/

• test/aoj_0019.cpp
• test/aoj_0116.cpp
• test/aoj_0341.cpp
• test/aoj_0560.cpp
• test/aoj_2429.cpp
• test/aoj_2880.cpp
• test/aoj_2932.cpp
• test/aoj_ALDS1_10_C.cpp
• test/aoj_ALDS1_14_B.cpp
• test/aoj_ALDS1_14_B_rollingHash.cpp
• test/aoj_ALDS1_14_D.cpp
• test/aoj_ALDS1_1_B.cpp
• test/aoj_ALDS1_1_C_Sieve.cpp
• test/aoj_ALDS1_1_C_isprime.cpp
• test/aoj_ALDS1_1_C_millorRabin.cpp
• test/aoj_ALDS1_5_D.cpp
• test/aoj_DPL_1_D.cpp
• test/aoj_DPL_1_E.cpp
• test/aoj_DPL_3_C.cpp
• test/aoj_DPL_5_D.cpp
• test/aoj_DPL_5_E.cpp
• test/aoj_DPL_5_E_noset_n.cpp
• test/aoj_DSL_1_A.cpp
• test/aoj_DSL_2_A.cpp
• test/aoj_DSL_2_F.cpp
• test/aoj_DSL_2_H.cpp
• test/aoj_GRL_1_A.cpp
• test/aoj_GRL_4_B.cpp
• test/aoj_GRL_6_A.cpp
• test/aoj_GRL_6_B.cpp
• test/aoj_GRL_6_B_nega.cpp
• test/aoj_GRL_7_A.cpp
• test/aoj_ITP1_6_B.cpp
• test/aoj_ITP1_7_D.cpp
• test/aoj_NTL_1_A_Sieve.cpp
• test/aoj_NTL_1_A_primefact.cpp
• test/aoj_NTL_1_B.cpp
• test/aoj_NTL_1_E.cpp
• test/atc_abc167_d.cpp
• test/atc_abc175_d.cpp
• test/atc_abc291_ex.cpp
• test/atc_abc315_g.cpp
• test/atc_arc117_c.cpp
• test/atc_nikkei2019-qual_d.cpp
• test/cf_321_c.cpp
• test/yosupo_enumerate_palindromes.cpp
• test/yosupo_primality_test.cpp
• test/yosupo_shortest_path.cpp
• test/yosupo_static_range_sum.cpp
• test/yosupo_static_range_sum_BIT.cpp
• test/yosupo_staticrmq.cpp
• test/yosupo_suffixarray.cpp
• test/yosupo_unionfind.cpp
• test/yosupo_zalgorithm.cpp
• test/yuki_0117.cpp
• test/yuki_0177.cpp
• test/yuki_0186.cpp
• test/yuki_0187.cpp
• test/yuki_0430.cpp
• test/yuki_0497.cpp
• test/yuki_0556.cpp
• test/yuki_0599.cpp
• test/yuki_0674.cpp
• test/yuki_0888.cpp
• test/yuki_1013.cpp
• test/yuki_1035.cpp
• test/yuki_1097.cpp
• test/yuki_1301.cpp