|
1 |
| -\documentclass[a4paper, 13pt, twocolumn, landscape]{book} |
| 1 | +\documentclass[a4paper, 10pt, twocolumn, landscape]{article} |
2 | 2 |
|
3 |
| -\usepackage[left=1cm, right=1cm, bottom=1cm, top=1cm, headsep=0.2cm]{geometry} |
4 |
| -\usepackage{array} |
5 |
| -\usepackage{graphicx} |
| 3 | +\usepackage[english]{babel} |
| 4 | +\usepackage[utf8]{inputenc} |
| 5 | +\usepackage[T1]{fontenc} |
| 6 | +\usepackage{lmodern} |
| 7 | +\usepackage{bookmark} |
6 | 8 | \usepackage{pdflscape}
|
| 9 | +\usepackage{array} |
7 | 10 | \usepackage{multicol}
|
| 11 | +\usepackage[left=1cm, right=1cm, bottom=1cm, top=1cm, headsep=0.2cm]{geometry} |
8 | 12 | \usepackage{fancyhdr}
|
| 13 | +\usepackage{minted} |
9 | 14 | \fancyhead{}
|
10 | 15 | \fancyfoot{}
|
11 | 16 | \lhead{INSTITUTO MILITAR DE ENGENHARIA - \the\year}
|
|
38 | 43 | xleftmargin=0pt,
|
39 | 44 | }
|
40 | 45 |
|
| 46 | +\hypersetup{ |
| 47 | + pdftitle={ICPC Notebook}, |
| 48 | + pdfauthor={Lorem Ipsum}, |
| 49 | + colorlinks=true, |
| 50 | + allcolors=blue, |
| 51 | +} |
| 52 | +\setminted[cpp]{frame=none,breaklines} |
| 53 | + |
41 | 54 | \begin{document}
|
42 | 55 |
|
43 | 56 | \pagestyle{fancy}
|
44 | 57 |
|
45 | 58 | \setlength{\columnseprule}{1pt}
|
46 | 59 | \large
|
47 | 60 |
|
48 |
| - % Basics |
49 |
| - \textbf{Template} |
50 |
| - \lstinputlisting[language=C++]{../../template.cpp} |
51 |
| - \textbf{vimrc} |
52 |
| - \lstinputlisting{../../vimrc} |
| 61 | + \tableofcontents |
| 62 | + |
| 63 | + \section{Basics} |
| 64 | + %\textbf{Template} |
| 65 | + %\inputminted{cpp}{../../template.cpp} |
| 66 | + %\textbf{vimrc} |
| 67 | + %\lstinputlisting{../../vimrc} |
53 | 68 |
|
54 | 69 | \textbf{builtin}
|
55 |
| - \lstinputlisting[language=C++]{misc/builtin.cpp} |
| 70 | + \inputminted{cpp}{misc/builtin.cpp} |
56 | 71 | \textbf{prime numbers}
|
57 | 72 | \lstinputlisting{misc/prime-numbers.txt}
|
58 | 73 | \textbf{Week day}
|
59 |
| - \lstinputlisting[language=C++]{misc/week-day.cpp} |
| 74 | + \inputminted{cpp}{misc/week-day.cpp} |
60 | 75 |
|
61 |
| - % Graphs |
| 76 | + \section{Graphs} |
62 | 77 | \textbf{DFS}
|
63 |
| - \lstinputlisting[language=C++]{graphs/dfs.cpp} |
| 78 | + \inputminted{cpp}{graphs/dfs.cpp} |
64 | 79 | \textbf{BFS}
|
65 |
| - \lstinputlisting[language=C++]{graphs/bfs.cpp} |
| 80 | + \inputminted{cpp}{graphs/bfs.cpp} |
66 | 81 | \textbf{Topological Sort}
|
67 |
| - \lstinputlisting[language=C++]{graphs/kahn.cpp} |
| 82 | + \inputminted{cpp}{graphs/kahn.cpp} |
68 | 83 | \textbf{Articulation points and bridges}
|
69 |
| - \lstinputlisting[language=C++]{graphs/articulation.cpp} |
| 84 | + \inputminted{cpp}{graphs/articulation.cpp} |
70 | 85 | \textbf{Strongly Connected Components}
|
71 |
| - \lstinputlisting[language=C++]{graphs/kosaraju.cpp} |
| 86 | + \inputminted{cpp}{graphs/kosaraju.cpp} |
72 | 87 | \textbf{Minimum Spanning Tree}
|
73 |
| - \lstinputlisting[language=C++]{graphs/kruskal.cpp} |
74 |
| - \lstinputlisting[language=C++]{graphs/prim.cpp} |
| 88 | + \inputminted{cpp}{graphs/kruskal.cpp} |
| 89 | + \inputminted{cpp}{graphs/prim.cpp} |
75 | 90 | \textbf{Shortest path}
|
76 |
| - \lstinputlisting[language=C++]{graphs/dijkstra.cpp} |
77 |
| - \lstinputlisting[language=C++]{graphs/bellman-ford.cpp} |
78 |
| - \lstinputlisting[language=C++]{graphs/spfa.cpp} |
79 |
| - \lstinputlisting[language=C++]{graphs/floyd-warshall.cpp} |
| 91 | + \inputminted{cpp}{graphs/dijkstra.cpp} |
| 92 | + \inputminted{cpp}{graphs/bellman-ford.cpp} |
| 93 | + \inputminted{cpp}{graphs/spfa.cpp} |
| 94 | + \inputminted{cpp}{graphs/floyd-warshall.cpp} |
80 | 95 | \textbf{Maximum Flow}
|
81 |
| - \lstinputlisting[language=C++]{graphs/dinic.cpp} % Flow |
| 96 | + \inputminted{cpp}{graphs/dinic.cpp} % Flow |
82 | 97 | \textbf{Minimum Cost Maximum Flow}
|
83 |
| - \lstinputlisting[language=C++]{graphs/min-cost-max-flow.cpp} % Flow |
| 98 | + \inputminted{cpp}{graphs/min-cost-max-flow.cpp} % Flow |
84 | 99 | \textbf{Maximum Bipartite Cardinality Matching}
|
85 |
| - \lstinputlisting[language=C++]{graphs/kuhn.cpp} |
| 100 | + \inputminted{cpp}{graphs/kuhn.cpp} |
86 | 101 | \textbf{Lowest Common Ancestor}
|
87 |
| - \lstinputlisting[language=C++]{graphs/lca.cpp} |
| 102 | + \inputminted{cpp}{graphs/lca.cpp} |
88 | 103 | \textbf{2-SAT}
|
89 |
| - \lstinputlisting[language=C++]{graphs/2-sat.cpp} |
90 |
| - |
91 |
| - % Math |
| 104 | + \inputminted{cpp}{graphs/2-sat.cpp} |
92 | 105 |
|
| 106 | + \section{Mathematics} |
93 | 107 | \textbf{Number Theory}
|
94 |
| - \lstinputlisting[language=C++]{math/basics.cpp} |
| 108 | + \inputminted{cpp}{math/basics.cpp} |
95 | 109 | \textbf{Primes}
|
96 |
| - \lstinputlisting[language=C++]{math/sieve.cpp} |
| 110 | + \inputminted{cpp}{math/sieve.cpp} |
97 | 111 | \textbf{Euler phi}
|
98 |
| - \lstinputlisting[language=C++]{math/euler-phi.cpp} |
| 112 | + \inputminted{cpp}{math/euler-phi.cpp} |
99 | 113 | \textbf{Extended Euclidean}
|
100 |
| - \lstinputlisting[language=C++]{math/extended-euclid.cpp} |
| 114 | + \inputminted{cpp}{math/extended-euclid.cpp} |
101 | 115 | \textbf{Multiplicative Inverse}
|
102 |
| - \lstinputlisting[language=C++]{math/mult-inverse.cpp} |
| 116 | + \inputminted{cpp}{math/mult-inverse.cpp} |
103 | 117 | \textbf{Prime factors}
|
104 |
| - \lstinputlisting[language=C++]{math/prime-factors.cpp} |
105 |
| - \lstinputlisting[language=C++]{math/pollard-rho.cpp} |
| 118 | + \inputminted{cpp}{math/prime-factors.cpp} |
| 119 | + \inputminted{cpp}{math/pollard-rho.cpp} |
106 | 120 | \textbf{Primarily test}
|
107 |
| - \lstinputlisting[language=C++]{math/miller-rabin.cpp} |
| 121 | + \inputminted{cpp}{math/miller-rabin.cpp} |
108 | 122 | \textbf{Fast Fourier Transform}
|
109 |
| - \lstinputlisting[language=C++]{math/fft.cpp} |
110 |
| - |
111 |
| - % Strings |
| 123 | + \inputminted{cpp}{math/fft.cpp} |
112 | 124 |
|
| 125 | + |
| 126 | + \section{Strings} |
113 | 127 | \textbf{String Matching}
|
114 |
| - \lstinputlisting[language=C++]{strings/rabin-karp.cpp} |
115 |
| - \lstinputlisting[language=C++]{strings/kmp.cpp} |
116 |
| - \lstinputlisting[language=C++]{strings/suffix-array.cpp} |
117 |
| - |
118 |
| - % Data Structures |
| 128 | + \inputminted{cpp}{strings/rabin-karp.cpp} |
| 129 | + \inputminted{cpp}{strings/kmp.cpp} |
| 130 | + \inputminted{cpp}{strings/suffix-array.cpp} |
119 | 131 |
|
| 132 | + |
| 133 | + \section{Data Structures} |
120 | 134 | \textbf{Disjoint Set Union}
|
121 |
| - \lstinputlisting[language=C++]{data-structures/dsu.cpp} |
| 135 | + \inputminted{cpp}{data-structures/dsu.cpp} |
122 | 136 | \textbf{Sparse Table}
|
123 |
| - \lstinputlisting[language=C++]{data-structures/sparse-table.cpp} |
| 137 | + \inputminted{cpp}{data-structures/sparse-table.cpp} |
124 | 138 | \textbf{Fenwick Tree}
|
125 |
| - \lstinputlisting[language=C++]{data-structures/bit.cpp} |
| 139 | + \inputminted{cpp}{data-structures/bit.cpp} |
126 | 140 | \textbf{Fenwick Tree 2D}
|
127 |
| - \lstinputlisting[language=C++]{data-structures/bit2d.cpp} |
| 141 | + \inputminted{cpp}{data-structures/bit2d.cpp} |
128 | 142 | \textbf{Segment Tree}
|
129 |
| - \lstinputlisting[language=C++]{data-structures/segtree.cpp} |
| 143 | + \inputminted{cpp}{data-structures/segtree.cpp} |
130 | 144 | \textbf{Heavy-Light Decomposition}
|
131 |
| - \lstinputlisting[language=C++]{data-structures/hld.cpp} |
| 145 | + \inputminted{cpp}{data-structures/hld.cpp} |
132 | 146 |
|
133 | 147 | \newpage
|
134 | 148 | \onecolumn
|
|
0 commit comments