On November 15-17, the
TopCoder Collegiate Challenge Algorithm Competition onsight tours (three semi-finals and WildCard) took place, which resulted in eight TCCC 2006 finalists who were determined. . This is due to the fact that recently he has become less trained because of doctoral studies and other scientific workload. The Russian, Peter Mitrichev, was “unrealistically annealed” in the third semifinal, where he ended up following the draw.
In addition to the fact that Petya solved all three tasks, he surprised everyone at the chelledzh phase (10 minutes long), successfully read 6 decisions of competitors and earned enough points to pass to WildCard - 300 (50 for each successful challenge). But the points for the challenge were just a nice addition to the dialects collected by him in the amount of 1687.16, which is almost 700 more than the nearest pursuer. Considering that the fate of players is often decided by read run points, the result is simply incredible. Indeed, Petya is now at the peak of his form, and his
first place in the CU rating is too much confirmation of this - after this semi-final he has 3505 points, and this is Mitrichev's best achievement in the rating.
So, in the onsight final, which will be held on November 18 at 01.30 am Moscow time, will take part:
')
Ying (China)
ACRush (China)
mathijs (Holland)
bmerry (South Africa)
Eryx (Poland)
ardiankp (Indonesia)
Two
semi-finals from the
semi-finalists of the countries of the former Soviet Union reached the final:
Andrey Stankevich aka
andrewzta
Peter Mitrichev aka
Petr
Recall that Mitrichev and Stankevich at the recently concluded
Google Code Jam took the first and third places, respectively.
Read more about TCCC 2006
Photos from onsite
Onsite blogs (in English)
in Russian
Review TCCC-2006 Semifinal Room 1
Review TCCC-2006 Semifinal Room 2
Review TCCC-2006 Semifinal Room 3
A lot of facts and statistics
here .