文件名称：竞争性编程资料库：过去几年中使用的竞争性编程模板
文件大小：88KB
文件格式：ZIP
更新时间：2024-02-25 23:51:15
hashing algorithms string matching graphs
竞争性编程资料库：过去几年中使用的竞争性编程模板
【文件预览】：
Competitive-Programming-Repository-master
----LICENSE(1KB)
----src()
--------all_pair_shortest_path_binary_exponentation.cpp(2KB)
--------fast_readInt_writeInt_function.cpp(938B)
--------misc()
--------linear_recurrence_matrix_exponentiation.cpp(2KB)
--------binary_trie_max_xor.cpp(2KB)
--------palindrome_longest_subsequence.cpp(1KB)
--------connected_component_in_graph.cpp(713B)
--------dynamic_string_using_treap.cpp(6KB)
--------mobeius_function.cpp(939B)
--------merge_sort_trees_order_stat_query.cpp(2KB)
--------number_paths_length_k.cpp(1KB)
--------orderstat_rank_query_augmented_bst.cpp(1KB)
--------lucas_combinatorics.cpp(429B)
--------scanline_merge_overlapping_intervals.cpp(514B)
--------fast_fourier_transform_fft.cpp(1KB)
--------segment_tree_persistent.cpp(3KB)
--------max_flow_network_dinic_algorithm.cpp(1KB)
--------cycle_detection_in_graph.cpp(1KB)
--------binary_indexed_tree_order_stat.cpp(1KB)
--------segment_trees_interative_fast.cpp(637B)
--------heavy_light_decomposition_wieghted_vertices(hld).cpp(5KB)
--------segment_tree_dynamic_using_treaps.cpp(4KB)
--------range_minimum_query_sparse_table.cpp(2KB)
--------segmented_sieve_large_primes.cpp(736B)
--------karatsuba_polynomial_multiplication.cpp(2KB)
--------power_binary_exponentiation.cpp(351B)
--------kruskal_min_spanning_tree.cpp(2KB)
--------primality_check_fermat.cpp(1KB)
--------untested-codes()
--------dijkstra_using_priority_queue.cpp(1KB)
--------segement_trees_max_index_element_in_l_r_greater_than_k.cpp(2KB)
--------disjoint_set.cpp(769B)
--------binary_indexed_tree_range_query_range_update.cpp(2KB)
--------KMP.cpp(790B)
--------bigint_library.cpp(6KB)
--------trie_insertion_deleteion.cpp(803B)
--------string_hashing_dynamic_segment_trees.cpp(3KB)
--------segment_tree_range_query_point_update.cpp(2KB)
--------clean.bat(28B)
--------bellman_ford.cpp(1KB)
--------prime_sieve.cpp(519B)
--------binary_indexed_tree.cpp(1KB)
--------kth_shortest_path_between_nodes_graph.cpp(916B)
--------max_bipartite_matching_hopcroft_karp.cpp(902B)
--------merge_sort_trees.cpp(2KB)
--------segment_tree_persistent_order_stat.cpp(4KB)
--------path_nearly_complete_binary_tree.cpp(778B)
--------non_bipartite_check.cpp(739B)
--------ternary_search.cpp(527B)
--------trees_path_query_sparse_tables.cpp(4KB)
--------string_hashing.cpp(2KB)
--------tree_dfs_preorder_postorder_isInSubtree.cpp(1KB)
--------closest_max_element_before_after_index_using_stack.cpp(1KB)
--------heap_using_multiset_max_min_insert_erase_update.cpp(1KB)
--------factorial_preprocessing.cpp(846B)
--------int2string_string2int.cpp(588B)
--------heavy_light_decomposition_weighted_edges (hld).cpp(13KB)
--------aggreate_sqrt_distinct_values.cpp(718B)
--------isConnected_using_bfs.cpp(540B)
--------linearize_tree_subtree_aggregate_query.cpp(513B)
--------dijsktra_dense_graphs.cpp(874B)
--------convexhull.cpp(1KB)
--------monotone_priority_queue.cpp(446B)
--------disjoint_set_with_undo_operation.cpp(1KB)
--------segment_tree_dynamic_reverse_subarray_using_treap.cpp(4KB)
--------aggregate_cyclic_function.cpp(2KB)
--------bitmask.cpp(419B)
--------tree_diameter.cpp(1KB)
--------multiply_detect_overflow.cpp(815B)
--------topological_sort_kosaraju.cpp(796B)
--------subtree size and level.cpp(482B)
--------segment_tree_custom_merge_function.cpp(2KB)
--------mo_algorithm_offline_range_query.cpp(2KB)
--------obselete()
--------Z_algorithm_max_prefix_match.cpp(1KB)
--------longest_increasing_subsequence_lis_binary_search.cpp(765B)
--------quick_select_order_stat_linear.cpp(1KB)
--------kth_ancestor_tree.cpp(1KB)
--------edit_distance_levenstein_dynamic_programming.cpp(812B)
--------euler_phi_euler_totient_function.cpp(2KB)
--------segment_tree_2D.cpp(5KB)
--------lowest_common_ancestor_lca.cpp(2KB)
--------strongly_connected_components_kosaraju.cpp(2KB)
--------generate_all_palindromes.cpp(1KB)
--------merge_sort_count_inversion.cpp(1KB)
--------binary_indexed_tree_2D.cpp(2KB)
--------bridges_in_graph.cpp(2KB)
--------dynamic_programming_templates.cpp(4KB)
--------all_pair_shortest_path_floyd_warshall.cpp(1KB)
--------prime_factor_count.cpp(718B)
--------rabin_karp.cpp(1KB)
--------segment_tree_range_query_range_update_lazy_propogation.cpp(3KB)
--------multiply_longlong_integers.cpp(331B)
----.gitignore(61B)
----README.md(13KB)