-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathcodebook.tex
executable file
·130 lines (126 loc) · 5.18 KB
/
codebook.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
\input{header.tex}
\section{Basic}
\subsection{Vimrc}
\lstinputlisting [language=bash] {"code/Basic/vimrc.sh"}
\section{DataStructure}
\subsection{2DSegmentTree}
\lstinputlisting [language=c++] {"code/DataStructure/2DSegmentTree.cpp"}
\subsection{KDTree}
\lstinputlisting [language=c++] {"code/DataStructure/KDTree.cpp"}
\subsection{SparseTable}
\lstinputlisting [language=c++] {"code/DataStructure/SparseTable.h"}
\subsection{Treap}
\lstinputlisting [language=c++] {"code/DataStructure/Treap.cpp"}
\subsection{Link Cut Tree}
\lstinputlisting [language=c++] {"code/DataStructure/link_cut_tree.cpp"}
\subsection{Pb Ds Heap}
\lstinputlisting [language=c++] {"code/DataStructure/pb_ds heap.cpp"}
\subsection{Pb Ds Rbtree}
\lstinputlisting [language=c++] {"code/DataStructure/pb_ds rbtree.cpp"}
\section{Flow}
\subsection{Dinic}
\lstinputlisting [language=c++] {"code/Flow/Dinic.cpp"}
\subsection{Gomory Hu}
\lstinputlisting [language=c++] {"code/Flow/Gomory_Hu.cpp"}
\subsection{Min Cost Flow}
\lstinputlisting [language=c++] {"code/Flow/Min Cost Flow.cpp"}
\subsection{SW-mincut}
\lstinputlisting [language=c++] {"code/Flow/SW-mincut.cpp"}
\section{Geometry}
\subsection{2Dpoint}
\lstinputlisting [language=c++] {"code/Geometry/2Dpoint.cpp"}
\subsection{ConvexHull}
\lstinputlisting [language=c++] {"code/Geometry/ConvexHull.cpp"}
\subsection{Intersection Of Two Circle}
\lstinputlisting [language=c++] {"code/Geometry/Intersection_of_two_circle.cpp"}
\subsection{Intersection Of Two Lines}
\lstinputlisting [language=c++] {"code/Geometry/Intersection_of_two_lines.cpp"}
\subsection{Smallest Circle}
\lstinputlisting [language=c++] {"code/Geometry/Smallest_Circle.cpp"}
\subsection{Circumcentre}
\lstinputlisting [language=c++] {"code/Geometry/circumcentre.cpp"}
\subsection{Half Plane Intersection}
\lstinputlisting [language=c++] {"code/Geometry/half_plane_intersection.cpp"}
\section{Graph}
\subsection{BCC Edge}
\lstinputlisting [language=c++] {"code/Graph/BCC_edge.cpp"}
\subsection{Dijkstra}
\lstinputlisting [language=python] {"code/Graph/Dijkstra.py"}
\subsection{Directed MST}
\lstinputlisting [language=c++] {"code/Graph/Directed_MST.cpp"}
\subsection{LCA}
\lstinputlisting [language=c++] {"code/Graph/LCA.cpp"}
\subsection{MaximumClique}
\lstinputlisting [language=c++] {"code/Graph/MaximumClique.cpp"}
\subsection{Min Mean Cycle}
\lstinputlisting [language=c++] {"code/Graph/Min_mean_cycle.cpp"}
\subsection{MinimumSteinerTree}
\lstinputlisting [language=c++] {"code/Graph/MinimumSteinerTree.cpp"}
\subsection{Tarjan}
\lstinputlisting [language=c++] {"code/Graph/Tarjan.cpp"}
\subsection{TwoSAT}
\lstinputlisting [language=c++] {"code/Graph/TwoSAT.cpp"}
\section{Matching}
\subsection{KM}
\lstinputlisting [language=c++] {"code/Matching/KM.cpp"}
\subsection{Maximum General Matching}
\lstinputlisting [language=c++] {"code/Matching/Maximum_General_Matching.cpp"}
\subsection{Minimum General Weighted Matching}
\lstinputlisting [language=c++] {"code/Matching/Minimum_General_Weighted_Matching.cpp"}
\subsection{Stable Marriage}
\lstinputlisting [language=c++] {"code/Matching/Stable Marriage.cpp"}
\section{Math}
\subsection{FFT}
\lstinputlisting [language=c++] {"code/Math/FFT.cpp"}
\subsection{GaussElimination}
\lstinputlisting [language=c++] {"code/Math/GaussElimination.cpp"}
\subsection{Karatsuba}
\lstinputlisting [language=c++] {"code/Math/Karatsuba.cpp"}
\subsection{LinearPrime}
\lstinputlisting [language=c++] {"code/Math/LinearPrime.cpp"}
\subsection{Miller-Rabin}
\lstinputlisting [language=c++] {"code/Math/Miller-Rabin.cpp"}
\subsection{Mobius}
\lstinputlisting [language=c++] {"code/Math/Mobius.cpp"}
\subsection{Simplex}
\lstinputlisting [language=c++] {"code/Math/Simplex.cpp"}
\subsection{Sprague-Grundy}
\lstinputlisting [language=c++] {"code/Math/Sprague-Grundy.cpp"}
\subsection{Ax+by=gcd}
\lstinputlisting [language=c++] {"code/Math/ax+by=gcd.cpp"}
\subsection{PollardRho}
\lstinputlisting [language=c++] {"code/Math/pollardRho.cpp"}
\subsection{Theorem}
\lstinputlisting [language=c++] {"code/Math/theorem.cpp"}
\section{Other}
\subsection{CYK}
\lstinputlisting [language=c++] {"code/Other/CYK.cpp"}
\subsection{DP-optimization}
\lstinputlisting [language=c++] {"code/Other/DP-optimization.txt"}
\subsection{DigitCounting}
\lstinputlisting [language=c++] {"code/Other/DigitCounting.cpp"}
\subsection{Dp1D1D}
\lstinputlisting [language=c++] {"code/Other/Dp1D1D.cpp"}
\subsection{ManhattanMST}
\lstinputlisting [language=c++] {"code/Other/ManhattanMST.cpp"}
\subsection{Count Spanning Tree}
\lstinputlisting [language=c++] {"code/Other/count_spanning_tree.cpp"}
\section{String}
\subsection{AC}
\lstinputlisting [language=c++] {"code/String/AC.cpp"}
\subsection{BWT}
\lstinputlisting [language=c++] {"code/String/BWT.cpp"}
\subsection{KMP}
\lstinputlisting [language=c++] {"code/String/KMP.h"}
\subsection{PalindromicTree}
\lstinputlisting [language=c++] {"code/String/PalindromicTree.cpp"}
\subsection{SAM}
\lstinputlisting [language=c++] {"code/String/SAM.cpp"}
\subsection{Z-value}
\lstinputlisting [language=c++] {"code/String/Z-value.cpp"}
\subsection{Smallest Rotation}
\lstinputlisting [language=c++] {"code/String/smallest_rotation.cpp"}
\subsection{Suffix Array}
\lstinputlisting [language=c++] {"code/String/suffix_array.cpp"}
\input{note.tex}
\end{document}