Hello, Codeforces!
On March, 2nd at 10:00 MSK Codeforces Round #295 will be held in both divisions.
The round will be held at the same time with Winter Computer Camp olympiad, the problemsets will be highly similar. The problems are by me (Endagorion) and Evgeny Savinov (savinov). The problems are prepared by members of the Winter Computer Camp technical committee: Georgy Chebanov (gchebanov), Filipp Rukhovich (DPR-pavlin), Alexander Mashrabov (map), Sergey Kiyan (sokian), Konstantin Semenov (zemen), Kinan Alsarmini (Sarkin).
Big thanks to Max Akhmedov (Zlobober) for his help with preparing the problems, Maria Belova (Delinur) for translating the statements in English, and Mike Mirzayanov (MikeMirzayanov) for creating Codeforces and Polygon systems.
The scoring is standard for both divisions: 500-1000-1500-2000-2500.
Please note that the Winter Computing Camp olympiad is scheduled to finish later than the Codeforces round. Thus, we ask you not to discuss the problems and solutions in the comments until 14:10 MSK. Also, viewing of other participants' solutions will be closed until that time. The editorial will also be published later.
UPD: you are free to discuss the problems now.
UPD2: the editorial is finally up! Sorry for the delay.
Also, grats to our Div.1 winners:
Special respect goes to Petr and rng_58 for solving the hardest problem E!