Skip to content

nachiketkanore/CP-Snippets

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

112 Commits
.github/workflows
.github/workflows
 
 
Convex Hull Trick
Convex Hull Trick
 
 
FFT
FFT
 
 
LiChao
LiChao
 
 
Problems
Problems
 
 
Stress Testing
Stress Testing
 
 
Test_Generation
Test_Generation
 
 
Testcases_generator_specific
Testcases_generator_specific
 
 
segtree
segtree
 
 
sublime_snippets
sublime_snippets
 
 
test-cases-generator
test-cases-generator
 
 
2DBIT.cc
2DBIT.cc
 
 
Binary_lifting_walk_some_distance.cpp
Binary_lifting_walk_some_distance.cpp
 
 
Bridge_tree.cpp
Bridge_tree.cpp
 
 
Centroid_Decomposition.cpp
Centroid_Decomposition.cpp
 
 
Count_Inversions_MergeSort.cc
Count_Inversions_MergeSort.cc
 
 
DSU_on_grid.cc
DSU_on_grid.cc
 
 
Digit_DP_[L,R]_some_property.cpp
Digit_DP_[L,R]_some_property.cpp
 
 
EVandP.cc
EVandP.cc
 
 
Ford_Fulkerson_Flows.cpp
Ford_Fulkerson_Flows.cpp
 
 
LCA_with_prefix_precomputation.cpp
LCA_with_prefix_precomputation.cpp
 
 
LPS_using_Manacher_algorithm.cpp
LPS_using_Manacher_algorithm.cpp
 
 
Largest_Coprime_subset.cpp
Largest_Coprime_subset.cpp
 
 
MO''s.cpp
MO''s.cpp
 
 
Manacher_longest_palindromic_prefix_or_suffix.cpp
Manacher_longest_palindromic_prefix_or_suffix.cpp
 
 
MinCostMaxFlow.cpp
MinCostMaxFlow.cpp
 
 
My_DIJKSTRA.cpp
My_DIJKSTRA.cpp
 
 
No_of_Palindromic_substrings_in_O(N).cpp
No_of_Palindromic_substrings_in_O(N).cpp
 
 
Non_intersecting_paths_max_flow.cpp
Non_intersecting_paths_max_flow.cpp
 
 
README.md
README.md
 
 
Stress_Testing
Stress_Testing
 
 
Tree.cpp
Tree.cpp
 
 
Unordered_map_custom_hashing.cpp
Unordered_map_custom_hashing.cpp
 
 
a^b_in_log(b).cpp
a^b_in_log(b).cpp
 
 
a^b_mod_p.cpp
a^b_mod_p.cpp
 
 
aho_corasik.cpp
aho_corasik.cpp
 
 
bashrc C++ alias
bashrc C++ alias
 
 
bigint.cpp
bigint.cpp
 
 
binary_lifting_max_on_path_in_weighted_tree.cpp
binary_lifting_max_on_path_in_weighted_tree.cpp
 
 
check_prime_root(n).cpp
check_prime_root(n).cpp
 
 
check_subsequence.cpp
check_subsequence.cpp
 
 
check_subsequence_fastest.cc
check_subsequence_fastest.cc
 
 
convex_hull.cpp
convex_hull.cpp
 
 
count_inversions_fenwick_tree.cc
count_inversions_fenwick_tree.cc
 
 
countoccurences.cpp
countoccurences.cpp
 
 
countoccurencesofstringtrie.cpp
countoccurencesofstringtrie.cpp
 
 
cycle_detection_using_dsu.cpp
cycle_detection_using_dsu.cpp
 
 
debug_tool.cpp
debug_tool.cpp
 
 
derangements.cpp
derangements.cpp
 
 
dijkstra.cpp
dijkstra.cpp
 
 
dijkstra_Nlog(N)_priority_queue.cpp
dijkstra_Nlog(N)_priority_queue.cpp
 
 
dsu_chain_creating.cpp
dsu_chain_creating.cpp
 
 
dsu_shortest_code.cpp
dsu_shortest_code.cpp
 
 
dsu_struct_with_path_compression(efficient).cpp
dsu_struct_with_path_compression(efficient).cpp
 
 
euler_totient.cpp
euler_totient.cpp
 
 
factorial_mod_p.cpp
factorial_mod_p.cpp
 
 
fast_input_output.cc
fast_input_output.cc
 
 
fast_read_int.cpp
fast_read_int.cpp
 
 
fast_write_int.cpp
fast_write_int.cpp
 
 
fibonacci_matrix_exponentiation.cc
fibonacci_matrix_exponentiation.cc
 
 
file_input_output.cpp
file_input_output.cpp
 
 
gcc_pragma.cpp
gcc_pragma.cpp
 
 
implicit_segment_tree.cc
implicit_segment_tree.cc
 
 
implicit_segment_tree_general.cc
implicit_segment_tree_general.cc
 
 
lazypropagationontrees.cpp
lazypropagationontrees.cpp
 
 
lcm_of_array_big_values.cpp
lcm_of_array_big_values.cpp
 
 
lis_with_contents.cpp
lis_with_contents.cpp
 
 
longest_palindromic_substring.cpp
longest_palindromic_substring.cpp
 
 
manacher_algorithm.cpp
manacher_algorithm.cpp
 
 
matrix_path_sum_magic.cpp
matrix_path_sum_magic.cpp
 
 
maxxorpathinweightedtree.cpp
maxxorpathinweightedtree.cpp
 
 
merge_sort_tree.cpp
merge_sort_tree.cpp
 
 
minimumcoinschange.cpp
minimumcoinschange.cpp
 
 
mod_inverse_coprime.cc
mod_inverse_coprime.cc
 
 
mod_inverse_precompute.cpp
mod_inverse_precompute.cpp
 
 
mst_using_dsu.cpp
mst_using_dsu.cpp
 
 
mytrie.cpp
mytrie.cpp
 
 
ncr_mod_p_fast.cpp
ncr_mod_p_fast.cpp
 
 
ncrfast.cpp
ncrfast.cpp
 
 
no_of_palindromic_substrings.cpp
no_of_palindromic_substrings.cpp
 
 
ntt.cpp
ntt.cpp
 
 
numberofnodesintrie.cpp
numberofnodesintrie.cpp
 
 
offlinemaxxorqueries.cpp
offlinemaxxorqueries.cpp
 
 
ordered_set_PBDS.cpp
ordered_set_PBDS.cpp
 
 
phi_1_to_n.cc
phi_1_to_n.cc
 
 
prefixsuffixmaxxor.cpp
prefixsuffixmaxxor.cpp
 
 
queriestocountprefixofstring.cpp
queriestocountprefixofstring.cpp
 
 
random_values_in_range_best
random_values_in_range_best
 
 
rerooting_technique.cpp
rerooting_technique.cpp
 
 
rmq.cpp
rmq.cpp
 
 
rsq.cpp
rsq.cpp
 
 
scc.cpp
scc.cpp
 
 
segment_tree_with_lazyprop.cpp
segment_tree_with_lazyprop.cpp
 
 
segtree_min_max_with_counts_in_range.cc
segtree_min_max_with_counts_in_range.cc
 
 
segtreeplustrie.cpp
segtreeplustrie.cpp
 
 
shortest_cycle_undirected.cpp
shortest_cycle_undirected.cpp
 
 
sieve_primes.cpp
sieve_primes.cpp
 
 
sieve_template.cpp
sieve_template.cpp
 
 
size_of_ccs_using_dsu.cpp
size_of_ccs_using_dsu.cpp
 
 
sparse_table.cpp
sparse_table.cpp
 
 

Repository files navigation

About

Important codes/functions/snippets required frequently in Competitive Programming

Topics

snippets algorithms competitive-programming data-structures

Resources

Readme
Activity

Stars

19 stars

Watchers

1 watching

Forks

7 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages