Contact
Teaching
 |
 |
|
| Practical Course: Algorithms for Programming Contests | ||
 |
 |
| News | Content | Material |
Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.
Problem Sets
- General Information
Information Sheet - Judge - Week 1: Introduction
Problem Set - Information about TUMjudge - Samples - Sample Solutions - Survey - Week 2: Data Structures
Information about Union-Find - Problem Set - Samples - Survey - Week 3: Graph Algorithms (DFS, BFS, Topological Sort, Minimum Spanning Tree)
Lecture Notes - Problem Set - Samples - Survey - Week 4: Shortest Paths
Problem Set - Samples - Survey - Week 5: Maximum Flow
Lecture Notes - Problem Set - Samples - Survey - Week 6: Brute Force/Backtracking
Lecture Notes - Problem Set - Samples - Survey - Cat Pictures - Week 7: Greedy Algorithms
Lecture Notes - Problem Set - Samples - Survey - Week 8: Number Theory
Lecture Notes - Problem Set - Samples - Survey - Week 9: Dynamic Programming
Problem Set - Samples - Survey - Week 10: Geometry
Lecture Notes - Problem Set - Samples - Survey - Week 11: Contest
Problem Set - Samples - Survey