Hello Codeforces!↵
↵
On [October 12, 17:05 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?day=12&month=10&year=2017&hour=17&min=5&sec=0&p1=166) Educational Codeforces Round 30 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.com/blog/entry/51208).↵
↵
The round will be **unrated** for all users and 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 **6 problems** and **2 hours** to solve them.↵
↵
The problems were prepared by Ivan [user:BledDest,2017-10-11] Androsov, Vladimir [user:0n25,2017-10-11] Petrov, Mike [user:MikeMirzayanov,2017-10-11] Mirzayanov and me.↵
↵
Good luck to all participants!↵
↵
↵
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:irkstepanov, 2017-10-13]</td>↵
<td>6</td>↵
<td>141</td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:SPFA_THE_BEST_ALGORITHM, 2017-10-13]</td>↵
<td>6</td>↵
<td>169</td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:KrK, 2017-10-13]</td>↵
<td>6</td>↵
<td>199</td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:chemthan, 2017-10-13]</td>↵
<td>6</td>↵
<td>200</td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:Shik, 2017-10-13]</td>↵
<td>6</td>↵
<td>214</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:jhonber, 2017-10-13]</td>↵
<td><b><font color="green">75</font></b><b>:<font color="red">-6</font></b></td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:halyavin, 2017-10-13]</td>↵
<td><b><font color="green">31</font></b><b>:<font color="red">-8</font></b></td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:Zaher, 2017-10-13]</td>↵
<td><b><font color="green">6</font></b><b>:<font color="red">-2</font></b></td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:Khaled_Mohamed, 2017-10-13]</td>↵
<td><b><font color="green">4</font></b><b>:<font color="red">-1</font></b></td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:silicon_lover, 2017-10-13]</td>↵
<td><b><font color="green">2</font></b></td>↵
</tr>↵
</tbody>↵
</table>↵
↵
123 successful hacks and 96 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:I_love_Maria_Ivanova, 2017-10-13]</td>↵
<td>0:01</td>↵
</tr>↵
<tr>↵
<td>B</td>↵
<td>[user:gritukan, 2017-10-13]</td>↵
<td>0:04</td>↵
</tr>↵
<tr>↵
<td>C</td>↵
<td>[user:eddy1021, 2017-10-13]</td>↵
<td>0:08</td>↵
</tr>↵
<tr>↵
<td>D</td>↵
<td>[user:unused, 2017-10-13]</td>↵
<td>0:14</td>↵
</tr>↵
<tr>↵
<td>E</td>↵
<td>[user:irkstepanov, 2017-10-13]</td>↵
<td>0:44</td>↵
</tr>↵
<tr>↵
<td>F</td>↵
<td>[user:xjlinyueru, 2017-10-13]</td>↵
<td>0:23</td>↵
</tr>↵
</tbody>↵
</table>↵
↵
UPD: Editorial is [published](http://codeforces.com/blog/entry/55171)
↵
On [October 12, 17:05 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?day=12&month=10&year=2017&hour=17&min=5&sec=0&p1=166) Educational Codeforces Round 30 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.com/blog/entry/51208).↵
↵
The round will be **unrated** for all users and 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 **6 problems** and **2 hours** to solve them.↵
↵
The problems were prepared by Ivan [user:BledDest,2017-10-11] Androsov, Vladimir [user:0n25,2017-10-11] Petrov, Mike [user:MikeMirzayanov,2017-10-11] Mirzayanov and me.↵
↵
Good luck to all participants!↵
↵
↵
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:irkstepanov, 2017-10-13]</td>↵
<td>6</td>↵
<td>141</td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:SPFA_THE_BEST_ALGORITHM, 2017-10-13]</td>↵
<td>6</td>↵
<td>169</td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:KrK, 2017-10-13]</td>↵
<td>6</td>↵
<td>199</td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:chemthan, 2017-10-13]</td>↵
<td>6</td>↵
<td>200</td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:Shik, 2017-10-13]</td>↵
<td>6</td>↵
<td>214</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:jhonber, 2017-10-13]</td>↵
<td><b><font color="green">75</font></b><b>:<font color="red">-6</font></b></td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:halyavin, 2017-10-13]</td>↵
<td><b><font color="green">31</font></b><b>:<font color="red">-8</font></b></td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:Zaher, 2017-10-13]</td>↵
<td><b><font color="green">6</font></b><b>:<font color="red">-2</font></b></td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:Khaled_Mohamed, 2017-10-13]</td>↵
<td><b><font color="green">4</font></b><b>:<font color="red">-1</font></b></td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:silicon_lover, 2017-10-13]</td>↵
<td><b><font color="green">2</font></b></td>↵
</tr>↵
</tbody>↵
</table>↵
↵
123 successful hacks and 96 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:I_love_Maria_Ivanova, 2017-10-13]</td>↵
<td>0:01</td>↵
</tr>↵
<tr>↵
<td>B</td>↵
<td>[user:gritukan, 2017-10-13]</td>↵
<td>0:04</td>↵
</tr>↵
<tr>↵
<td>C</td>↵
<td>[user:eddy1021, 2017-10-13]</td>↵
<td>0:08</td>↵
</tr>↵
<tr>↵
<td>D</td>↵
<td>[user:unused, 2017-10-13]</td>↵
<td>0:14</td>↵
</tr>↵
<tr>↵
<td>E</td>↵
<td>[user:irkstepanov, 2017-10-13]</td>↵
<td>0:44</td>↵
</tr>↵
<tr>↵
<td>F</td>↵
<td>[user:xjlinyueru, 2017-10-13]</td>↵
<td>0:23</td>↵
</tr>↵
</tbody>↵
</table>↵
↵
UPD: Editorial is [published](http://codeforces.com/blog/entry/55171)
