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
Preliminary Meeting (Slides) - Information Sheet - Judge - Week 1: Introduction
Problem Set - Lecture Notes - Samples - Sample Solutions - Week 2: Data Structures
Problem Set - Lecture Notes - Samples - Week 3: DFS/BFS/Topological Sort/MST
Problem Set - Lecture Notes - Samples - Week 4: Shortest Paths
Problem Set - Lecture Notes - Samples - Week 5: Maximum Flow
Problem Set - Lecture Notes - Samples - Week 6: Brute Force/Backtracking
Problem Set - Lecture Notes - Samples - Week 7: Greedy/Approximation
Problem Set - Lecture Notes - Samples - Week 8: Dynamic Programming
Problem Set - Lecture Notes - Samples - Week 9: Number Theory
Problem Set - Lecture Notes - Samples - Week 10: Segment Trees/Tries
Problem Set - Lecture Notes - Samples - Week 11: Geometry
Problem Set - Lecture Notes - Samples - Week 12: Projective Geometry
Problem Set - Lecture Notes - Samples - Week 13: Contest
Problem Set - Samples