Practical Course: Algorithms for Programming Contests

Course materials

• General Information
  Preliminary Meeting (Slides) - Sample problem - Judge
• Meeting 01 Meeting slides - Problems - Sample input files
• Meeting 02 Meeting slides - Problems - Sample input files
• Meeting 03 Meeting slides - Problems - Sample input files - Solution notes for the previous week
• Meeting 04 Meeting slides - Problems - Sample input files - Solution notes for the previous week
• Some students are asking for general advice on approaches to problem solving — please share your experience with your coursemates!
• Meeting 05 Meeting slides - Problems - Sample input files - Solution notes for the previous week
• Meeting 06 Meeting slides - Problems - Sample input files - Solution notes for the previous week
• Meeting 07 Meeting slides - Problems - Sample input files - Solution notes for the previous week
• Meeting 08 Meeting slides - Problems - Sample input files - Solution notes for the previous week
• Meeting 08: bonus testcase contest for Week 07's Soup Delivery Archive with the solutions to break
  AES-CTR scoring: 2 points for breaking each (almost-reasonable) solution (providing a test case that makes it go outside 4x approximation bound), +1 point for a generator capable to provide many diverse testcases breaking the same solution (please specify what is the success rate), and more (see README.txt inside the archive)
  Submission via the course email, conpra@in.tum.de
• Meeting 09 Meeting slides - Problems - Sample input files - Solution notes for the previous week
• Meeting 10 Meeting slides - Problems - Sample input files - Solution notes for the previous week
• Meeting 11 Meeting slides - Problems - Sample input files - Solution notes for the previous week
• Meeting 12 Meeting slides - Problems - Sample input files - Solution notes for the previous week

Expected knowledge at the exam

• Meeting 13 Problems - Sample input files - Solution notes for the previous week
• Meeting 14 Solution notes for the previous week