Hello Codeforces!↵
↵
On [contest_time:1155] [contest:1155] 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 <a href="http://codeforces.net/blog/entry/51208">blog post</a>.↵
↵
This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours 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 invented and prepared by Roman [user:Roms,2019-04-21] Glazov, Adilbek [user:adedalic,2019-04-21] Dalabaev, Vladimir [user:Vovuh,2019-04-21] Petrov, Ivan [user:BledDest,2019-04-21] Androsov, Maksim [user:Ne0n25,2019-04-21] Mescheryakov and me. Also huge thanks to Mike [user:MikeMirzayanov,2019-04-21] Mirzayanov for great systems Polygon and Codeforces.↵
↵
Good luck to all participants!↵
↵
Our friends at Harbour.Space also have a message for you:↵
↵
↵
↵
Hi Codeforces!↵
↵
This summer, we want to invite you to Tech Scouts, the two-week summer camp we run from the 8<sup>th</sup>-19<sup>th</sup> of July in one of Barcelona's leading international schools, St.Paul’s.↵
↵
This camp, divided into Creative and Technical tracks, is designed to lay out the foundation of knowledge for high-school students in the fields of technology, mathematics, business and design. Both tracks are taught in English.↵
↵
We would love to see you guys at our camp this year — if you’re interested in joining, or if you just want to know more, just head over to the [Tech Scouts website](https://techscouts.harbour.space/). ↵
↵
This camp is for anyone passionate about tech or design, so if you know someone who might be interested, be sure to let them know too!↵
↵
Ps. Don’t wait too long — you still have an early bird discount, but only until May 20<sup>th</sup>↵
↵
**UPD:** The round will contain 6 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:Um_nik, 2019-04-22]</td>↵
<td>6</td>↵
<td>111</td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:Cinro_9baka, 2019-04-22]</td>↵
<td>6</td>↵
<td>207</td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:Ilovebxy, 2019-04-22]</td>↵
<td>6</td>↵
<td>247</td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:ivan100sic, 2019-04-22]</td>↵
<td>6</td>↵
<td>249</td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:ainta, 2019-04-22]</td>↵
<td>6</td>↵
<td>411</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, 2019-04-22]</td>↵
<td><b><font color="green">292</font></b><b>:<font color="red">-18</font></b></td></td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:Haunted_Cpp, 2019-04-22]</td>↵
<td><b><font color="green">31</font></b></td></td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:WileE.Coyote, 2019-04-22]</td>↵
<td><b><font color="green">30</font></b><b>:<font color="red">-4</font></b></td></td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:Disappointment, 2019-04-22]</td>↵
<td><b><font color="green">27</font></b><b>:<font color="red">-1</font></b></td></td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:czasem_tak_trzeba, 2019-04-22]</td>↵
<td><b><font color="green">23</font></b></td></td>↵
</tr>↵
</tbody>↵
</table>↵
790 successful hacks and 697 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:iaeyoayao, 2019-04-22]</td>↵
<td>0:01</td>↵
</tr>↵
<tr>↵
<td>B</td>↵
<td>[user:MesyuraTheOldDumbGoblin, 2019-04-22]</td>↵
<td>0:03</td>↵
</tr>↵
<tr>↵
<td>C</td>↵
<td>[user:NeKrasnyj, 2019-04-22]</td>↵
<td>0:07</td>↵
</tr>↵
<tr>↵
<td>D</td>↵
<td>[user:FlyToTheSky, 2019-04-22]</td>↵
<td>0:07</td>↵
</tr>↵
<tr>↵
<td>E</td>↵
<td>[user:Rezwan.Arefin01, 2019-04-22]</td>↵
<td>0:17</td>↵
</tr>↵
<tr>↵
<td>F</td>↵
<td>[user:Um_nik, 2019-04-22]</td>↵
<td>0:59</td>↵
</tr>↵
</tbody>↵
</table>
↵
On [contest_time:1155] [contest:1155] 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 <a href="http://codeforces.net/blog/entry/51208">blog post</a>.↵
↵
This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours 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 invented and prepared by Roman [user:Roms,2019-04-21] Glazov, Adilbek [user:adedalic,2019-04-21] Dalabaev, Vladimir [user:Vovuh,2019-04-21] Petrov, Ivan [user:BledDest,2019-04-21] Androsov, Maksim [user:Ne0n25,2019-04-21] Mescheryakov and me. Also huge thanks to Mike [user:MikeMirzayanov,2019-04-21] Mirzayanov for great systems Polygon and Codeforces.↵
↵
Good luck to all participants!↵
↵
Our friends at Harbour.Space also have a message for you:↵
↵
↵
↵
Hi Codeforces!↵
↵
This summer, we want to invite you to Tech Scouts, the two-week summer camp we run from the 8<sup>th</sup>-19<sup>th</sup> of July in one of Barcelona's leading international schools, St.Paul’s.↵
↵
This camp, divided into Creative and Technical tracks, is designed to lay out the foundation of knowledge for high-school students in the fields of technology, mathematics, business and design. Both tracks are taught in English.↵
↵
We would love to see you guys at our camp this year — if you’re interested in joining, or if you just want to know more, just head over to the [Tech Scouts website](https://techscouts.harbour.space/). ↵
↵
This camp is for anyone passionate about tech or design, so if you know someone who might be interested, be sure to let them know too!↵
↵
Ps. Don’t wait too long — you still have an early bird discount, but only until May 20<sup>th</sup>↵
↵
**UPD:** The round will contain 6 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:Um_nik, 2019-04-22]</td>↵
<td>6</td>↵
<td>111</td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:Cinro_9baka, 2019-04-22]</td>↵
<td>6</td>↵
<td>207</td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:Ilovebxy, 2019-04-22]</td>↵
<td>6</td>↵
<td>247</td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:ivan100sic, 2019-04-22]</td>↵
<td>6</td>↵
<td>249</td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:ainta, 2019-04-22]</td>↵
<td>6</td>↵
<td>411</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, 2019-04-22]</td>↵
<td><b><font color="green">292</font></b><b>:<font color="red">-18</font></b></td></td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:Haunted_Cpp, 2019-04-22]</td>↵
<td><b><font color="green">31</font></b></td></td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:WileE.Coyote, 2019-04-22]</td>↵
<td><b><font color="green">30</font></b><b>:<font color="red">-4</font></b></td></td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:Disappointment, 2019-04-22]</td>↵
<td><b><font color="green">27</font></b><b>:<font color="red">-1</font></b></td></td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:czasem_tak_trzeba, 2019-04-22]</td>↵
<td><b><font color="green">23</font></b></td></td>↵
</tr>↵
</tbody>↵
</table>↵
790 successful hacks and 697 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:iaeyoayao, 2019-04-22]</td>↵
<td>0:01</td>↵
</tr>↵
<tr>↵
<td>B</td>↵
<td>[user:MesyuraTheOldDumbGoblin, 2019-04-22]</td>↵
<td>0:03</td>↵
</tr>↵
<tr>↵
<td>C</td>↵
<td>[user:NeKrasnyj, 2019-04-22]</td>↵
<td>0:07</td>↵
</tr>↵
<tr>↵
<td>D</td>↵
<td>[user:FlyToTheSky, 2019-04-22]</td>↵
<td>0:07</td>↵
</tr>↵
<tr>↵
<td>E</td>↵
<td>[user:Rezwan.Arefin01, 2019-04-22]</td>↵
<td>0:17</td>↵
</tr>↵
<tr>↵
<td>F</td>↵
<td>[user:Um_nik, 2019-04-22]</td>↵
<td>0:59</td>↵
</tr>↵
</tbody>↵
</table>
