Educational Codeforces Round 81 [Rated for Div. 2]

Revision en5, by awoo, 2020-01-30 19:41:01

Hello Codeforces!

On Jan/29/2020 17:35 (Moscow time) Educational Codeforces Round 81 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

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 Roms Glazov, Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

Our friends at Harbour.Space also have a message for you:

Hello Muscat

Hi Codeforces!

As a special prize for the Educational Round 81, we would like to invite the top participants to take part in our Hello Muscat ICPC Programming Bootcamp, which will take place in Oman, from March 19 to March 25, 2020. The prize will cover the participation fee, accommodation, and half-board meals for the entire duration of the bootcamp (except flights)!

There are three requirements to satisfy:

  • You took part in at least 10 rated contests on Codeforces
  • Your max rating should be less than 2400
  • You should be eligible for ICPC and/or IOI 2020+
Fill out the form→

Good luck to everyone!

We are also excited to announce that we are working with our partners to provide free participation (flights not included) for the teams going to the ICPC World Finals 2020, which will take place in Moscow. If you and your team qualified for the Finals, fill out the form below to see if you’re eligible.

Apply Now→

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 nickluo 6 177
2 KrK 6 184
3 NoLongerRed 6 185
4 Anadi 6 200
5 neal 6 204

Congratulations to the best hackers:

Rank Competitor Hack Count
1 GiantTornado 58
2 rachit_raj 51:-1
3 harshraj22 41:-5
4 Ahmad__ 35:-1
5 sadik 33:-2
1096 successful hacks and 873 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A antontrygubO_o 0:01
B neal 0:05
C IgorI 0:07
D NoLongerRed 0:06
E A_Fan_of_the_AK_King--lk 0:14
F Combi 0:23

UPD: Editorial is out

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English awoo 2020-01-30 19:41:01 2598
ru4 Russian awoo 2020-01-30 19:40:19 2581
ru3 Russian Una_Shem 2020-01-28 19:14:12 176
en4 English Una_Shem 2020-01-28 19:11:53 4 Tiny change: 'font-size:20px; backgr' -> 'font-size:18px; backgr'
en3 English Una_Shem 2020-01-28 19:10:20 166
ru2 Russian Una_Shem 2020-01-28 18:26:31 1753 (опубликовано)
en2 English Una_Shem 2020-01-28 18:25:26 1672 (published)
en1 English awoo 2020-01-28 10:05:43 1280 Initial revision for English translation (saved to drafts)
ru1 Russian awoo 2020-01-28 10:03:48 1396 Первая редакция (сохранено в черновиках)