tno.tex

%"The PDF file may contain up to 25 pages of reference material, single-sided, letter or A4 size, with text and illustrations readable by a person with correctable eyesight without magnification from a distance of 1/2 meter."
\input{preamble.tex}
\begin{document}
\def\title{Universidad Autonoma de Ciudad Juarez - First to Penalty}
.\\[0.2cm]
\centering{\LARGE\textbf{First to Penalty}} \\[0.5cm]
\centering{\includegraphics[width=5.5cm]{penalty.png}}
\tableofcontents\newpage

\section{Template}
\cppfile{template.cpp}

\section{Data structures}
\subsection{struct}
\cppfile{data_structures/costocarretera.cpp}
\subsection{segTree}
\cppfile{data_structures/segmentTreeGlobal.cpp}


\section{Graphs}
\subsection{bfs}
\cppfile{graphs/bfs.cpp}
\subsection{dfs}
\cppfile{graphs/dfs.cpp}

\section{Math}
\subsection{Identities}
{
$C_n = \frac{2(2n-1)}{n+1} C_{n-1}$

$C_n = \frac{1}{n+1} \binom{2n}{n}$

$C_n \sim \frac{4^n}{n^{3/2}\sqrt{\pi}}$

$\sigma(n) = O(\log(\log(n)))$ (number of divisors of $n$)

$F_{2n+1} = F_{n}^2 + F_{n+1}^2$

$F_{2n} = F_{n+1}^2 - F_{n-1}^2$

$\sum_{i=1}^n F_i = F_{n+2}-1$

$F_{n+i}F_{n+j} - F_nF_{n+i+j} = (-1)^n F_iF_j$

(Möbius Inv. Formula)
Let $g(n) = \sum_{d\mid n} f(d)$, then $f(n)=\sum{d\mid n} g(d) \mu\left(\frac{n}{d})\right)$.
}
\subsection{bits}
\cppfile{math/bits.cpp}
\subsection{gcd_lcm}
\cppfile{math/gcd_lcm.cpp}
\subsection{min_sum_sq}
\cppfile{math/min_sum_sq.cpp}
\subsection{mod}
\cppfile{math/mod.cpp}
\subsection{perm_comb}
\cppfile{math/perm_comb.cpp}

\section{Geometry}


\section{Strings}
\subsection{Common}
\cppfile{strings/common.cpp}
\subsection{KMP}
\cppfile{strings/kmt.cpp}


\section{Flow}


\section{Miscellaneous}
\subsection{Backtracking}
\cppfile{misc/backtracking.cpp}
\subsection{Binary Search}
\cppfile{misc/binarysearch.cpp}
\subsection{Dijsktra}
\cppfile{misc/dijsktra.cpp}
\subsection{knapsack}
\cppfile{misc/knapsack.cpp}
\subsection{laberinto}
\cppfile{misc/laberinto.cpp}
\subsection{lcs}
\cppfile{misc/lcs.cpp}
\subsection{most_data_structures}
\cppfile{misc/most_data_structures.cpp}
\subsection{num_prime_factors}
\cppfile{misc/num_prime_factors.cpp}
\subsection{primes_in_range}
\cppfile{misc/primes_in_range.cpp}
\subsection{weird_input}
\cppfile{misc/weird_input.cpp}

%\subsection{Bit Manipulation}
%\cppfile{Miscellaneous/bitManip.cpp}
%\cppfile{Miscellaneous/moreBitManin.cpp}

\section{Testing}



\end{document}