-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathnotebook.tex
133 lines (124 loc) · 5.59 KB
/
notebook.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
\documentclass[twocolumn, landscape]{report}
\usepackage{verbatim}
\usepackage{listings}
\lstset
{
numbers=left,
basicstyle=\footnotesize,
breaklines=true,
}
\usepackage[a4paper,margin=0.5in]{geometry}
\setcounter{tocdepth}{4}
\setcounter{secnumdepth}{0}
\begin{document}
\title{ACM ICPC Code Notebook}
\author{UofT Blue 2018}
\maketitle
\tableofcontents
\chapter*{Templates}
\addcontentsline{toc}{chapter}{Templates}
\section{C++}
\lstinputlisting[language=c++]{template.cpp}
\newpage
\section{Java}
\lstinputlisting[language=java]{templateJava.java}
\section{Makefile}
\lstinputlisting[]{MakefileDEBUG}
\chapter*{Algorithms}
\addcontentsline{toc}{chapter}{Algorithms}
\section{Graphs}
\subsection{AP \& Bridges}
\lstinputlisting[language=c++]{Algorithms/AP_Bridges.cpp}
\subsection{Centroid Decomposition}
\subsubsection{Centroid Decomposition}
\lstinputlisting[language=c++]{Algorithms/centroiddecomposition.cpp}
\subsubsection{Centroid Decomposition (Eoin)}
\lstinputlisting[language=c++]{Algorithms/Centroid_Decomp.cpp}
\subsection{Network Flow}
\subsubsection{Dinic's Blocking flow}
\lstinputlisting[language=c++]{Algorithms/flow.cpp}
\subsubsection{Edmond Karp}
\lstinputlisting[language=c++]{Algorithms/Edmond_Karp.cpp}
\subsubsection{Ford Fulkerson 1}
\lstinputlisting[language=c++]{Algorithms/Ford_Fulkerson.cpp}
\subsubsection{Ford Fulkerson 2}
\lstinputlisting[language=c++]{Algorithms/flow_Ford_Fulkerson.cpp}
\subsection{Lowest Common Ancestor}
\subsubsection{Lowest Common Ancestor (Using RMQ)}
\lstinputlisting[language=c++]{Algorithms/LCA.cpp}
\subsubsection{Lowest Common Ancestor (Using Binary Lifting)}
\lstinputlisting[language=c++]{Algorithms/binarylifting_lca.cpp}
\subsection{Minimum Spanning Tree (Kruskal's)}
\lstinputlisting[language=c++]{Algorithms/MST.cpp}
\subsection{Strongly Connected Components (Tarjan's)}
\lstinputlisting[language=c++]{Algorithms/SCC_Tarjans.cpp}
\subsection{Bipartite Check}
\lstinputlisting[language=c++]{Algorithms/checkbipartite.cpp}
\subsection{Dijkstras}
\lstinputlisting[language=c++]{Algorithms/dijkstras.cpp}
\subsection{Find Cycles}
\lstinputlisting[language=c++]{Algorithms/findcicles.cpp}
\section{Arrays}
\subsection{Longest Increasing Subsequence}
\lstinputlisting[language=c++]{Algorithms/LIS.cpp}
\chapter*{Data Structures}
\addcontentsline{toc}{chapter}{Data Structures}
\section{Fenwick Tree}
\lstinputlisting[language=c++]{Algorithms/Fenwick.cpp}
\section{Segment Trees}
\subsection{Segment Tree Lazy}
\lstinputlisting[language=c++]{Algorithms/segtreelazy.cpp}
\subsection{Segment Tree (Eoin)}
\lstinputlisting[language=c++]{Algorithms/Segment_Tree.cpp}
\subsection{Iterative Segment Tree}
\lstinputlisting[language=c++]{Algorithms/segtreeIteractive.cpp}
\section{Sparse Table}
\lstinputlisting[language=c++]{Algorithms/Sparse_Table.cpp}
\section{Union Find}
\lstinputlisting[language=c++]{Algorithms/union_find.cpp}
\chapter*{Strings}
\addcontentsline{toc}{chapter}{Strings}
\section{KMP}
\subsection{KMP}
\lstinputlisting[language=c++]{Strings/kmp.cpp}
\subsection{KMP (Eoin)}
\lstinputlisting[language=c++]{Strings/KMPEOIN.cpp}
\section{Rabin Karp}
\lstinputlisting[language=c++]{Strings/rabinkarp.cpp}
\section{Suffix Array}
\lstinputlisting[language=c++]{Strings/SuffixArray.cpp}
\section[Manacher's Algorithm]{Manacher's algorithm for longest palindromic substring}
\lstinputlisting[language=c++]{Strings/manacher.cpp}
\section{Z function}
\lstinputlisting[language=c++]{Strings/z.cpp}
\section{Trie}
\lstinputlisting[language=c++]{Strings/Trie.cpp}
\section{Hash}
\lstinputlisting[language=c++]{Strings/hash.cpp}
\chapter*{Geometry}
\addcontentsline{toc}{chapter}{Geometry}
\section{Convex Hull}
\subsection{Convex Hull}
\lstinputlisting[language=c++]{Geometry/convex_hull.cpp}
\subsection{Convex Hull (Eoin)}
\lstinputlisting[language=c++]{Geometry/Convex_HullEOIN.cpp}
\section{Geometry Functions}
\lstinputlisting[language=c++]{Geometry/Geometry.cpp}
\lstinputlisting[language=c++]{Geometry/functions.cpp}
\chapter*{Math}
\addcontentsline{toc}{chapter}{Math}
\section{Binomial Coefficients}
\lstinputlisting[language=c++]{Math/binomial.cpp}
\section{Ternary Search}
\lstinputlisting[language=c++]{Algorithms/ternarysearch.cpp}
\section{Miller Rabin primality test}
\lstinputlisting[language=c++]{Math/Miller_Rabin.cpp}
\section{Fast fourier transform}
\lstinputlisting[language=c++]{Math/fft.cpp}
\section{Matrix Exponentiation}
\lstinputlisting[language=c++]{Algorithms/matrixpower.cpp}
\section{Math Tricks}
\lstinputlisting[language=c++]{Math/tricks.cpp}
\section{Theorems}
\lstinputlisting[]{Math/math.txt}
\end{document}