Home

Practical Track

Results 1P

The results of the practical part of the first round:

Rank Participant Points (maximum: 50)
1. Beat Küng 49
1. Simon Laube 49
3. Daniel Graf 48
4. Adrian Roos and Isaac Deutsch and Lorenz Hulfeld 47
4. Dominik Böhi 47
6. Timon Gehr 45
7. Hans Sjökvist 37
8. Marc Schmid 35.5
9. Florian Scheidegger 35
9. Christian Zommerfelds 35
11. Yassin Nasir Hassan
12. Jan Hermann
12. Titus Cieslewski
14. André Ryser
15. Paul Frischknecht
16. Livio Sgier
17. Alexander Kayed
18. Kieran Nirkko and Amos Gfeller
18. Josef Ziegler
18. Johannes Wüthrich
21. Kirusanth Poopalasingam
22. Christian Mäder
23. Peregrine Park
23. Carlo Beltrame
25. Jean Gauthier
26. Martin Jehli
27. Dominik Wild
28. Andreas Wildi
29. Muriel Pauli and Fiona Pacifico and Solange Emmenegger

Practical Track

For the practical round, you are asked to write and submit the source code of a complete program capable of solving the specified task. For this we have prepared five juicy tasks to keep you occupied:

  1. Phone Numbers
  2. Cheese on gears
  3. Darts II
  4. Smallest Subnumber
  5. Mousipedia

For this track you can work in teams of up to three participants.

Requirements

You should submit a zip or tar.gz file that contains a folder named according to your proper name(s) (first and last name). For each task that you solved, you should create a folder inside containing

  • NO BINARIES
  • Source Code of the Program
  • Explanation how to run or compile (in a Plain Text or Makefile)
  • Your results for the sample inputs (task.in ⇒ task.out)
  • A file called «documentation» (optional), suggested format: plain text, pdf or latex.

If possible, try to have just a single source file in order not to complicate things. At the top of the source, include a header specifying which task you solved, which programming language you used and a list of all team members: 

/*
  Task: sample
  Lang: C++
  Users: soi, chuck
*/

Grading

A program that correctly solves all test cases within reasonable time (seconds) will receive the maximum score. For the time constraint we are looking at the asymptotic runtime complexity of your program. This generally means you should optimize your run time from months to seconds, but not from 5s to 3s. Moreover your programs can use memory up to a «reasonable» limit (100MB as a rough value).

  • If your code is fast and correct, you will score the maximum (and no extra points can be gained from the documentation).
  • If your program is correct, but slow, you will be awarded partial points depending on how slow it is.
  • If your program is fast but (partially) incorrect, you will not score any points.

Documentation

We encourage you to also write an explanation (in words), what the idea is behind your program. If your program has a bug, you will loose all the points caused by the bug, unless you send a correct (and good) documentation. In the latter case we will award partial points depending on the quality of the content of your documentation and source code. Thus you can save some of these lost points.

These rules are intended to avoid an art contest. (You should learn something when explaining your solution in words.)