README.md

CP Reference Codes

My implementations of various data structures and algorithms for competitive programming.

Contents (GitHub links, main)

• 0-common
  • common.hpp
• 1-ds
  • ds_dsu.cpp
  • ds_erasable_pq.cpp
  • ds_fenwick.cpp
  • ds_li_chao.cpp
  • ds_merge_seg.cpp
  • ds_pbds.cpp
  • ds_segtree.cpp
  • ds_segtree_pst.cpp
• 2-graph
  • cc_bcc.cpp
  • cc_scc.cpp
  • dyncon_off.cpp
  • euler_circ.cpp
  • sat_2sat.cpp
  • sp_basic.cpp
  • sp_kth.cpp
• 3-tree
  • lca_sparse.cpp
  • tree_centroid.cpp
  • tree_hld.cpp
  • tree_vtree.cpp
  • tree_xchg.cpp
• 4-optimizations
  • assign_hung.cpp
  • flow_dinic.cpp
  • flow_hk.cpp
  • flow_mcmf.cpp
• 5-string
  • hash_rk.cpp
  • match_ac.cpp
  • match_kmp.cpp
  • match_z.cpp
  • pal_manacher.cpp
  • str_trie.cpp
  • suffix_sa.cpp
• 6-geometry
  • geom_ang_sort.cpp
  • geom_base.cpp
  • geom_bulldozer.cpp
  • geom_calipers.cpp
  • geom_hpi.cpp
  • geom_hull.cpp
  • geom_mec.cpp
  • geom_raycast.cpp
  • geom_seg_inter.cpp
• 7-math
  • comb_binom.cpp
  • comb_cat_der.cpp
  • conv_fft.cpp
  • linalg_gauss.cpp
  • linalg_mat.cpp
  • misc_sqrt.cpp
  • modint.hpp
  • nt_crt.cpp
  • nt_euclid.cpp
  • nt_mr_rho.cpp
  • nt_sieve.cpp
  • num.hpp
• 8-misc
  • dp_opt.cpp
  • diff_cons.cpp
  • num_frac.cpp
  • random_facts.txt
  • rec_kitamasa.cpp
  • rnd.cpp
  • search_ternary.cpp
  • seq_lis.cpp
  • simd.cpp
  • sqrt_mo.cpp
  • stress_test.py