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.
First Round
- [de] Die erste Runde in Python lösen
- Code::Blocks Setup for SOI
- VSCode for SOI
- [de] Einführung in die Programmierung
- Introduction to Algorithm Design
- Dynamic Programming - Basics
- Binary-Search
- [de] Tiefensuche
- [de] Breitensuche
- Graph theory
- [de] C++ Standardbibliothek
- [de] Ad-hoc Strategies
- Topological Sorting
- Introduction to Theoretical Tasks
- Theoretical-Greedy
Second Round
- [de] Dijkstra
- [de] MST - Minimale Spannbäume
- [de] Union Find
- [de] Einführung in Geometrie
- [de] Convex Hull
- [de] Advanced dynamic programming
- Backtracking
- [de] Scanline
- [de] Sortieren und Suchen
- Prefix sum
- [de] Was tun wenn du absolut davon überzeugt bist, dass dein Program funktioniert, der Grader aber nicht deiner Meinung ist.
- [de] Segmentbaum Grundlagen