algovault：用于竞争性编程的算法，数据结构和模板-源码

[{"title":"（ 76 个子文件 104KB ） algovault：用于竞争性编程的算法，数据结构和模板-源码","children":[{"title":"algovault-master","children":[{"title":"LICENSE <span style='color:#111;'> 34.33KB </span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'> 4.44KB </span>","children":null,"spread":false},{"title":"code_library","children":[{"title":"hashmap.cpp <span style='color:#111;'> 2.35KB </span>","children":null,"spread":false},{"title":"circle_circle_intersection_area.cpp <span style='color:#111;'> 1.94KB </span>","children":null,"spread":false},{"title":"mobius_function.cpp <span style='color:#111;'> 1.63KB </span>","children":null,"spread":false},{"title":"fast_prime_counting.cpp <span style='color:#111;'> 4.52KB </span>","children":null,"spread":false},{"title":"n_queen.c <span style='color:#111;'> 979B </span>","children":null,"spread":false},{"title":"two_sat_kosaraju.cpp <span style='color:#111;'> 3.14KB </span>","children":null,"spread":false},{"title":"string_hash.cpp <span style='color:#111;'> 3.79KB </span>","children":null,"spread":false},{"title":"gauss_jordan.cpp <span style='color:#111;'> 3.06KB </span>","children":null,"spread":false},{"title":"gamblers_ruin.c <span style='color:#111;'> 1.20KB </span>","children":null,"spread":false},{"title":"assembly.c <span style='color:#111;'> 1.59KB </span>","children":null,"spread":false},{"title":"discrete_logarithm.cpp <span style='color:#111;'> 2.03KB </span>","children":null,"spread":false},{"title":"picks_theorem.cpp <span style='color:#111;'> 1.33KB </span>","children":null,"spread":false},{"title":"coordinate_compression.cpp <span style='color:#111;'> 935B </span>","children":null,"spread":false},{"title":"pisano_period.cpp <span style='color:#111;'> 6.33KB </span>","children":null,"spread":false},{"title":"freivalds_algorithm.cpp <span style='color:#111;'> 2.36KB </span>","children":null,"spread":false},{"title":"two_sat_tarjan.cpp <span style='color:#111;'> 3.11KB </span>","children":null,"spread":false},{"title":"combsort.c <span style='color:#111;'> 904B </span>","children":null,"spread":false},{"title":"hunt_szymanski_lcs.cpp <span style='color:#111;'> 1.11KB </span>","children":null,"spread":false},{"title":"maxflow.cpp <span style='color:#111;'> 3.80KB </span>","children":null,"spread":false},{"title":"gauss_on_band_matrix.cpp <span style='color:#111;'> 6.35KB </span>","children":null,"spread":false},{"title":"maximum_matching.cpp <span style='color:#111;'> 3.76KB </span>","children":null,"spread":false},{"title":"eulerian_numbers.c <span style='color:#111;'> 888B </span>","children":null,"spread":false},{"title":"chinese_remainder_theorem.cpp <span style='color:#111;'> 1.16KB </span>","children":null,"spread":false},{"title":"bignum.cpp <span style='color:#111;'> 11.31KB </span>","children":null,"spread":false},{"title":"linear_recurrence_solver.cpp <span style='color:#111;'> 20.45KB </span>","children":null,"spread":false},{"title":"directed_mst.cpp <span style='color:#111;'> 2.20KB </span>","children":null,"spread":false},{"title":"disjoint_set.cpp <span style='color:#111;'> 1.39KB </span>","children":null,"spread":false},{"title":"permutation_rank.cpp <span style='color:#111;'> 1.93KB </span>","children":null,"spread":false},{"title":"python3","children":[{"title":"string_hash.py <span style='color:#111;'> 834B </span>","children":null,"spread":false},{"title":"n_queen.py <span style='color:#111;'> 707B </span>","children":null,"spread":false},{"title":"dijkstra.py <span style='color:#111;'> 2.17KB </span>","children":null,"spread":false},{"title":"z_algorithm.py <span style='color:#111;'> 866B </span>","children":null,"spread":false},{"title":"scanner.py <span style='color:#111;'> 604B </span>","children":null,"spread":false},{"title":"string_hash_singleton.py <span style='color:#111;'> 1.25KB </span>","children":null,"spread":false},{"title":"file_search.py <span style='color:#111;'> 1.32KB </span>","children":null,"spread":false},{"title":"maximum_matching.py <span style='color:#111;'> 2.52KB </span>","children":null,"spread":false},{"title":"alpha_beta_pruning.py <span style='color:#111;'> 2.17KB </span>","children":null,"spread":false},{"title":"fast_fibonacci.py <span style='color:#111;'> 1.46KB </span>","children":null,"spread":false},{"title":"berlekamp_massey.py <span style='color:#111;'> 3.55KB </span>","children":null,"spread":false},{"title":"miller_rabin.py <span style='color:#111;'> 1013B </span>","children":null,"spread":false},{"title":"derangements.py <span style='color:#111;'> 1.89KB </span>","children":null,"spread":false},{"title":"discrete_log.py <span style='color:#111;'> 1.47KB </span>","children":null,"spread":false},{"title":"lagrange_polynomial_interpolation.py <span style='color:#111;'> 1.51KB </span>","children":null,"spread":false}],"spread":false},{"title":"dynamic_aho_corasick.cpp <span style='color:#111;'> 4.24KB </span>","children":null,"spread":false},{"title":"thomas_algorithm.cpp <span style='color:#111;'> 955B </span>","children":null,"spread":false},{"title":"fast_sieve.c <span style='color:#111;'> 3.65KB </span>","children":null,"spread":false},{"title":"2D_pattern_matcher.cpp <span style='color:#111;'> 2.79KB </span>","children":null,"spread":false},{"title":"bit_string_lcs.c <span style='color:#111;'> 1.49KB </span>","children":null,"spread":false},{"title":"all_divisors.c <span style='color:#111;'> 2.27KB </span>","children":null,"spread":false},{"title":"josephus_problem.cpp <span style='color:#111;'> 1.16KB </span>","children":null,"spread":false},{"title":"anti_polyonmial_hash.cpp <span style='color:#111;'> 5.00KB </span>","children":null,"spread":false},{"title":"convex_hull.cpp <span style='color:#111;'> 2.18KB </span>","children":null,"spread":false},{"title":"gauss_with_prime_modulo.cpp <span style='color:#111;'> 3.64KB </span>","children":null,"spread":false},{"title":"maximum_divisors.cpp <span style='color:#111;'> 1.46KB </span>","children":null,"spread":false},{"title":"bernoulli_numbers.c <span style='color:#111;'> 1.57KB </span>","children":null,"spread":false},{"title":"15_puzzle_solver.cpp <span style='color:#111;'> 3.16KB </span>","children":null,"spread":false},{"title":"blocks_dp.c <span style='color:#111;'> 1.62KB </span>","children":null,"spread":false},{"title":"hungarian_algorithm.cpp <span style='color:#111;'> 3.98KB </span>","children":null,"spread":false},{"title":"dancing_links.cpp <span style='color:#111;'> 9.18KB </span>","children":null,"spread":false},{"title":"walsh_hadamard.cpp <span style='color:#111;'> 3.15KB </span>","children":null,"spread":false},{"title":"articulation_points.cpp <span style='color:#111;'> 2.02KB </span>","children":null,"spread":false},{"title":"simulated_annealing.c <span style='color:#111;'> 2.75KB </span>","children":null,"spread":false},{"title":"manachers_algorithm.cpp <span style='color:#111;'> 1008B </span>","children":null,"spread":false},{"title":"fast_prime_sums.cpp <span style='color:#111;'> 4.34KB </span>","children":null,"spread":false},{"title":"bit_twiddling.c <span style='color:#111;'> 2.13KB </span>","children":null,"spread":false},{"title":"gauss_over_gf(2).cpp <span style='color:#111;'> 2.58KB </span>","children":null,"spread":false},{"title":"digits_of_factorial.cpp <span style='color:#111;'> 1.31KB </span>","children":null,"spread":false},{"title":"binomial_coefficients.cpp <span style='color:#111;'> 5.04KB </span>","children":null,"spread":false},{"title":"fast_fourier_transformation.cpp <span style='color:#111;'> 14.06KB </span>","children":null,"spread":false},{"title":"anti_double_hash.cpp <span style='color:#111;'> 3.93KB </span>","children":null,"spread":false},{"title":"gray_codes.c <span style='color:#111;'> 946B </span>","children":null,"spread":false},{"title":"max_xor_subset.cpp <span style='color:#111;'> 1.04KB </span>","children":null,"spread":false},{"title":"bridge.cpp <span style='color:#111;'> 5.02KB </span>","children":null,"spread":false},{"title":"aho_corasick.cpp <span style='color:#111;'> 3.09KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}],"spread":true}]