Hello Codeforces!↵
↵
On [December 28, 17:05 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?day=28&month=12&year=2017&hour=17&min=5&sec=0&p1=166) Educational Codeforces Round 35 will start.↵
↵
Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the [blog post](http://codeforces.net/blog/entry/51208).↵
↵
This round will be **rated for Div. 2**. It will be held on extented ACM ICPC rules. After the end of the contest you will have one day to hack any solution you want. You will have access to copy any solution and test it locally.↵
↵
You will be given **7 problems** and **2 hours** to solve them.↵
↵
The problems were prepared by Ivan [user:BledDest,2017-12-27] Androsov, Vladimir [user:0n25,2017-12-27] Petrov, Alexey [user:Perforator,2017-12-27] Ripinen and me.↵
↵
Thanks Mike [user:MikeMirzayanov,2017-12-27] Mirzayanov for great system Polygon!↵
↵
Good luck to all participants!↵
↵
We also have a message from our partners, [Harbour.Space University](https://harbour.space/):↵
↵
Hello everyone!↵
↵
Registration is open for our upcoming [**1st Hello India x Russia Programming Bootcamp**](http://in.harbour.space/icpc/acm-icpc-hello-india-bootcamp-spring-2018/?utm_source=Codeforces), with 20 teams signed up and counting, and we are looking forward to seeing you and your teammates in India this March!↵
↵
[More information](http://codeforces.net/blog/entry/56324)↵
↵
[Register here](https://goo.gl/hurQMr)↵
↵
**UPD: There will be 7 problems!**↵
↵
↵
Congratulations to the winners:↵
<table class="bordertable">↵
<tbody>↵
<tr>↵
<th>Rank</th>↵
<th>Competitor</th>↵
<th>Problems Solved</th>↵
<th>Penalty</th>↵
</tr>↵
<tr>↵
<td>1</td>↵
<td>[user:bmerry, 2017-12-29]</td>↵
<td>7</td>↵
<td>212</td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:uwi, 2017-12-29]</td>↵
<td>7</td>↵
<td>216</td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:halyavin, 2017-12-29]</td>↵
<td>7</td>↵
<td>287</td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:HS432, 2017-12-29]</td>↵
<td>7</td>↵
<td>314</td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:voidmax, 2017-12-29]</td>↵
<td>7</td>↵
<td>337</td>↵
</tr>↵
</tbody>↵
</table>↵
↵
Congratulations to the best hackers:↵
<table class="bordertable">↵
<tbody>↵
<tr>↵
<th>Rank</th>↵
<th>Competitor</th>↵
<th>Hack Count</th>↵
</tr>↵
<tr>↵
<td>1</td>↵
<td>[user:halyavin, 2017-12-29]</td>↵
<td><b><font color="green">328</font></b><b>:<font color="red">-26</font></b></td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:Mohammad_kilani, 2017-12-29]</td>↵
<td><b><font color="green">107</font></b><b>:<font color="red">-6</font></b></td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:Aemon, 2017-12-29]</td>↵
<td><b><font color="green">91</font></b><b>:<font color="red">-33</font></b></td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:algmyr, 2017-12-29]</td>↵
<td><b><font color="green">57</font></b><b>:<font color="red">-4</font></b></td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:Yazdan_ra, 2017-12-29]</td>↵
<td><b><font color="green">29</font></b><b>:<font color="red">-9</font></b></td>↵
</tr>↵
</tbody>↵
</table>↵
↵
1761 successful hacks and 1237 unsuccessful hacks were made in total!↵
↵
And finally people who were the first to solve each problem:↵
<table class="bordertable">↵
<tbody>↵
<tr>↵
<th>Problem</th>↵
<th>Competitor</th>↵
<th>Penalty</th>↵
</tr>↵
<tr>↵
<td>A</td>↵
<td>[user:Delsin, 2017-12-29]</td>↵
<td>0:01</td>↵
</tr>↵
<tr>↵
<td>B</td>↵
<td>[user:Benq, 2017-12-29]</td>↵
<td>0:03</td>↵
</tr>↵
<tr>↵
<td>C</td>↵
<td>[user:DTSBT, 2017-12-29]</td>↵
<td>0:06</td>↵
</tr>↵
<tr>↵
<td>D</td>↵
<td>[user:PrashantM, 2017-12-29]</td>↵
<td>0:08</td>↵
</tr>↵
<tr>↵
<td>E</td>↵
<td>[user:perchema, 2017-12-29]</td>↵
<td>0:15</td>↵
</tr>↵
<tr>↵
<td>F</td>↵
<td>[user:pekempey, 2017-12-29]</td>↵
<td>0:38</td>↵
</tr>↵
<tr>↵
<td>G</td>↵
<td>[user:chemthan, 2017-12-29]</td>↵
<td>0:21</td>↵
</tr>↵
</tbody>↵
</table>↵
↵
On [December 28, 17:05 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?day=28&month=12&year=2017&hour=17&min=5&sec=0&p1=166) Educational Codeforces Round 35 will start.↵
↵
Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the [blog post](http://codeforces.net/blog/entry/51208).↵
↵
This round will be **rated for Div. 2**. It will be held on extented ACM ICPC rules. After the end of the contest you will have one day to hack any solution you want. You will have access to copy any solution and test it locally.↵
↵
You will be given **7 problems** and **2 hours** to solve them.↵
↵
The problems were prepared by Ivan [user:BledDest,2017-12-27] Androsov, Vladimir [user:0n25,2017-12-27] Petrov, Alexey [user:Perforator,2017-12-27] Ripinen and me.↵
↵
Thanks Mike [user:MikeMirzayanov,2017-12-27] Mirzayanov for great system Polygon!↵
↵
Good luck to all participants!↵
↵
We also have a message from our partners, [Harbour.Space University](https://harbour.space/):↵
↵
Hello everyone!↵
↵
Registration is open for our upcoming [**1st Hello India x Russia Programming Bootcamp**](http://in.harbour.space/icpc/acm-icpc-hello-india-bootcamp-spring-2018/?utm_source=Codeforces), with 20 teams signed up and counting, and we are looking forward to seeing you and your teammates in India this March!↵
↵
[More information](http://codeforces.net/blog/entry/56324)↵
↵
[Register here](https://goo.gl/hurQMr)↵
↵
**UPD: There will be 7 problems!**↵
↵
↵
Congratulations to the winners:↵
<table class="bordertable">↵
<tbody>↵
<tr>↵
<th>Rank</th>↵
<th>Competitor</th>↵
<th>Problems Solved</th>↵
<th>Penalty</th>↵
</tr>↵
<tr>↵
<td>1</td>↵
<td>[user:bmerry, 2017-12-29]</td>↵
<td>7</td>↵
<td>212</td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:uwi, 2017-12-29]</td>↵
<td>7</td>↵
<td>216</td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:halyavin, 2017-12-29]</td>↵
<td>7</td>↵
<td>287</td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:HS432, 2017-12-29]</td>↵
<td>7</td>↵
<td>314</td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:voidmax, 2017-12-29]</td>↵
<td>7</td>↵
<td>337</td>↵
</tr>↵
</tbody>↵
</table>↵
↵
Congratulations to the best hackers:↵
<table class="bordertable">↵
<tbody>↵
<tr>↵
<th>Rank</th>↵
<th>Competitor</th>↵
<th>Hack Count</th>↵
</tr>↵
<tr>↵
<td>1</td>↵
<td>[user:halyavin, 2017-12-29]</td>↵
<td><b><font color="green">328</font></b><b>:<font color="red">-26</font></b></td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:Mohammad_kilani, 2017-12-29]</td>↵
<td><b><font color="green">107</font></b><b>:<font color="red">-6</font></b></td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:Aemon, 2017-12-29]</td>↵
<td><b><font color="green">91</font></b><b>:<font color="red">-33</font></b></td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:algmyr, 2017-12-29]</td>↵
<td><b><font color="green">57</font></b><b>:<font color="red">-4</font></b></td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:Yazdan_ra, 2017-12-29]</td>↵
<td><b><font color="green">29</font></b><b>:<font color="red">-9</font></b></td>↵
</tr>↵
</tbody>↵
</table>↵
↵
1761 successful hacks and 1237 unsuccessful hacks were made in total!↵
↵
And finally people who were the first to solve each problem:↵
<table class="bordertable">↵
<tbody>↵
<tr>↵
<th>Problem</th>↵
<th>Competitor</th>↵
<th>Penalty</th>↵
</tr>↵
<tr>↵
<td>A</td>↵
<td>[user:Delsin, 2017-12-29]</td>↵
<td>0:01</td>↵
</tr>↵
<tr>↵
<td>B</td>↵
<td>[user:Benq, 2017-12-29]</td>↵
<td>0:03</td>↵
</tr>↵
<tr>↵
<td>C</td>↵
<td>[user:DTSBT, 2017-12-29]</td>↵
<td>0:06</td>↵
</tr>↵
<tr>↵
<td>D</td>↵
<td>[user:PrashantM, 2017-12-29]</td>↵
<td>0:08</td>↵
</tr>↵
<tr>↵
<td>E</td>↵
<td>[user:perchema, 2017-12-29]</td>↵
<td>0:15</td>↵
</tr>↵
<tr>↵
<td>F</td>↵
<td>[user:pekempey, 2017-12-29]</td>↵
<td>0:38</td>↵
</tr>↵
<tr>↵
<td>G</td>↵
<td>[user:chemthan, 2017-12-29]</td>↵
<td>0:21</td>↵
</tr>↵
</tbody>↵
</table>↵
