We went to another training camp this year. This time we chose the picturesque Zillertal as the destination of our trip and rented a nice house there that we filled with servers and cables soon after our arrival. After having 4 teams finishing in the Top 10 of the GCPC 2016 the next step for our best students was to qualify for a spot in one of our teams for NWERC. As some of them were not able to make it to the training camp and the NWERC or they were too old the battle for the spots turned out to be easier than expected. Nevertheless, we had many contests, lots of talks and numerous discussions on programming problems. The topics for the talks varied from team strategies, famous problem from World Finals of the ACM ICPC, the ACM ICPC in Mexico and the key to good estimation to in-depth algorithms like game theory, bipartite matchings, line sweep algorithms, string matchings, Burnside's Lemma, and more. We also had great evenings with a camp fire, card games, and funny electronic gadgets as well as a great excursion to the Wolfsklamm.

Those were the people who went to Zillertal. One of the teams even came all the way from Mexico as we were already happy to announce.

We had a total of five contests with 27 total problems and hundreds of submissions. Team TUMbling was able to claim victory in the final contest. All the scoreboards can be found at the contest judge. Also, all contests are available there for everybody. Can you beat the teams?

rank team score A
1 BAA TUMbling
TU München (1 Win)
5 319 1/64 2/150 1/20 1/57 9 1/8 5
2 BAI oachkatzlschwoaf (SS15)
TU München (9 Wins)
4 218 1 2/82 1/51 1/49 3 1/16 7
3 TUM TUMuchTime
Technische Universität München
4 420 0 3/176 1/36 2/93 0 1/55 1
4 MEX New Avengers
Escuela Superior De Computo Instituto Politecnico Nacional
3 61 1 6 1/7 1/35 0 1/19 0
1135 27 / 25 Summary 16 3/1 13/3 4/4 5/4 12/0 4/4 13/0

(c) ICPC@TUM, Contact/Imprint