forked from Triplem5ds/AgmdReferenceFeKolElReferences
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcontents_cpp.tex
More file actions
248 lines (238 loc) · 8.68 KB
/
contents_cpp.tex
File metadata and controls
248 lines (238 loc) · 8.68 KB
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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
\section{Combinatorics}
\subsection{Burnside Lemma}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Combinatorics/Burnside's_lemma.cpp}
\hrulefill
\subsection{Catlan Numbers}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Combinatorics/Catalan_Numbers.cpp}
\hrulefill
\section{Algebra}
\subsection{Gray Code}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/GrayCode.cpp}
\hrulefill
\subsection{Primitive Roots}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/PrimitiveRoots.cpp}
\hrulefill
\subsection{Discrete Logarithm minimum x for which ${a^x = b \% m}$}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/DiscreteLogarithm.cpp}
\hrulefill
\subsection{Discrete Root finds all numbers x such that ${x^k = a \% n}$}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/DiscreteRoot.cpp}
\hrulefill
\subsection{Factorial modulo in p*log(n) (Wilson Theroem)}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/FactorialMod.cpp}
\hrulefill
\subsection{Iteration over submasks}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/Enumerating_all_submasks_of_a_given_mask.cpp}
\hrulefill
\subsection{Totient function}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/Euler's_totient_function.cpp}
\hrulefill
\subsection{CRT and EEGCD}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/Extended+GCD+CRT.cpp}
\hrulefill
\subsection{FFT}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/FFT.cpp}
\hrulefill
\subsection{Fibonacci}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/FibonacciNumbers.cpp}
\hrulefill
\subsection{Gauss Determinant}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/GaussDeterminant.cpp}
\hrulefill
\subsection{GAUSS SLAE}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/GaussSystemOfLinearEquations.cpp}
\hrulefill
\subsection{Matrix Inverse}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/MatrixInverse.cpp}
\hrulefill
\subsection{NTT}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/NTT.cpp}
\hrulefill
\subsection{NTT of KACTL}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Algebra/NTT_KACTL.cpp}
\hrulefill
\section{Data Structures}
\subsection{2D BIT}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DataStructures/2DBIT.cpp}
\hrulefill
\subsection{2D Sparse table}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DataStructures/2DSparseTable.cpp}
\hrulefill
\subsection{hillbert Order}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DataStructures/hillbertOrder.cpp}
\hrulefill
\subsection{Merge Sort Bit with updates}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DataStructures/MergeSortBitWithUpdates.cpp}
\hrulefill
\subsection{Mo's}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DataStructures/MO'sAlgorithm.cpp}
\hrulefill
\subsection{Mo With Updates}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DataStructures/MOwithUpdates.cpp}
\hrulefill
\subsection{Ordered Set}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DataStructures/ordered_set.cpp}
\hrulefill
\subsection{Persistent Seg Tree}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DataStructures/PresistentSegTree.cpp}
\hrulefill
\subsection{Sqrt Decomposition}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DataStructures/SQRT.cpp}
\hrulefill
\subsection{Treap}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DataStructures/treap.cpp}
\hrulefill
\subsection{Wavelet Tree}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DataStructures/Wavelet_tree.cpp}
\hrulefill
\subsection{SparseTable}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DataStructures/SparseTable.cpp}
\hrulefill
\section{DP}
\subsection{Dynamic Convex Hull Trick}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DP/DCHT.cpp}
\hrulefill
\subsection{Dynamic Connectivety with SegTree}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DP/DynamicConnectivetyCHT.cpp}
\hrulefill
\subsection{Li Chao Tree}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DP/LiChaoTreeWithPointers.cpp}
\hrulefill
\subsection{CHT Line Container}
\raggedbottom\lstinputlisting[style=cpp]{cpp/DP/LineContainer.cpp}
\hrulefill
\section{Geometry}
\subsection{Convex Hull}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Geo/convex_hull.cpp}
\hrulefill
\subsection{Geometry Template}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Geo/Geo1.cpp}
\hrulefill
\subsection{Half Plane Intersection}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Geo/Half-plane_intersection.cpp}
\hrulefill
\subsection{Segments Intersection}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Geo/Intersecting_Segments.cpp}
\hrulefill
\subsection{Rectangles Union}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Geo/UnionArea_Of_Rectangles.cpp}
\hrulefill
\section{Graphs}
\subsection{2 SAD}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/2sat.cpp}
\hrulefill
\subsection{Ariculation Point}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/ArticulationPoint.cpp}
\hrulefill
\subsection{Bridges Tree and Diameter}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/BridgesTree_TreeDiameter.cpp}
\hrulefill
\subsection{Dinic With Scalling}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/DinicWithScalling.cpp}
\hrulefill
\subsection{Gomory Hu}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/GomoryHu.cpp}
\hrulefill
\subsection{HopcraftKarp BPM}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/HopcraftKarp.cpp}
\hrulefill
\subsection{Hungarian}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/Hungarian.cpp}
\hrulefill
\subsection{Kosaraju}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/Kosaraju.cpp}
\hrulefill
\subsection{Krichoff}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/Krichoff'sTheroem.cpp}
\hrulefill
\subsection{Manhattan MST}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/ManhattanMST.cpp}
\hrulefill
\subsection{Maximum Clique}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/MaxCliqueFinding.cpp}
\hrulefill
\subsection{MCMF}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/MCMFSPFA.cpp}
\hrulefill
\subsection{Minimum Arbroscene in a Graph}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/MinimumArbroscene.cpp}
\hrulefill
\subsection{Minmimum Vertex Cover (Bipartite)}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/MinimumVertexCover.cpp}
\hrulefill
\subsection{Prufer Code}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/prufer_code.cpp}
\hrulefill
\subsection{Push Relabel Max Flow}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/PushRelabel.cpp}
\hrulefill
\subsection{Tarjan Algo}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/Tarjan.cpp}
\hrulefill
\subsection{Bipartite Matching}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Graphs/BPM.cpp}
\hrulefill
\section{Math}
\subsection{Xor With Gauss}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Math/GaussianXor.cpp}
\hrulefill
\subsection{Josephus}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Math/JosephusProblem.cpp}
\hrulefill
\subsection{Matrix Power/Multiplication}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Math/Matrix.cpp}
\hrulefill
\subsection{Rabin Miller Primality check}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Math/rabinMiller.cpp}
\hrulefill
\section{Strings}
\subsection{Aho-Corasick Mostafa}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Strings/ACA.cpp}
\hrulefill
\subsection{Aho-Corasick Anany}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Strings/ACA2.cpp}
\hrulefill
\subsection{KMP Anany}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Strings/KMP.cpp}
\hrulefill
\subsection{Manacher Kactl}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Strings/Manacher's.cpp}
\hrulefill
\subsection{Suffix Array Kactl}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Strings/SuffixArray.cpp}
\hrulefill
\subsection{Suffix Automaton Anany}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Strings/SuffixAutomaton.cpp}
\hrulefill
\subsection{Suffix Automaton Mostafa}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Strings/SuffixAutomaton2.cpp}
\hrulefill
\subsection{Suffix Automaton With Rollback Mostafa}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Strings/SuffixAutomaton_WithRollback.cpp}
\hrulefill
\subsection{Zalgo Anany}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Strings/Zalgo.cpp}
\hrulefill
\subsection{Minimum String Cycle}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Strings/minCycle.cpp}
\hrulefill
\section{Trees}
\subsection{Centroid Decomposition}
\raggedbottom\lstinputlisting[style=cpp]{cpp/trees/CentroidDecomposition.cpp}
\hrulefill
\subsection{Dsu On Trees}
\raggedbottom\lstinputlisting[style=cpp]{cpp/trees/DSUonTree.cpp}
\hrulefill
\subsection{Heavy Light Decomposition (Along with Euler Tour)}
\raggedbottom\lstinputlisting[style=cpp]{cpp/trees/HLD.cpp}
\hrulefill
\subsection{LCA}
\raggedbottom\lstinputlisting[style=cpp]{cpp/trees/LCAQuery.cpp}
\hrulefill
\subsection{Mo on Trees}
\raggedbottom\lstinputlisting[style=cpp]{cpp/trees/TreesMo.cpp}
\hrulefill
\section{Numerical}
\subsection{Lagrange Polynomial}
\raggedbottom\lstinputlisting[style=cpp]{cpp/Numerical/Lagrange.cpp}
\hrulefill