Skip to content
Reference material for ACM-ICPC
Branch: master
Clone or download
Latest commit 277c7a5 Mar 25, 2019
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Licenses Initial commit Dec 12, 2014
.gitignore Initial commit Dec 12, 2014
2sat.cpp Initial commit Dec 12, 2014
BIT-range.cpp
BIT.cpp Initial commit Dec 12, 2014
BUILD
KMP.cpp
LICENSING Initial commit Dec 12, 2014
README Initial commit Dec 12, 2014
SBT.cpp Initial commit Dec 12, 2014
ansv.cpp
bignum.cpp Initial commit Dec 12, 2014
bipartite-mincost.cpp Initial commit Dec 12, 2014
bipartite.cpp Initial commit Dec 12, 2014
bridges.cpp Initial commit Dec 12, 2014
bsearch.c Initial commit Dec 12, 2014
chtrick.cpp Initial commit Dec 12, 2014
codebook.tex Initial commit Dec 12, 2014
delaunay.cpp Initial commit Dec 12, 2014
dinic.cpp Initial commit Dec 12, 2014
eulerian.cpp
fft.cpp Prevent memory leak in FFT Nov 7, 2018
gaussian.cpp Initial commit Dec 12, 2014
general-matching.cpp Initial commit Dec 12, 2014
geom-2d.cpp Initial commit Dec 12, 2014
geom-3d.cpp Initial commit Dec 12, 2014
manacher.cpp Initial commit Dec 12, 2014
mcmf4.cpp Initial commit Dec 12, 2014
mincut.cpp Initial commit Dec 12, 2014
modular.cpp Fixed CRT Dec 27, 2018
monotone.cpp Initial commit Dec 12, 2014
pollard-rho.cpp Initial commit Dec 12, 2014
rref.cpp Initial commit Dec 12, 2014
scc.cpp
segtree.cpp Initial commit Dec 12, 2014
simplex.cpp fix errors in simplex.cpp (thanks to Jacob) Jun 18, 2016
stablemp.cpp Initial commit Dec 12, 2014
suffix-array.cpp Fixes to FFT, KMP, and Suffix Array Nov 5, 2018
totient.cpp Initial commit Dec 12, 2014
welzl.cpp Initial commit Dec 12, 2014
yarin.cpp Initial commit Dec 12, 2014

README

This notebook is intended as reference material for a team participating in the
ACM-ICPC World Finals or any regional competition that allows up to 25 pages of
printed reference material. It incorporates code from various sources and is
based on the notebook used by contestants at the University of Toronto from
2013 to 2014.

Because this version of the notebook is intended for redistribution, it
excludes a small amount of proprietary code present in U. of T.'s official team
notebook.

The philosophy used when compiling this notebook was to include material that
will be most useful for experienced contestants, in terms of reducing the
amount of time spent coding and/or debugging. It therefore excludes algorithms
that serious contestants would be able to code quickly and correctly with a
minimum of effort, such as Dijkstra's algorithm. Most of the material in this
notebook is therefore less common, theoretically nontrivial, or tricky to get
right on the first try.
You can’t perform that action at this time.