GitHub - BayMax12/codebook: Reference material for ACM-ICPC

BayMax12 / codebook Public

forked from t3nsor/codebook

Notifications You must be signed in to change notification settings
Fork 1
Star 0

Reference material for ACM-ICPC

0 stars 185 forks Branches Tags Activity

Notifications

Name	Name	Last commit message	Last commit date
Latest commit History 2 Commits 2 Commits
Licenses	Licenses
.gitignore	.gitignore
2sat.cpp	2sat.cpp
BIT-range.cpp	BIT-range.cpp
BIT.cpp	BIT.cpp
BUILD	BUILD
KMP.cpp	KMP.cpp
LICENSING	LICENSING
README	README
SBT.cpp	SBT.cpp
ansv.cpp	ansv.cpp
bignum.cpp	bignum.cpp
bipartite-mincost.cpp	bipartite-mincost.cpp
bipartite.cpp	bipartite.cpp
bridges.cpp	bridges.cpp
bsearch.c	bsearch.c
chtrick.cpp	chtrick.cpp
codebook.tex	codebook.tex
delaunay.cpp	delaunay.cpp
dinic.cpp	dinic.cpp
eulerian.cpp	eulerian.cpp
fft.cpp	fft.cpp
gaussian.cpp	gaussian.cpp
general-matching.cpp	general-matching.cpp
geom-2d.cpp	geom-2d.cpp
geom-3d.cpp	geom-3d.cpp
manacher.cpp	manacher.cpp
mcmf4.cpp	mcmf4.cpp
mincut.cpp	mincut.cpp
modular.cpp	modular.cpp
monotone.cpp	monotone.cpp
pollard-rho.cpp	pollard-rho.cpp
rref.cpp	rref.cpp
scc.cpp	scc.cpp
segtree.cpp	segtree.cpp
simplex.cpp	simplex.cpp
stablemp.cpp	stablemp.cpp
suffix-array.cpp	suffix-array.cpp
totient.cpp	totient.cpp
welzl.cpp	welzl.cpp
yarin.cpp	yarin.cpp

Repository files navigation

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.