bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

References to COCI and USACO

This commit is contained in:
Antti H S Laaksonen 2017-04-18 21:34:34 +03:00
parent d9eb74f39f
commit 149611e057
2 changed files with 14 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
chapter01.tex
View File

@ -867,7 +867,8 @@ they compete as individuals.
The IOI syllabus \cite{iois} regulates the topics The IOI syllabus \cite{iois} regulates the topics
that may appear in IOI tasks. that may appear in IOI tasks.
This book covers almost all the topics in the IOI syllabus. Almost all the topics in the IOI syllabus
are covered by this book.
Participants for the IOI are selected through Participants for the IOI are selected through
national contests. national contests.
@ -878,11 +879,11 @@ and the Asia-Pacific Informatics Olympiad (APIO).
Some countries organize online practice contests Some countries organize online practice contests
for future IOI participants, for future IOI participants,
such as the Croatian Open Competition in Informatics (COCI) such as the Croatian Open Competition in Informatics \cite{coci}
and the USA Computing Olympiad (USACO). and the USA Computing Olympiad \cite{usaco}.
In addition, In addition,
many problems from Polish contests many problems from Polish contests
are available online\footnote{Młodzieżowa Akademia Informatyczna (MAIN), \texttt{http://main.edu.pl/}}. are available online \cite{main}.
\subsubsection{ICPC} \subsubsection{ICPC}

9
list.tex
View File

@ -55,6 +55,9 @@
% \emph{Theory of Groups of Finite Order}, % \emph{Theory of Groups of Finite Order},
% Cambridge University Press, 1897. % Cambridge University Press, 1897.
\bibitem{coci}
Croatian Open Competition in Informatics, \url{http://hsin.hr/coci/}
\bibitem{cod15} \bibitem{cod15}
Codeforces: On ''Mo's algorithm'', Codeforces: On ''Mo's algorithm'',
\url{http://codeforces.com/blog/entry/20032} \url{http://codeforces.com/blog/entry/20032}
@ -256,6 +259,9 @@
An $O(n \log n)$ algorithm for finding all repetitions in a string. An $O(n \log n)$ algorithm for finding all repetitions in a string.
\emph{Journal of Algorithms}, 5(3):422--432, 1984. \emph{Journal of Algorithms}, 5(3):422--432, 1984.
\bibitem{main}
Młodzieżowa Akademia Informatyczna (MAIN), \texttt{http://main.edu.pl/}
% \bibitem{ore60} % \bibitem{ore60}
% Ø. Ore. % Ø. Ore.
% Note on Hamilton circuits. % Note on Hamilton circuits.
@ -345,6 +351,9 @@
Dimer problem in statistical mechanics -- an exact result. Dimer problem in statistical mechanics -- an exact result.
\emph{Philosophical Magazine}, 6(68):1061--1063, 1961. \emph{Philosophical Magazine}, 6(68):1061--1063, 1961.
\bibitem{usaco}
USA Computing Olympiad, \url{http://www.usaco.org/}
\bibitem{war23} \bibitem{war23}
H. C. von Warnsdorf. H. C. von Warnsdorf.
\emph{Des Rösselsprunges einfachste und allgemeinste Lösung}. \emph{Des Rösselsprunges einfachste und allgemeinste Lösung}.