-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathcontents.txt
68 lines (62 loc) · 2.61 KB
/
contents.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
# Any line followed by a '#' character is ignored
# Section headings must be in square brackets
# Subsections within a section should follow the format:
# [filename within code directory][tab character \t][subsection title]
[Dynamic Programming]
convex_hull_trick.cpp Convex Hull Trick
convex_hull_trick_integers.cpp ConvexHull Hull Trick (Integers)
divide_and_conquer_optimization.cpp Divide and Conquer Optimization
knuth_optimization_type1.cpp Knuth Optimization (Type 1)
knuth_optimization_type2.cpp Knuth Optimization (Type 2)
[Data Structures]
2D_dynamic_segtree.cpp 2D Dynamic Segment Tree
centroid_decomposition.cpp Centroid Decomposition
dsu_with_rollbacks.cpp DSU With Rollbacks
hld.cpp Heavy-Light Decomposition
persistent_segtree_range_update.cpp Persistent Segment Tree With Range Updates
#treap.cpp Treap
treap(implicit_key).cpp Treap With Implicit Key
persistean_treap.cpp Persistent Treap
splay_tree.cpp Splay Tree
2D_Fenwick.cpp 2D Fenwick Tree Range Updates
[Geometry]
3D_convex_hull.cpp 3D Convex Hull
closest_point_pair.cpp Closest Point Pair
dynamic_upper_convex_hull.cpp Dynamic Upper Convex Hull
farthest_points.cpp Farthest Point Pair
half_plane_intersection_randomized_O(N).cpp Half Plane Intersection (Randomized Incremental Algorithm)
minkowski_sum(bonus_convex_hull).cpp Minkowski Sum of Convex Polygons
pair_of_intersecting_segments.cpp Pair of Intersecting Segments
minimum_enclosing_circle_O(N)_randomized.cpp Minimum Enclosing Circle (Randomized Incremental Algorithm)
[Graphs]
#dinic.cpp Maximum Flow (Dinic)
find_facets.cpp Facet Finding
lca_O(1).cpp LCA O(1)
mcmf_dijkstra_potentials.cpp Min Cost Max Flow (Dijkstra with Potentials)
#mcmf_spfa.cpp Min Cost Max Flow (SPFA)
offline_lca.cpp Offline LCA (Tarjan)
online_lca.cpp Online LCA
rooted_tree_isomorphism.cpp Rooted Tree Isomorphism
vertex_cover.cpp Vertex Cover (Types of Vertices)
hungarian.cpp Hungarian Algorithm
cactus.cpp Cactus
[Math]
chinese_remainder_theorem.cpp Chinese Remainder Theorem
discrete_logarithm_and_square_root.cpp Discrete Logarithm and Square Root
euclid_xy.cpp Extended Euclid Algorithm
fft.cpp Fast Fourier Transform
find_generator_of_Zp.cpp Generator of Zp
#karatsuba.cpp Karatsuba
precalculate_inverses.cpp Linear Time Precalculation of Inverses
simplex.cpp Simplex Algorithm
[Strings]
aho_corasick.cpp Aho-Corasick
manacer.cpp Discrete Manacer
palindromic_tree.cpp Palindromic Tree
prefix_function.cpp Prefix Function
suffix_array_1.cpp Suffix Array (Implementation 1)
suffix_array_2.cpp Suffix Array (Implementation 2)
#suffix_automaton.cpp Suffix Automaton
suffix_tree.cpp Suffix Tree
z_function.cpp Z Function
all_palindroms.cpp All Palindroms