Hi and welcome to the tutorials of SOI!
Here we want to explain the basics of our algorithmic tasks to you in all the details. Take a look around you will surely find something interesting for you! If you have any questions or you are stuck with a certain script, just let us know at info@soi.ch.
Programming
First Round
Second Round
- Prefix sum
- [de] Scanline
- [de] Kongruenzen (Modulare Arithmetik)
- [de] Dijkstra
- [de] Union Find
- [de] MST - Minimale Spannbäume
- Floyd-Warshall
- [de] Advanced dynamic programming
- [de] Segmentbaum Grundlagen