文件名称：算法实现：竞争性编程算法实现
文件大小：77KB
文件格式：ZIP
更新时间：2024-02-26 04:09:47
algorithm algorithms competitive-programming data-structures implementation-of-algorithms
算法实现：竞争性编程算法实现
【文件预览】：
algorithm-implementations-master
----graph()
--------strongly_connected.cpp(742B)
--------dfs.cpp(343B)
--------bridge_articulation.cpp(1KB)
--------hld.cpp(3KB)
--------eulerian_path.cpp(307B)
--------union_find.cpp(1011B)
--------dijkstra.cpp(516B)
--------lca_binary_lifting.cpp(1KB)
--------hungarian.cpp(2KB)
--------centroid_decomposition.cpp(795B)
--------bfs.cpp(352B)
--------biconnected_component.cpp(1KB)
--------maximum_clique.cpp(565B)
--------kruskal.cpp(836B)
--------dinic.cpp(2KB)
----dynamic_programming()
--------knapsack_unbounded.cpp(498B)
--------subset_sums.cpp(1KB)
--------knapsack_01.cpp(485B)
--------knapsack_bounded.cpp(1KB)
--------divide_and_conquer.cpp(737B)
--------lcs.cpp(816B)
--------lis.cpp(828B)
--------knapsack_bitset.cpp(711B)
----LICENSE(6KB)
----data_structures()
--------bit2d.cpp(410B)
--------bit.cpp(375B)
--------li_chao.cpp(2KB)
--------merge_sort_tree.cpp(1018B)
--------seg2d.cpp(3KB)
--------wavelet.cpp(2KB)
--------bit_build.cpp(1KB)
--------seg.cpp(1KB)
--------euler_tour_tree.cpp(7KB)
--------meldable_heap.cpp(743B)
--------minqueue_sum.cpp(1KB)
--------treap.cpp(3KB)
--------splay.cpp(4KB)
--------wavelet_static.cpp(1KB)
--------trie_xor.cpp(808B)
--------minqueue.cpp(481B)
--------mo_hilbert.cpp(4KB)
--------treap_impl.cpp(5KB)
--------treap_build.cpp(1KB)
--------merge_sort_tree_upd.cpp(3KB)
--------persistent_treap.cpp(2KB)
--------mo.cpp(882B)
--------sparse_table.cpp(711B)
--------trie.cpp(788B)
--------seg_iter.cpp(1KB)
--------sqrttree.cpp(2KB)
--------persistent_seg_dinamic.cpp(2KB)
--------seg_class.cpp(3KB)
----geometry()
--------convex_hull.cpp(1KB)
--------point.cpp(468B)
--------rectangle_union.cpp(2KB)
----math()
--------compute_wheel.cpp(728B)
--------bigint.cpp(19KB)
--------inverse.cpp(2KB)
--------segmented_sieve.cpp(1KB)
--------sieve.cpp(427B)
--------fast_modcheck.cpp(424B)
--------fast_ilog.cpp(857B)
--------inv.cpp(458B)
--------linear_phi.cpp(493B)
--------prime_count.cpp(2KB)
--------segmented_sieve_bit.cpp(2KB)
--------pisano.cpp(2KB)
--------wheel_factorization.cpp(855B)
--------discrete_log.cpp(753B)
--------linear_mobius.cpp(520B)
--------fast_pollard_rho.cpp(5KB)
--------rabin_miller_bench.cpp(2KB)
--------linear_sieve.cpp(465B)
--------matrix_expo.cpp(1KB)
--------phi.cpp(493B)
--------binary_perm.cpp(523B)
--------linear_sieve_ext.cpp(552B)
--------brent.cpp(842B)
--------rabin_miller.cpp(890B)
--------gcdext.cpp(481B)
--------determinant.cpp(2KB)
--------pollard_rho.cpp(2KB)
--------binary_gcd.cpp(460B)
--------choose.cpp(627B)
--------carmichael.cpp(6KB)
----.gitignore(95B)
----string()
--------prefix.cpp(766B)
--------manacher.cpp(1KB)
--------hash.cpp(774B)
--------suffix_array.cpp(2KB)
--------aho_corasick.cpp(2KB)
----README.md(86B)
----etc()
--------bitset_extra.cpp(359B)
--------fast_input.cpp(2KB)
--------compression.cpp(715B)
--------seed_random.cpp(355B)