CompetitiveProgramming

Library Files

kyopro/Source

• kyopro/Source/Source.cpp

kyopro/library/algorithm

• longest-increasing-subsequence(dp) (kyopro/library/algorithm/LIS_dp.cpp)

kyopro/library/datastructure/BBST

• kyopro/library/datastructure/BBST/splaytree.cpp

kyopro/library/datastructure

• binary-indexed-tree (kyopro/library/datastructure/BIT.cpp)
• lazy-segment-tree (kyopro/library/datastructure/lazysegtree.cpp)
• segment-tree (kyopro/library/datastructure/segtree.cpp)
• segment-tree-2D (kyopro/library/datastructure/segtree_2D.cpp)
• set_enumerate (kyopro/library/datastructure/set_enumerate.cpp)
• sparse-table (kyopro/library/datastructure/sparsetable.cpp)
• unionfind (kyopro/library/datastructure/unionfind.cpp)

kyopro/library/geometry

• vector(2D) (kyopro/library/geometry/vector2D.cpp)

kyopro/library/graph

• lowest-common-ancestor (kyopro/library/graph/LCA.cpp)
• lowest-common-ancestor(weighted) (kyopro/library/graph/LCA_weighted.cpp)
• dijkstra (kyopro/library/graph/dijkstra.cpp)
• dijkstra(経路復元) (kyopro/library/graph/dijkstra_path.cpp)
• euler-tour (kyopro/library/graph/eulertour.cpp)
• template(graph) (kyopro/library/graph/graph_template.cpp)
• kth-shortest-path(yen's algorithm) (kyopro/library/graph/kth-shortest-path_yen.cpp)
• strongly connected components(強連結成分分解) (kyopro/library/graph/scc.cpp)
• topological-sort (kyopro/library/graph/topological_sort.cpp)
• tree diameter(木の直径) (kyopro/library/graph/tree-diameter.cpp)
• warshallfloyd (kyopro/library/graph/warshallfloyd.cpp)

kyopro/library/math

• combination (kyopro/library/math/Comb.cpp)
• 高速素因数分解 (kyopro/library/math/fast-prime_factor.cpp)
• gcd-lcm (kyopro/library/math/gcd_lcm.cpp)
• kth_permutation (kyopro/library/math/kth_permutation.cpp)
• kyopro/library/math/prime_factor.cpp

kyopro/library/others

• 累積和 (kyopro/library/others/cumulative-sum.cpp)
• doubling (kyopro/library/others/doubling.cpp)
• Mo's Algorithm (kyopro/library/others/mo.cpp)
• modint (kyopro/library/others/modint.cpp)

kyopro/library/template

• template (kyopro/library/template/template.cpp)

Verification Files

kyopro/test

• kyopro/test/BIT_yosupo-judge.test.cpp
• kyopro/test/LCA_weighted_yukicoder.test.cpp
• kyopro/test/LCA_yosupo-judge.test.cpp
• kyopro/test/LIS_dp_aoj.test.cpp
• kyopro/test/binary_search_on_segtree_yosupo-judge.test.cpp
• kyopro/test/cumulative-sum_yosupo-judge.test.cpp
• kyopro/test/dijkstra_aoj.test.cpp
• kyopro/test/dijkstra_path_yosupo-judge.test.cpp
• kyopro/test/kth-shortest-path_yen_yukicoder.test.cpp
• kyopro/test/lazysegtree_yosupo-judge.test.cpp
• kyopro/test/lcm_aoj.test.cpp
• kyopro/test/mo_yosupo-judge.test.cpp
• kyopro/test/scc-cg_aoj.test.cpp
• kyopro/test/scc_aoj.test.cpp
• kyopro/test/scc_yosupo-judge.test.cpp
• kyopro/test/segtree_2D_yosupo-judge.test.cpp
• kyopro/test/segtree_yosupo-judge.test.cpp
• kyopro/test/set_enumerate.test.cpp
• kyopro/test/sparsetable_yosupo-judge.test.cpp
• kyopro/test/template_yosupo-judge.test.cpp
• kyopro/test/tree-diameter_aoj.test.cpp
• kyopro/test/tree-diameter_yosupo-judge.test.cpp
• kyopro/test/unionfind_yosupo-judge.test.cpp
• kyopro/test/vector2D_yukicoder.test.cpp
• kyopro/test/warshallfloyd_aoj.test.cpp