-
Notifications
You must be signed in to change notification settings - Fork 3
/
contents.tex
157 lines (157 loc) · 6.51 KB
/
contents.tex
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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
\section{Bits}
\subsection{iterate\_submasks.cpp}
\lstinputlisting[style=cpp]{./code/Bits/iterate_submasks.cpp}
\subsection{iterate\_supermasks.cpp}
\lstinputlisting[style=cpp]{./code/Bits/iterate_supermasks.cpp}
\subsection{xor\_basis.cpp}
\lstinputlisting[style=cpp]{./code/Bits/xor_basis.cpp}
\section{DataStructure}
\subsection{2d\_diff\_array.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/2d_diff_array.cpp}
\subsection{2d\_pref\_sum.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/2d_pref_sum.cpp}
\subsection{fenwick.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/fenwick.cpp}
\subsection{indexed-set.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/indexed-set.cpp}
\subsection{lazy\_segtree.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/lazy_segtree.cpp}
\subsection{line\_container.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/line_container.cpp}
\subsection{monotonic\_dp\_hull.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/monotonic_dp_hull.cpp}
\subsection{persistent\_seg.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/persistent_seg.cpp}
\subsection{segtree.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/segtree.cpp}
\subsection{segtree\_none\_recursive.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/segtree_none_recursive.cpp}
\subsection{sliding\_window.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/sliding_window.cpp}
\subsection{sparse-table.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/sparse-table.cpp}
\subsection{treap\_rotate.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/treap_rotate.cpp}
\subsection{treap\_set.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/treap_set.cpp}
\subsection{treap\_split.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/treap_split.cpp}
\subsection{trie.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/trie.cpp}
\subsection{union\_find.cpp}
\lstinputlisting[style=cpp]{./code/DataStructure/union_find.cpp}
\section{Geometry}
\subsection{angle.h}
\lstinputlisting[style=cpp]{./code/Geometry/angle.h}
\subsection{circle.h}
\lstinputlisting[style=cpp]{./code/Geometry/circle.h}
\subsection{geometry.h}
\lstinputlisting[style=cpp]{./code/Geometry/geometry.h}
\subsection{line.h}
\lstinputlisting[style=cpp]{./code/Geometry/line.h}
\subsection{point.h}
\lstinputlisting[style=cpp]{./code/Geometry/point.h}
\subsection{polygon.h}
\lstinputlisting[style=cpp]{./code/Geometry/polygon.h}
\subsection{segment.h}
\lstinputlisting[style=cpp]{./code/Geometry/segment.h}
\section{Graph}
\subsection{2-sat.cpp}
\lstinputlisting[style=cpp]{./code/Graph/2-sat.cpp}
\subsection{BellmanFord.cpp}
\lstinputlisting[style=cpp]{./code/Graph/BellmanFord.cpp}
\subsection{Hopcroft-Karp.cpp}
\lstinputlisting[style=cpp]{./code/Graph/Hopcroft-Karp.cpp}
\subsection{MCMF.cpp}
\lstinputlisting[style=cpp]{./code/Graph/MCMF.cpp}
\subsection{augmented\_path\_BPM.cpp}
\lstinputlisting[style=cpp]{./code/Graph/augmented_path_BPM.cpp}
\subsection{biconnected\_components.cpp}
\lstinputlisting[style=cpp]{./code/Graph/biconnected_components.cpp}
\subsection{binary\_lifting.cpp}
\lstinputlisting[style=cpp]{./code/Graph/binary_lifting.cpp}
\subsection{blossom.cpp}
\lstinputlisting[style=cpp]{./code/Graph/blossom.cpp}
\subsection{bridges.cpp}
\lstinputlisting[style=cpp]{./code/Graph/bridges.cpp}
\subsection{dijkstra.cpp}
\lstinputlisting[style=cpp]{./code/Graph/dijkstra.cpp}
\subsection{dinic.cpp}
\lstinputlisting[style=cpp]{./code/Graph/dinic.cpp}
\subsection{divide\_and\_conquer\_on\_trees.cpp}
\lstinputlisting[style=cpp]{./code/Graph/divide_and_conquer_on_trees.cpp}
\subsection{dsu\_on\_tree.cpp}
\lstinputlisting[style=cpp]{./code/Graph/dsu_on_tree.cpp}
\subsection{eulerian-path-directed.cpp}
\lstinputlisting[style=cpp]{./code/Graph/eulerian-path-directed.cpp}
\subsection{eulerian-path.cpp}
\lstinputlisting[style=cpp]{./code/Graph/eulerian-path.cpp}
\subsection{heavy-light\_decomp.cpp}
\lstinputlisting[style=cpp]{./code/Graph/heavy-light_decomp.cpp}
\subsection{hungarian.cpp}
\lstinputlisting[style=cpp]{./code/Graph/hungarian.cpp}
\subsection{kosaraju\_SCC.cpp}
\lstinputlisting[style=cpp]{./code/Graph/kosaraju_SCC.cpp}
\subsection{push-relabel.cpp}
\lstinputlisting[style=cpp]{./code/Graph/push-relabel.cpp}
\subsection{tarjan\_SCC.cpp}
\lstinputlisting[style=cpp]{./code/Graph/tarjan_SCC.cpp}
\subsection{two\_edge\_connected\_components.cpp}
\lstinputlisting[style=cpp]{./code/Graph/two_edge_connected_components.cpp}
\section{Math}
\subsection{BSGS.cpp}
\lstinputlisting[style=cpp]{./code/Math/BSGS.cpp}
\subsection{ChineseRT.cpp}
\lstinputlisting[style=cpp]{./code/Math/ChineseRT.cpp}
\subsection{binomial.cpp}
\lstinputlisting[style=cpp]{./code/Math/binomial.cpp}
\subsection{euclid.h}
\lstinputlisting[style=cpp]{./code/Math/euclid.h}
\subsection{euler.h}
\lstinputlisting[style=cpp]{./code/Math/euler.h}
\subsection{exGCD.cpp}
\lstinputlisting[style=cpp]{./code/Math/exGCD.cpp}
\subsection{factorial.hpp}
\lstinputlisting[style=cpp]{./code/Math/factorial.hpp}
\subsection{factorization.cpp}
\lstinputlisting[style=cpp]{./code/Math/factorization.cpp}
\subsection{fft.cpp}
\lstinputlisting[style=cpp]{./code/Math/fft.cpp}
\subsection{gauss.h}
\lstinputlisting[style=cpp]{./code/Math/gauss.h}
\subsection{inverse.h}
\lstinputlisting[style=cpp]{./code/Math/inverse.h}
\subsection{lucas.h}
\lstinputlisting[style=cpp]{./code/Math/lucas.h}
\subsection{mod\_int.hpp}
\lstinputlisting[style=cpp]{./code/Math/mod_int.hpp}
\subsection{nfft.h}
\lstinputlisting[style=cpp]{./code/Math/nfft.h}
\subsection{power.h}
\lstinputlisting[style=cpp]{./code/Math/power.h}
\subsection{sieve.cpp}
\lstinputlisting[style=cpp]{./code/Math/sieve.cpp}
\subsection{simplex.h}
\lstinputlisting[style=cpp]{./code/Math/simplex.h}
\section{Misc}
\subsection{Mo's\_algorithm.cpp}
\lstinputlisting[style=cpp]{./code/Misc/Mo's_algorithm.cpp}
\section{String}
\subsection{ac-automaton.cpp}
\lstinputlisting[style=cpp]{./code/String/ac-automaton.cpp}
\subsection{kmp.cpp}
\lstinputlisting[style=cpp]{./code/String/kmp.cpp}
\subsection{manacher.cpp}
\lstinputlisting[style=cpp]{./code/String/manacher.cpp}
\subsection{polyhash.cpp}
\lstinputlisting[style=cpp]{./code/String/polyhash.cpp}
\subsection{suffix array.cpp}
\lstinputlisting[style=cpp]{./code/String/suffix array.cpp}
\subsection{suffix automaton.cpp}
\lstinputlisting[style=cpp]{./code/String/suffix automaton.cpp}
\subsection{suffix\_array\_linear.cpp}
\lstinputlisting[style=cpp]{./code/String/suffix_array_linear.cpp}
\subsection{trie.cpp}
\lstinputlisting[style=cpp]{./code/String/trie.cpp}
\subsection{z-function.cpp}
\lstinputlisting[style=cpp]{./code/String/z-function.cpp}