-
Notifications
You must be signed in to change notification settings - Fork 521
IOI Syllabus
Errichto edited this page May 21, 2019
·
4 revisions
https://people.ksp.sk/~misof/ioi-syllabus/ioi-syllabus.pdf (as of 2019)
I wrote down what surprised me or at least wasn't obvious to me.
- Inclusion-exclusion
- Combinatorics
- Euler’s tour on a tree
- Bipartite matching in O(V*E)
- Basics of combinatorial game theory, winning and losing positions, minimax
- BST, BIT/Fenwick
- Creating persistent data structures by path copying
- Discrete probability
- Using fractions to perform exact calculations
- Randomized algorithms
- Online algorithms
- Gcd
- Chinese remainder theorem
- Modular division/inversion
- 3d geometry
- Precision issues
- Trigonometry
- Burnside
- Linear algebra, matrices, Gaussian elimination
- Calculus
- NIM
- Max flow
- KMP
- Heavy-light decomposition
- “Separator structures for static trees” - centroids?
- Understanding hash tables
- 2D trees
- Center of the mass of a 2D object