Hi, Codeforces!↵
↵
I'm quite excited to invite you to Codeforces Round #439 (Div. 2) which takes place at [16:35 MSK on 6 October](https://www.timeanddate.com/worldclock/fixedtime.html?day=06&month=10&year=2017&hour=16&min=35&sec=0&p1=166) and lasts for two hours.↵
↵
One of the five problems is created by [user:quailty,2017-10-05], and the others are created by me. This is our first round here. ↵
↵
The round couldn't have been realized without efforts of [user:KAN,2017-10-05] and [user:gritukan,2017-10-05]. Besides, I also want to say thanks to our testers: [user:cyand1317,2017-10-05], [user:visitWorld,2017-10-05], [user:Nisiyama_Suzune,2017-10-05], [user:cdkrot,2017-10-05] and [user:gainullin.ildar,2017-10-05]. Thanks for your help to the contest. Also, thanks to [user:MikeMirzayanov,2017-10-05] with the fantastic Codeforces and Polygon platforms.↵
↵
The contest will consist of five problems and it is **rated** for Div. 2 contestants. The same as before, Div. 1 contestants can take part out of competition.↵
↵
The problems will feature... _Well, let's wait and see_ for another time ;) As per Codeforces tradition, moderate length text and no spoilers about the actual plot.↵
↵
I hope you can have fun during the contest. Good luck and have fun, wish you high rating!↵
↵
The scoring distribution will be announced later.↵
↵
See you tomorrow!↵
↵
**UPD1** : The scoring distribution is 500-1000-1500-2250-2500.↵
↵
**UPD2** : The contest is over. The [editorial](http://codeforces.net/blog/entry/55009) is available. (detailed tutorials for most of them)↵
↵
**UPD3** : Congratulations to top five coders!↵
↵
### Division 2 :↵
1. [user:1heart2plans,2017-10-05] (solved all problems!)↵
2. [user:fatice,2017-10-05]↵
3. [user:LuckyPants,2017-10-05]↵
4. [user:xza,2017-10-05]↵
5. [user:T404,2017-10-05]↵
↵
### Division 1 + Division 2 :↵
1. [user:1heart2plans,2017-10-05] (solved all problems!)↵
2. [user:unused,2017-10-05]↵
3. [user:fatice,2017-10-05]↵
4. [user:nuip,2017-10-05]↵
5. [user:chemthan,2017-10-05]↵
↵
Have fun! See you next time! (Let's wait and see...)↵
↵
↵
I'm quite excited to invite you to Codeforces Round #439 (Div. 2) which takes place at [16:35 MSK on 6 October](https://www.timeanddate.com/worldclock/fixedtime.html?day=06&month=10&year=2017&hour=16&min=35&sec=0&p1=166) and lasts for two hours.↵
↵
One of the five problems is created by [user:quailty,2017-10-05], and the others are created by me. This is our first round here. ↵
↵
The round couldn't have been realized without efforts of [user:KAN,2017-10-05] and [user:gritukan,2017-10-05]. Besides, I also want to say thanks to our testers: [user:cyand1317,2017-10-05], [user:visitWorld,2017-10-05], [user:Nisiyama_Suzune,2017-10-05], [user:cdkrot,2017-10-05] and [user:gainullin.ildar,2017-10-05]. Thanks for your help to the contest. Also, thanks to [user:MikeMirzayanov,2017-10-05] with the fantastic Codeforces and Polygon platforms.↵
↵
The contest will consist of five problems and it is **rated** for Div. 2 contestants. The same as before, Div. 1 contestants can take part out of competition.↵
↵
The problems will feature... _Well, let's wait and see_ for another time ;) As per Codeforces tradition, moderate length text and no spoilers about the actual plot.↵
↵
I hope you can have fun during the contest. Good luck and have fun, wish you high rating!↵
↵
The scoring distribution will be announced later.↵
↵
See you tomorrow!↵
↵
**UPD1** : The scoring distribution is 500-1000-1500-2250-2500.↵
↵
**UPD2** : The contest is over. The [editorial](http://codeforces.net/blog/entry/55009) is available.
↵
**UPD3** : Congratulations to top five coders!↵
↵
### Division 2 :↵
1. [user:1heart2plans,2017-10-05] (solved all problems!)↵
2. [user:fatice,2017-10-05]↵
3. [user:LuckyPants,2017-10-05]↵
4. [user:xza,2017-10-05]↵
5. [user:T404,2017-10-05]↵
↵
### Division 1 + Division 2 :↵
1. [user:1heart2plans,2017-10-05] (solved all problems!)↵
2. [user:unused,2017-10-05]↵
3. [user:fatice,2017-10-05]↵
4. [user:nuip,2017-10-05]↵
5. [user:chemthan,2017-10-05]↵
↵
Have fun! See you next time! (Let's wait and see...)↵
↵