Hello everyone!↵
↵
Codeforces Round #315 will take place [soon](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+%23315&iso=20150810T1930&p1=166&ah=2). The authors of this round are students of Ural FU [user:Umqra,2015-08-09] and [user:Um_nik,2015-08-09]. This is our second round. First one was in the black days of Codeforces and we hope that this will not happen again after our round :)↵
↵
We want to thank Codeforces team for great Codeforces and Polygon platforms and [user:Zlobober,2015-08-09] for helping us prepare this round.↵
↵
Good luck!↵
↵
**UPD1:** ↵
Score distribution. ↵
div2 : 500-1000-1500-2250-2750 ↵
div1 : 500-1000-1500-2250-2500 ↵
We strongly recommend you to read **all** the problems. We try our best to prepare different problems and some problems that hard for us can be easy for you.↵
↵
**UPD2:**↵
[Editorial](http://mirror.codeforces.com/blog/entry/19705)
↵
Codeforces Round #315 will take place [soon](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+%23315&iso=20150810T1930&p1=166&ah=2). The authors of this round are students of Ural FU [user:Umqra,2015-08-09] and [user:Um_nik,2015-08-09]. This is our second round. First one was in the black days of Codeforces and we hope that this will not happen again after our round :)↵
↵
We want to thank Codeforces team for great Codeforces and Polygon platforms and [user:Zlobober,2015-08-09] for helping us prepare this round.↵
↵
Good luck!↵
↵
**UPD1:** ↵
Score distribution. ↵
div2 : 500-1000-1500-2250-2750 ↵
div1 : 500-1000-1500-2250-2500 ↵
We strongly recommend you to read **all** the problems. We try our best to prepare different problems and some problems that hard for us can be easy for you.↵
↵
**UPD2:**↵
[Editorial](http://mirror.codeforces.com/blog/entry/19705)
