-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcontents.txt
124 lines (116 loc) · 4.88 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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
# 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]
[Flags + Template + vimrc]
flags.txt Flags
template.cpp Template
vimrc vimrc
[Data Structures]
data-structures/bit_binary_search.cpp Bit Binary Search
data-structures/bit.cpp Bit
data-structures/bit2d.cpp Bit 2D
data-structures/centroid_decomposition.cpp Centroid Decomposition
data-structures/hld-lamarca.cpp Heavy-Light Decomposition (Lamarca)
data-structures/lichao.cpp Lichao Tree (Cosenza)
data-structures/lichao_lazy.cpp Lichao Lazy (UFMG)
data-structures/mergesort_tree.cpp Merge Sort Tree
data-structures/min_queue.cpp Minimum Queue
data-structures/ordered_set.cpp Ordered Set
data-structures/seg_tree_dynamic_lazy.cpp Dynamic Segment Tree (Lazy)
data-structures/seg_tree_iterative.cpp Iterative Segment Tree
data-structures/seg_tree_persistent.cpp Persistent Segment Tree
data-structures/seg_tree_mod.cpp Mod Segment Tree
data-structures/seg_tree2d.cpp Segment Tree 2D
data-structures/set_of_intervals.cpp Set Of Intervals
data-structures/sparse.cpp Sparse Table
data-structures/sparse2d.cpp Sparse Table 2D
data-structures/stanford_kdtree.cpp KD Tree (Stanford)
data-structures/treap.cpp Treap
data-structures/trie.cpp Trie
data-structures/union_find.cpp Union Find
[Dynamic Programming]
dynamic-programming/convex_hull_trick_emaxx.cpp Convex Hull Trick (emaxx)
dynamic-programming/divide_and_conquer_optimization.cpp Divide and Conquer Optimization
dynamic-programming/knuth_optimization.cpp Knuth Optimization
dynamic-programming/sos.cpp SOS DP
dynamic-programming/steiner_tree.cpp Steiner tree
[Graphs]
graphs/2_sat_kosaraju.cpp 2-SAT Kosaraju
graphs/bellman_ford.cpp Shortest Path (Bellman-Ford)
graphs/floyd_warshall.cpp Floyd Warshall
graphs/block_cut.cpp Block Cut
graphs/bridges_and_articulations.cpp Articulation points and bridges
graphs/dominator_tree.cpp Dominator Tree
graphs/erdos_gallai.cpp Erdos Gallai
graphs/eulerian_path.cpp Eulerian Path
graphs/fast_kuhn.cpp Fast Kuhn
graphs/find_cycle_3_4.cpp Find Cycle of size 3 and 4
graphs/hungarian_navarro.cpp Hungarian Navarro
graphs/kosaraju.cpp Strongly Connected Components
graphs/lca_max_weight.cpp LCA (Max Weight On Path)
graphs/max_flow.cpp Max Flow
graphs/min_cost_max_flow.cpp Min Cost Max Flow
graphs/small_to_large.cpp Small to Large
graphs/stanford_stoer_wagner.cpp Stoer Wagner (Stanford)
graphs/stable_marriage.cpp Stable Marriage (Cosenza)
[Strings]
strings/aho_corasick.cpp Aho-Corasick
strings/booths_algorithm.cpp Booths Algorithm
strings/kmp_automaton.cpp Knuth-Morris-Pratt (Automaton)
strings/kmp.cpp Knuth-Morris-Pratt
strings/manacher.cpp Manacher
strings/recursive_string_matching.cpp Recursive-String Matching
strings/string_hashing.cpp String Hashing
strings/string_multihashing.cpp String Multihashing
strings/suffix_array.cpp Suffix Array
strings/suffix_automaton.cpp Suffix Automaton
strings/suffix_tree.cpp Suffix Tree
strings/z_function.cpp Z Function
[Mathematics]
math/basics.cpp Basics
math/advanced.cpp Advanced
math/discrete_log.cpp Discrete Log (Baby-step Giant-step)
math/euler_phi.cpp Euler Phi
math/extended_euclid.cpp Extended Euclidean and Chinese Remainder
math/fft_tourist.cpp Fast Fourier Transform(Tourist)
math/fwht.cpp Fast Walsh-Hadamard Transform
math/gauss_elim_xor.cpp Gaussian Elimination (xor)
math/gauss_elim.cpp Gaussian Elimination (double)
math/ternary_search.cpp Ternary Search
math/gss.cpp Golden Section Search (Ternary Search)
math/josephus.cpp Josephus
math/mobius_inversion.cpp Mobius Inversion
math/mobius.cpp Mobius Function
math/ntt.cpp Number Theoretic Transform
math/pollard_rho.cpp Pollard-Rho
math/primitive_root.cpp Primitive Root
math/sieve.cpp Sieve of Eratosthenes
math/simpson_rule.cpp Simpson Rule
math/stanford_simplex.cpp Simplex (Stanford)
[Geometry]
geometry/misc.cpp Miscellaneous
geometry/basics.cpp Basics (Point)
geometry/radial_sort.cpp Radial Sort
geometry/lines.cpp Lines
geometry/circle.cpp Circle
geometry/polygons.cpp Polygons
geometry/shamos_hoey.cpp Shamos Hoey
geometry/winding_Number.cpp Winding Number
geometry/cpa.cpp Closes Point Approach
geometry/rotating_calipers.cpp Rotating Calipers
geometry/closest_pair.cpp Closest Pair of Points
geometry/nearest_neighbour.cpp Nearest Neighbour
geometry/minkowski_sum.cpp Minkowski Sum
geometry/halfplane_intersection.cpp Half Plane Intersection
geometry/delaunay.cpp Delaunay Triangulation
[Miscellaneous]
misc/bitset.cpp Bitset
misc/builtin.cpp builtin
misc/date.cpp Date
misc/ita_paren2polish.cpp Parentesis to Polish (ITA)
misc/parallel_bin_search.cpp Parallel Binary Search
misc/python.py Python
misc/sqrt_decomposition.cpp Sqrt Decomposition
misc/stanford_latlong.cpp Latitude Longitude (Stanford)
misc/week_day.cpp Week day