forked from quanglm1998/icpc-teamnote
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcontents.tex
167 lines (160 loc) · 5.18 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
158
159
160
161
162
163
164
165
166
\section{Number theory}
\subsection{Count primes up to N}
\raggedbottom\lstinputlisting[style=cpp]{code/CountPrimes.cc}
\hrulefill
\subsection{Extended Euclide}
\raggedbottom\lstinputlisting[style=cpp]{code/ExtendedEuclide.cc}
\hrulefill
\subsection{System of linear equations}
\raggedbottom\lstinputlisting[style=cpp]{code/SystemLinearEquations.cc}
\hrulefill
\subsection{Pollard Rho}
\raggedbottom\lstinputlisting[style=cpp]{code/PollardRho.cc}
\hrulefill
\subsection{Cubic}
\raggedbottom\lstinputlisting[style=cpp]{code/Cubic.cc}
\hrulefill
\subsection{PythagoreTriple}
\raggedbottom\lstinputlisting[style=cpp]{code/PythagoreTriple.cc}
\hrulefill
\subsection{Tonelli-Shanks}
\raggedbottom\lstinputlisting[style=cpp]{code/TonelliShanks.cc}
\hrulefill
\section{String}
\subsection{Suffix Array}
\raggedbottom\lstinputlisting[style=cpp]{code/SuffixArray.cc}
\hrulefill
\subsection{Aho Corasick}
\raggedbottom\lstinputlisting[style=cpp]{code/AhoCorasick.cc}
\hrulefill
\subsection{Z algorithm}
\raggedbottom\lstinputlisting[style=cpp]{code/Zalgo.cc}
\hrulefill
\subsection{Manacher}
\raggedbottom\lstinputlisting[style=cpp]{code/Manacher.cc}
\hrulefill
\subsection{Suffix Automaton}
\raggedbottom\lstinputlisting[style=cpp]{code/SuffixAutomaton.cc}
\hrulefill
\subsection{ALCS}
\raggedbottom\lstinputlisting[style=cpp]{code/ALCS.cc}
\hrulefill
\subsection{Palindromic Tree}
\raggedbottom\lstinputlisting[style=cpp]{code/Eertree.cc}
\hrulefill
\subsection{Lyndon Factorization}
\raggedbottom\lstinputlisting[style=cpp]{code/LyndonFactorization.cc}
\hrulefill
\section{Geometry}
\subsection{Geometry}
\raggedbottom\lstinputlisting[style=cpp]{code/Geometry.cc}
\hrulefill
\section{Numerical algorithms}
\subsection{Gauus Elimination}
\raggedbottom\lstinputlisting[style=cpp]{code/Gauss.cc}
\hrulefill
\subsection{Simplex Algorithm}
\raggedbottom\lstinputlisting[style=cpp]{code/LPSolver.cc}
\hrulefill
\subsection{NTT}
\raggedbottom\lstinputlisting[style=cpp]{code/NTT.cc}
\hrulefill
\subsection{FFT}
\raggedbottom\lstinputlisting[style=cpp]{code/FFT.cc}
\hrulefill
\subsection{Bitwise FFT}
\raggedbottom\lstinputlisting[style=cpp]{code/Bitwise-FFT.cc}
\hrulefill
\subsection{FFT chemthan}
\raggedbottom\lstinputlisting[style=cpp]{code/FFT_chemthan.cc}
\hrulefill
\subsection{Interpolation}
\raggedbottom\lstinputlisting[style=cpp]{code/Interpolation_chemthan.cc}
\hrulefill
\subsection{Binary vector space}
\raggedbottom\lstinputlisting[style=cpp]{code/BinaryVector.cc}
\hrulefill
\subsection{DiophanteMod}
\raggedbottom\lstinputlisting[style=cpp]{code/DiophanteMod.cc}
\hrulefill
\subsection{Berlekamp-Massey}
\raggedbottom\lstinputlisting[style=cpp]{code/BM.cc}
\hrulefill
\subsection{Linear Sieve}
\raggedbottom\lstinputlisting[style=cpp]{code/LinearSieve.cc}
\hrulefill
\section{Graph algorithms}
\subsection{Arborescence}
\raggedbottom\lstinputlisting[style=cpp]{code/Arborescence.cc}
\hrulefill
\subsection{Arborescence With Trace}
\raggedbottom\lstinputlisting[style=cpp]{code/ArborescenceTrace.cc}
\hrulefill
\subsection{Bridges and Articulations}
\raggedbottom\lstinputlisting[style=cpp]{code/BridgesArticulations.cc}
\hrulefill
\subsection{Bipartite Maximum Matching}
\raggedbottom\lstinputlisting[style=cpp]{code/BipartiteMatching.cc}
\hrulefill
\subsection{General Matching}
\raggedbottom\lstinputlisting[style=cpp]{code/Blossom.cc}
\hrulefill
\subsection{Dinic Flow}
\raggedbottom\lstinputlisting[style=cpp]{code/DinicFlow.cc}
\hrulefill
\subsection{Dinic Flow With Scaling}
\raggedbottom\lstinputlisting[style=cpp]{code/DinicFlowWithScaling.cc}
\hrulefill
\subsection{Gomory Hu Tree}
\raggedbottom\lstinputlisting[style=cpp]{code/Gomory_Hu.cc}
\hrulefill
\subsection{Min Cost-Max Flow}
\raggedbottom\lstinputlisting[style=cpp]{code/MinCostMaxFlow.cc}
\hrulefill
\subsection{Min Cost Max Flow Potential}
\raggedbottom\lstinputlisting[style=cpp]{code/MinCostMaxFlowPotential.cc}
\hrulefill
\subsection{Bounded Feasible Flow}
\raggedbottom\lstinputlisting[style=cpp]{code/BoundedFlow.cc}
\hrulefill
\subsection{Hungarian Algorithm}
\raggedbottom\lstinputlisting[style=cpp]{code/Hungarian.cc}
\hrulefill
\subsection{Undirected mincut}
\raggedbottom\lstinputlisting[style=cpp]{code/MinCut.cc}
\hrulefill
\subsection{Eulerian Path/Circuit}
\raggedbottom\lstinputlisting[style=cpp]{code/Eulerian.cc}
\hrulefill
\subsection{2-SAT}
\raggedbottom\lstinputlisting[style=cpp]{code/TwoSAT.cc}
\hrulefill
\subsection{SPFA}
\raggedbottom\lstinputlisting[style=cpp]{code/SPFA.cc}
\hrulefill
\section{Data structures}
\subsection{Treap}
\raggedbottom\lstinputlisting[style=cpp]{code/Treap.cc}
\hrulefill
\subsection{Big Integer}
\raggedbottom\lstinputlisting[style=cpp]{code/BigInt.cc}
\hrulefill
\subsection{Convex Hull IT}
\raggedbottom\lstinputlisting[style=cpp]{code/ITConvexHull.cc}
\hrulefill
\subsection{Link Cut Tree}
\raggedbottom\lstinputlisting[style=cpp]{code/LinkCutTree.cc}
\hrulefill
\subsection{Ordered Set}
\raggedbottom\lstinputlisting[style=cpp]{code/OrderedSet.cc}
\hrulefill
\subsection{Unordered Map}
\raggedbottom\lstinputlisting[style=cpp]{code/Unordered_map.cc}
\hrulefill
\section{Miscellaneous}
\subsection{RNG}
\raggedbottom\lstinputlisting[style=cpp]{code/RNG.cc}
\hrulefill
\subsection{SQRT forloop}
\raggedbottom\lstinputlisting[style=cpp]{code/SQRT_forloop.cc}
\hrulefill