![ ](https://i.imgur.com/I61q7FQ.png)↵
↵
Hello Codeforces!↵
↵
On [contest_time:1132] [contest:1132] will start.↵
↵
This round is organised in collaboration with Hello Muscat Programming Bootcamp and supported by Sberbank, General Partner of the boot camp and one of the largest banking leaders of Eastern Europe, providing thousands of jobs and innovation in the financial industry.↵
↵
As the Hello Muscat Programming Bootcamp’s General Partner, Sberbank made it possible for students from some of the world’s top universities to attend the bootcamp, by sponsoring their participation. This includes students from Saint-Petersburg State University, Moscow Institute of Physics and Technology (MIPT), Penza State University, National Research Mordovia State University; MRSU, ITMO, Higher School of Economics / Moscow, Volgograd State Technical University, Lobachevsky State University of Nizhni Novgorod, Moscow Aviation Institute, Tyumen industrial University, University of Haifa, Northern (Arctic) Federal University, Saratov State University, Ural Federal University.↵
↵
Hello Muscat Bootcamp will take place from 9th to 15th of March, and 120 students from 24 universities, including MIPT, Saint Petersburg State University and University of Tokyo will compete and practice side-by-side, smoothing the road towards the April World Finals in Porto.↵
↵
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 **7 problems** and **2 hours** to solve them.↵
↵
The problems were invented and prepared by Roman [user:Roms,2019-03-04] Glazov, Adilbek [user:adedalic,2019-03-04] Dalabaev, Vladimir [user:Vovuh,2019-03-04] Petrov, Ivan [user:BledDest,2019-03-04] Androsov, Maksim [user:Ne0n25,2019-03-04] Mescheryakov and me. Also huge thanks to Mike [user:MikeMirzayanov,2019-03-04] Mirzayanov for great systems Polygon and Codeforces.↵
↵
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:V--gLaSsH0ldEr593--V, 2019-03-05]</td>↵
<td>7</td>↵
<td>321</td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:kmjp, 2019-03-05]</td>↵
<td>7</td>↵
<td>380</td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:Kilani, 2019-03-05]</td>↵
<td>7</td>↵
<td>452</td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:neal, 2019-03-05]</td>↵
<td>7</td>↵
<td>721</td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:I_love_Tanya_Romanova, 2019-03-05]</td>↵
<td>6</td>↵
<td>204</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:algmyr, 2019-03-05]</td>↵
<td><b><font color="green">121</font></b></td></td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:MarcosK, 2019-03-05]</td>↵
<td><b><font color="green">119</font></b><b>:<font color="red">-6</font></b></td></td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:mohammad.h915, 2019-03-05]</td>↵
<td><b><font color="green">60</font></b><b>:<font color="red">-1</font></b></td></td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:MohamedAhmed04, 2019-03-05]</td>↵
<td><b><font color="green">50</font></b></td></td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:AhmedMaherAli, 2019-03-05]</td>↵
<td><b><font color="green">45</font></b><b>:<font color="red">-1</font></b></td></td>↵
</tr>↵
</tbody>↵
</table>↵
1837 successful hacks and 1117 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:V--gLaSsH0ldEr593--V, 2019-03-05]</td>↵
<td>0:01</td>↵
</tr>↵
<tr>↵
<td>B</td>↵
<td>[user:1021869, 2019-03-05]</td>↵
<td>0:03</td>↵
</tr>↵
<tr>↵
<td>C</td>↵
<td>[user:V--gLaSsH0ldEr593--V, 2019-03-05]</td>↵
<td>0:08</td>↵
</tr>↵
<tr>↵
<td>D</td>↵
<td>[user:V--gLaSsH0ldEr593--V, 2019-03-05]</td>↵
<td>0:24</td>↵
</tr>↵
<tr>↵
<td>E</td>↵
<td>[user:TripleM5da, 2019-03-05]</td>↵
<td>0:20</td>↵
</tr>↵
<tr>↵
<td>F</td>↵
<td>[user:_Ash__, 2019-03-05]</td>↵
<td>0:06</td>↵
</tr>↵
<tr>↵
<td>G</td>↵
<td>[user:road_to_9k_mmr, 2019-03-05]</td>↵
<td>0:25</td>↵
</tr>↵
</tbody>↵
</table>
↵
Hello Codeforces!↵
↵
On [contest_time:1132] [contest:1132] will start.↵
↵
This round is organised in collaboration with Hello Muscat Programming Bootcamp and supported by Sberbank, General Partner of the boot camp and one of the largest banking leaders of Eastern Europe, providing thousands of jobs and innovation in the financial industry.↵
↵
As the Hello Muscat Programming Bootcamp’s General Partner, Sberbank made it possible for students from some of the world’s top universities to attend the bootcamp, by sponsoring their participation. This includes students from Saint-Petersburg State University, Moscow Institute of Physics and Technology (MIPT), Penza State University, National Research Mordovia State University; MRSU, ITMO, Higher School of Economics / Moscow, Volgograd State Technical University, Lobachevsky State University of Nizhni Novgorod, Moscow Aviation Institute, Tyumen industrial University, University of Haifa, Northern (Arctic) Federal University, Saratov State University, Ural Federal University.↵
↵
Hello Muscat Bootcamp will take place from 9th to 15th of March, and 120 students from 24 universities, including MIPT, Saint Petersburg State University and University of Tokyo will compete and practice side-by-side, smoothing the road towards the April World Finals in Porto.↵
↵
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 **7 problems** and **2 hours** to solve them.↵
↵
The problems were invented and prepared by Roman [user:Roms,2019-03-04] Glazov, Adilbek [user:adedalic,2019-03-04] Dalabaev, Vladimir [user:Vovuh,2019-03-04] Petrov, Ivan [user:BledDest,2019-03-04] Androsov, Maksim [user:Ne0n25,2019-03-04] Mescheryakov and me. Also huge thanks to Mike [user:MikeMirzayanov,2019-03-04] Mirzayanov for great systems Polygon and Codeforces.↵
↵
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:V--gLaSsH0ldEr593--V, 2019-03-05]</td>↵
<td>7</td>↵
<td>321</td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:kmjp, 2019-03-05]</td>↵
<td>7</td>↵
<td>380</td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:Kilani, 2019-03-05]</td>↵
<td>7</td>↵
<td>452</td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:neal, 2019-03-05]</td>↵
<td>7</td>↵
<td>721</td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:I_love_Tanya_Romanova, 2019-03-05]</td>↵
<td>6</td>↵
<td>204</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:algmyr, 2019-03-05]</td>↵
<td><b><font color="green">121</font></b></td></td>↵
</tr>↵
<tr>↵
<td>2</td>↵
<td>[user:MarcosK, 2019-03-05]</td>↵
<td><b><font color="green">119</font></b><b>:<font color="red">-6</font></b></td></td>↵
</tr>↵
<tr>↵
<td>3</td>↵
<td>[user:mohammad.h915, 2019-03-05]</td>↵
<td><b><font color="green">60</font></b><b>:<font color="red">-1</font></b></td></td>↵
</tr>↵
<tr>↵
<td>4</td>↵
<td>[user:MohamedAhmed04, 2019-03-05]</td>↵
<td><b><font color="green">50</font></b></td></td>↵
</tr>↵
<tr>↵
<td>5</td>↵
<td>[user:AhmedMaherAli, 2019-03-05]</td>↵
<td><b><font color="green">45</font></b><b>:<font color="red">-1</font></b></td></td>↵
</tr>↵
</tbody>↵
</table>↵
1837 successful hacks and 1117 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:V--gLaSsH0ldEr593--V, 2019-03-05]</td>↵
<td>0:01</td>↵
</tr>↵
<tr>↵
<td>B</td>↵
<td>[user:1021869, 2019-03-05]</td>↵
<td>0:03</td>↵
</tr>↵
<tr>↵
<td>C</td>↵
<td>[user:V--gLaSsH0ldEr593--V, 2019-03-05]</td>↵
<td>0:08</td>↵
</tr>↵
<tr>↵
<td>D</td>↵
<td>[user:V--gLaSsH0ldEr593--V, 2019-03-05]</td>↵
<td>0:24</td>↵
</tr>↵
<tr>↵
<td>E</td>↵
<td>[user:TripleM5da, 2019-03-05]</td>↵
<td>0:20</td>↵
</tr>↵
<tr>↵
<td>F</td>↵
<td>[user:_Ash__, 2019-03-05]</td>↵
<td>0:06</td>↵
</tr>↵
<tr>↵
<td>G</td>↵
<td>[user:road_to_9k_mmr, 2019-03-05]</td>↵
<td>0:25</td>↵
</tr>↵
</tbody>↵
</table>