|
1 |
| -\documentclass[twocolumn]{article} |
| 1 | +\documentclass[10pt]{article} |
2 | 2 | \usepackage[margin=0.5in]{geometry}
|
3 |
| -\usepackage{url,hyperref} |
| 3 | +\usepackage{hyperref} |
4 | 4 | \usepackage{fancyhdr}
|
5 |
| -\usepackage{amsmath} |
6 | 5 | \usepackage{listings}
|
7 | 6 | \usepackage{xcolor}
|
8 | 7 | \usepackage{tocloft}
|
9 | 8 | \usepackage{pdflscape}
|
| 9 | +\usepackage{multicol} |
10 | 10 |
|
11 | 11 | \renewcommand*{\ttdefault}{pcr}
|
12 | 12 | \renewcommand\cftsecfont{\small\bfseries}
|
|
20 | 20 | breaklines=true,
|
21 | 21 | xleftmargin=\parindent,
|
22 | 22 | showstringspaces=false,
|
23 |
| - basicstyle=\scriptsize\ttfamily, |
| 23 | + %basicstyle=\scriptsize\ttfamily, |
| 24 | + basicstyle=\fontsize{6}{7}\ttfamily, |
24 | 25 | keywordstyle=\bfseries\color{green!40!black},
|
25 | 26 | commentstyle=\itshape\color{red!80!black},
|
26 | 27 | identifierstyle=\color{blue},
|
|
48 | 49 | \lstset{escapechar=@}
|
49 | 50 |
|
50 | 51 | \pagestyle{fancy}
|
51 |
| -\lhead{Stanford University} |
52 |
| -\chead{} |
53 |
| -\rhead{\thepage} |
54 |
| -\lfoot{} |
55 |
| -\cfoot{} |
56 |
| -\rfoot{} |
57 |
| - |
58 |
| -\begin{document} |
59 |
| -\begin{landscape} |
60 |
| -\tableofcontents |
61 |
| - |
62 |
| -\section{Combinatorial optimization} |
63 |
| -\subsection{Sparse max-flow} |
64 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/Dinic.cc} |
65 |
| -\subsection{Min-cost max-flow} |
66 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/MinCostMaxFlow.cc} |
67 |
| -\subsection{Push-relabel max-flow} |
68 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/PushRelabel.cc} |
69 |
| -\subsection{Min-cost matching} |
70 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/MinCostMatching.cc} |
71 |
| -\subsection{Max bipartite matching} |
72 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/MaxBipartiteMatching.cc} |
73 |
| -\subsection{Global min-cut} |
74 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/MinCut.cc} |
75 |
| -\subsection{Graph cut inference} |
76 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/GraphCutInference.cc} |
| 52 | +\fancyhf{} |
| 53 | +\fancyhead[L]{Stanford University} |
| 54 | +\fancyhead[C]{} |
| 55 | +\fancyhead[R]{\thepage} |
| 56 | +\fancyfoot[L]{} |
| 57 | +\fancyfoot[C]{} |
| 58 | +\fancyfoot[R]{} |
77 | 59 |
|
78 |
| -\section{Geometry} |
79 |
| -\subsection{Convex hull} |
80 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/ConvexHull.cc} |
81 |
| -\subsection{Miscellaneous geometry} |
82 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/Geometry.cc} |
83 |
| -\subsection{Java geometry} |
84 |
| -\raggedbottom\lstinputlisting[style=customjava]{code/JavaGeometry.java} |
85 |
| -\subsection{3D geometry} |
86 |
| -\raggedbottom\lstinputlisting[style=customjava]{code/Geom3D.java} |
87 |
| -\subsection{Slow Delaunay triangulation} |
88 |
| -\raggedbottom\lstinputlisting[style=customjava]{code/Delaunay.cc} |
| 60 | +\fancypagestyle{plain} |
| 61 | +{ |
| 62 | +\fancyhead[L]{Stanford University} |
| 63 | +\fancyhead[C]{} |
| 64 | +\fancyhead[R]{\thepage} |
| 65 | +\fancyfoot[L]{} |
| 66 | +\fancyfoot[C]{} |
| 67 | +\fancyfoot[R]{} |
| 68 | +} |
89 | 69 |
|
90 |
| -\section{Numerical algorithms} |
91 |
| -\subsection{Number theory (modular, Chinese remainder, linear Diophantine)} |
92 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/Euclid.cc} |
93 |
| -\subsection{Systems of linear equations, matrix inverse, determinant} |
94 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/GaussJordan.cc} |
95 |
| -\subsection{Reduced row echelon form, matrix rank} |
96 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/ReducedRowEchelonForm.cc} |
97 |
| -\subsection{Fast Fourier transform} |
98 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/FFT_new.cpp} |
99 |
| -\subsection{Simplex algorithm} |
100 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/Simplex.cc} |
| 70 | +\title{\vspace{-4ex}\Large{Stanford University ICPC Team Notebook (2015-16)}} |
| 71 | +\author{} |
| 72 | +\date{} |
101 | 73 |
|
102 |
| -\section{Graph algorithms} |
103 |
| -\subsection{Fast Dijkstra\'s algorithm} |
104 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/FastDijkstra.cc} |
105 |
| -\subsection{Strongly connected components} |
106 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/SCC.cc} |
107 |
| -\subsection{Eulerian path} |
108 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/EulerianPath.cc} |
| 74 | +\begin{document} |
| 75 | +\begin{landscape} |
| 76 | +\begin{multicols}{2} |
109 | 77 |
|
110 |
| -\section{Data structures} |
111 |
| -\subsection{Suffix array} |
112 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/SuffixArray.cc} |
113 |
| -\subsection{Binary Indexed Tree} |
114 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/BIT.cc} |
115 |
| -\subsection{Union-find set} |
116 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/UnionFind.cc} |
117 |
| -\subsection{KD-tree} |
118 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/KDTree.cc} |
119 |
| -\subsection{Splay tree} |
120 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/splay.cpp} |
121 |
| -\subsection{Lazy segment tree} |
122 |
| -\raggedbottom\lstinputlisting[style=customjava]{code/SegmentTreeLazy.java} |
123 |
| -\subsection{Lowest common ancestor} |
124 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/LCA.cc} |
| 78 | +\maketitle |
| 79 | +\vspace{-10ex} |
| 80 | +\tableofcontents |
| 81 | +\pagestyle{fancy} |
125 | 82 |
|
126 |
| -\section{Miscellaneous} |
127 |
| -\subsection{Longest increasing subsequence} |
128 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/LongestIncreasingSubsequence.cc} |
129 |
| -\subsection{Dates} |
130 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/Dates.cc} |
131 |
| -\subsection{Regular expressions} |
132 |
| -\raggedbottom\lstinputlisting[style=customjava]{code/LogLan.java} |
133 |
| -\subsection{Prime numbers} |
134 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/Primes.cc} |
135 |
| -\subsection{C++ input/output} |
136 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/IO.cpp} |
137 |
| -\subsection{Knuth-Morris-Pratt} |
138 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/KMP.cpp} |
139 |
| -\subsection{Latitude/longitude} |
140 |
| -\raggedbottom\lstinputlisting[style=customcc]{code/LatLong.cpp} |
141 |
| -\subsection{Emacs settings} |
142 |
| -\raggedbottom\lstinputlisting[style=customtxt]{code/EmacsSettings.txt} |
| 83 | +\input contents.tex |
143 | 84 |
|
| 85 | +\end{multicols} |
144 | 86 | \end{landscape}
|
145 | 87 | \end{document}
|
0 commit comments