Competitive Programming

  • Shallow men believe in luck. Strong men believe in cause and effect.


    ICPC The Competative Programming course will be held yearly. It will practice principles and methods for programming for the international programming contest ACM/ICPC. At the end of the course, a local competition will be held, the winners of which will represent The Technion in the international programming contest. Teams of three students will have to solve about 10 programming questions in a period of 5 hours, using only a single computer.


    The course will consist of a weekly 2-hours practice, and will concentrate on preparing the teams for solving the questions. The course will include theoretical analysis of questions from previous contests, and correct and fast solutions will be shown. Among other topics, the talks will include issues on complexity, practical complexity of memory and runing time, typical algorithms and data structures (such as BFS, DFS, Dijkstra, Trie, Suffix trees, Union-find, etc.), their usage, and simple implementations.


    Spring 2009 - Competetive programming
    Spring 2008 - Competetive programming
    Portal for solving hundreds of ACM ICPC questions
    2008 world finals problem set