On this page you can find courses offered at TUM that are specifically designed to help you compete in programming contests such as the ICPC.
There will be a lecture where we explain algorithms for a new topic each week. During the following week, the participants need to solve problems related to this topic. Solutions, different ideas and remarks regarding the problems will be presented in the next lecture. The problems differ in the level of difficulty: There will be problems asking for straightforward implementations of the presented algorithms as well as harder problems taken from several contests. For submitting and judging the submissions we will use TUMjudge, a fork of DOMJudge, which is the system used for almost all rounds of the ICPC.
In this proseminar the participants are given a problem from a former ICPC problem set. These problems are characterized by fun and interesting problem descriptions on the one hand and very compact and elegant solutions on the other hand. Each participant then solves the given problem in a programming language of his / her choice and presents the problem as well as its solution to the other participants.
The goal of this course is to familiarize the participants with algorithms that are needed for a successful competition in programming contests such as the ICPC. Every participant gets a specific topic (e.g. datastructures, sorting algorithms, ...) which he or she presents to the other participants. Following each presentation all participants need to solve problems involving the presented topic.