References to COCI and USACO

chapter01.tex

@@ -867,7 +867,8 @@ they compete as individuals.
 
 The IOI syllabus \cite{iois} regulates the topics
 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
 national contests.
@@ -878,11 +879,11 @@ and the Asia-Pacific Informatics Olympiad (APIO).
 
 Some countries organize online practice contests
 for future IOI participants,
-such as the Croatian Open Competition in Informatics (COCI)
-and the USA Computing Olympiad (USACO).
+such as the Croatian Open Competition in Informatics \cite{coci}
+and the USA Computing Olympiad \cite{usaco}.
 In addition,
 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}
 

list.tex

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