C.tex

\section{C}%
\label{sec:c}

\begin{frame}
  \frametitle{Problem C: Cold War}

  \begin{itemize}
    \item First solve at 00:27 by \textbf{Jonathan1234} (Naixin Zong)
    \item Implementation problem: figure out if you can make it out of a duel without getting shot
    \item One possible solution: try shooting everyone and see what happens 
    \item Complexity: $O(n^2)$
    \item Another possible solution: order everyone by reaction time, then step through until your turn
    \item Complexity: $O(n \log n)$
  \end{itemize}

\end{frame}

\begin{frame}
  \frametitle{Problem C: $O(n^2)$ try-everyone solution}
  \pyf{Cbrute}
\end{frame}

\begin{frame}
  \frametitle{Problem C: $O(n^2)$ try-everyone solution (continued)}
  \pyf{Cbrute2}
\end{frame}

\begin{frame}
  \frametitle{Problem C: $O(n \log n)$ ordering solution}
  \pyf{Cfast}
\end{frame}