Hello Codeforces!↵
↵
On [contest_time:1278] [contest:1278] 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.com/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-12-18] Glazov, Adilbek [user:adedalic,2019-12-18] Dalabaev, Vladimir [user:Vovuh,2019-12-18] Petrov, Ivan [user:BledDest,2019-12-18] Androsov, Maksim [user:Ne0n25,2019-12-18] Mescheryakov and me. Also huge thanks to Mike [user:MikeMirzayanov,2019-12-18] Mirzayanov for great systems Polygon and Codeforces.↵
↵
Good luck to all the participants!↵
↵
Our friends at Harbour.Space also have a message for you:↵
↵
<img alt="Codeforces and Harbour.Space" src="https://codeforces.com/predownloaded/89/06/89064c0c8a3f6d7579e468a260caf641d4863d7d.png" style="float:center;height: 300px; margin: 10px; max-width:50%;"/>↵
↵
_Hi Codeforces!_↵
↵
_The deadline to apply for our Master’s Scholarship in Bangkok is very soon!_ ↵
↵
_Don't miss your chance and apply for our progressive Master’s programs in **Data Science** and **Cyber Security** in just 3 steps:_↵
↵
_**1.** Submit your CV to see if you are an eligible candidate for the scholarship_ ↵
<br>↵
_**2.** If your profile matches the requirements, one of our admissions officers will get in touch with you_↵
<br>↵
_**3.** Apply for the program, pay the 125€ application fee, pass a series of interviews, and if you’re accepted, pack your bags to Bangkok!_ ↵
↵
_And if you know someone who might be interested in **Digital Marketing, High Tech Entrepreneurship, Interaction Design or FinTech**, send them our way!_↵
↵
↵
<center style="margin:2.5em;">↵
<a href="https://in.harbour.space/bangkok-scholarships/?utm_source=codeforces&utm_medium=partners" style="text-decoration:none; font-size:18px; background-color:#523996; color:white; font-weight:bold; padding:0.5em 1em;">MORE INFO→</a>↵
</center> ↵
↵
↵
_Also, don’t forget to read our newest blogs!_ ↵
↵
- [4 Types Of Data Biases (And How To Avoid Them)](https://harbour.space/fintech/data-bias?utm_source=codeforces&utm_medium=partners)↵
↵
- [Creating Your Dream Job Has Never Been Easier](https://harbour.space/high-tech-entrepreneurship/dreamjob?utm_source=codeforces&utm_medium=partners)↵
↵
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:HIR180, 2019-12-19]</td>↵
<td>6</td>↵
<td>106</td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:neal, 2019-12-19]</td>↵
<td>6</td>↵
<td>162</td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:receed, 2019-12-19]</td>↵
<td>6</td>↵
<td>172</td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:Geothermal, 2019-12-19]</td>↵
<td>6</td>↵
<td>174</td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:cerberus97, 2019-12-19]</td>↵
<td>6</td>↵
<td>179</td>↵
</tr>↵
<tr>↵
<td>6</td>↵
<td>[user:Egor, 2019-12-19]</td>↵
<td>6</td>↵
<td>187</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:Akulyat, 2019-12-19]</td>↵
<td><b><font color="green">24</font></b></td></td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:hoke_t, 2019-12-19]</td>↵
<td><b><font color="green">20</font></b></td></td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:dhxh, 2019-12-19]</td>↵
<td><b><font color="green">18</font></b><b>:<font color="red">-1</font></b></td></td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:SweetPrinces, 2019-12-19]</td>↵
<td><b><font color="green">14</font></b></td></td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:WNG, 2019-12-19]</td>↵
<td><b><font color="green">13</font></b><b>:<font color="red">-1</font></b></td></td>↵
</tr>↵
<tr>↵
<td>6</td>↵
<td>[user:sgygd2004, 2019-12-19]</td>↵
<td><b><font color="green">12</font></b></td></td>↵
</tr>↵
</tbody>↵
</table>↵
255 successful hacks and 458 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:Dalgerok, 2019-12-19]</td>↵
<td>0:01</td>↵
</tr>↵
<tr>↵
<td>B</td>↵
<td>[user:neal, 2019-12-19]</td>↵
<td>0:04</td>↵
</tr>↵
<tr>↵
<td>C</td>↵
<td>[user:HIR180, 2019-12-19]</td>↵
<td>0:08</td>↵
</tr>↵
<tr>↵
<td>D</td>↵
<td>[user:__.__, 2019-12-19]</td>↵
<td>0:17</td>↵
</tr>↵
<tr>↵
<td>E</td>↵
<td>[user:gxnncrx1993, 2019-12-19]</td>↵
<td>0:20</td>↵
</tr>↵
<tr>↵
<td>F</td>↵
<td>[user:wxhtxdy, 2019-12-19]</td>↵
<td>0:07</td>↵
</tr>↵
</tbody>↵
</table>
↵
On [contest_time:1278] [contest:1278] 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.com/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-12-18] Glazov, Adilbek [user:adedalic,2019-12-18] Dalabaev, Vladimir [user:Vovuh,2019-12-18] Petrov, Ivan [user:BledDest,2019-12-18] Androsov, Maksim [user:Ne0n25,2019-12-18] Mescheryakov and me. Also huge thanks to Mike [user:MikeMirzayanov,2019-12-18] Mirzayanov for great systems Polygon and Codeforces.↵
↵
Good luck to all the participants!↵
↵
Our friends at Harbour.Space also have a message for you:↵
↵
<img alt="Codeforces and Harbour.Space" src="https://codeforces.com/predownloaded/89/06/89064c0c8a3f6d7579e468a260caf641d4863d7d.png" style="float:center;height: 300px; margin: 10px; max-width:50%;"/>↵
↵
_Hi Codeforces!_↵
↵
_The deadline to apply for our Master’s Scholarship in Bangkok is very soon!_ ↵
↵
_Don't miss your chance and apply for our progressive Master’s programs in **Data Science** and **Cyber Security** in just 3 steps:_↵
↵
_**1.** Submit your CV to see if you are an eligible candidate for the scholarship_ ↵
<br>↵
_**2.** If your profile matches the requirements, one of our admissions officers will get in touch with you_↵
<br>↵
_**3.** Apply for the program, pay the 125€ application fee, pass a series of interviews, and if you’re accepted, pack your bags to Bangkok!_ ↵
↵
_And if you know someone who might be interested in **Digital Marketing, High Tech Entrepreneurship, Interaction Design or FinTech**, send them our way!_↵
↵
↵
<center style="margin:2.5em;">↵
<a href="https://in.harbour.space/bangkok-scholarships/?utm_source=codeforces&utm_medium=partners" style="text-decoration:none; font-size:18px; background-color:#523996; color:white; font-weight:bold; padding:0.5em 1em;">MORE INFO→</a>↵
</center> ↵
↵
↵
_Also, don’t forget to read our newest blogs!_ ↵
↵
- [4 Types Of Data Biases (And How To Avoid Them)](https://harbour.space/fintech/data-bias?utm_source=codeforces&utm_medium=partners)↵
↵
- [Creating Your Dream Job Has Never Been Easier](https://harbour.space/high-tech-entrepreneurship/dreamjob?utm_source=codeforces&utm_medium=partners)↵
↵
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:HIR180, 2019-12-19]</td>↵
<td>6</td>↵
<td>106</td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:neal, 2019-12-19]</td>↵
<td>6</td>↵
<td>162</td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:receed, 2019-12-19]</td>↵
<td>6</td>↵
<td>172</td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:Geothermal, 2019-12-19]</td>↵
<td>6</td>↵
<td>174</td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:cerberus97, 2019-12-19]</td>↵
<td>6</td>↵
<td>179</td>↵
</tr>↵
<tr>↵
<td>6</td>↵
<td>[user:Egor, 2019-12-19]</td>↵
<td>6</td>↵
<td>187</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:Akulyat, 2019-12-19]</td>↵
<td><b><font color="green">24</font></b></td></td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:hoke_t, 2019-12-19]</td>↵
<td><b><font color="green">20</font></b></td></td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:dhxh, 2019-12-19]</td>↵
<td><b><font color="green">18</font></b><b>:<font color="red">-1</font></b></td></td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:SweetPrinces, 2019-12-19]</td>↵
<td><b><font color="green">14</font></b></td></td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:WNG, 2019-12-19]</td>↵
<td><b><font color="green">13</font></b><b>:<font color="red">-1</font></b></td></td>↵
</tr>↵
<tr>↵
<td>6</td>↵
<td>[user:sgygd2004, 2019-12-19]</td>↵
<td><b><font color="green">12</font></b></td></td>↵
</tr>↵
</tbody>↵
</table>↵
255 successful hacks and 458 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:Dalgerok, 2019-12-19]</td>↵
<td>0:01</td>↵
</tr>↵
<tr>↵
<td>B</td>↵
<td>[user:neal, 2019-12-19]</td>↵
<td>0:04</td>↵
</tr>↵
<tr>↵
<td>C</td>↵
<td>[user:HIR180, 2019-12-19]</td>↵
<td>0:08</td>↵
</tr>↵
<tr>↵
<td>D</td>↵
<td>[user:__.__, 2019-12-19]</td>↵
<td>0:17</td>↵
</tr>↵
<tr>↵
<td>E</td>↵
<td>[user:gxnncrx1993, 2019-12-19]</td>↵
<td>0:20</td>↵
</tr>↵
<tr>↵
<td>F</td>↵
<td>[user:wxhtxdy, 2019-12-19]</td>↵
<td>0:07</td>↵
</tr>↵
</tbody>↵
</table>
