Educational Codeforces Round 59 [Rated for Div. 2]

Revision en5, by PikMike, 2019-01-27 18:53:52

Hello Codeforces!

On Jan/26/2019 18:35 (Moscow time) Educational Codeforces Round 59 (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 extented ACM 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 Roms Glazov, Adilbek adedalic Dalabaev, Vladimir Vovuh Petrov, Ivan BledDest Androsov and me.

Good luck to all participants!

UPD: You can discuss the problems after the contest on a local Discord server.

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

Hello Codeforces!

A quick reminder to check out the Hello Muscat Programming Bootcamp!

Every day, both the Hello Programming Bootcamp and the Moscow ICPC Workshop will be competing simultaneously, 4,000 kilometers from each other — our camp will take place in Oman, from March 9th to March 15th, 2019 — registration is still open for this unique opportunity, so be sure to give it a look, we would love to see you there with us!

REGISTER FOR THE BOOTCAMP

And, don’t forget that Harbour.Space University’s opportunity for a fully funded Master’s in Robotics programme scholarship is still open! Head over to their website to see the details, and apply before the registration date closes.

APPLY HERE

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 V--gLaSsH0ldEr593--V 7 198
2 Radewoosh 7 358
3 Rzepa 7 396
4 eddy1021 6 170
5 spacewanker 6 175

Congratulations to the best hackers:

Rank Competitor Hack Count
1 _bacali 39:-44
2 Kiri8128 8
3 tymo 5:-1
4 CoodeForces 4
5 Sevlll 5:-4
121 successful hacks and 527 unsuccessful hacks were made in total!

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

Problem Competitor Penalty
A V--gLaSsH0ldEr593--V 0:01
B neal 0:02
C neal 0:05
D V--gLaSsH0ldEr593--V 0:10
E DankShadow 0:10
F V--gLaSsH0ldEr593--V 0:44
G Kalam 0:17

UPD2: The editorial is out

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English PikMike 2019-01-27 18:53:52 2605
ru4 Russian PikMike 2019-01-27 18:53:37 2581
en4 English PikMike 2019-01-27 18:50:30 77
ru3 Russian PikMike 2019-01-27 18:50:07 74
en3 English PikMike 2019-01-26 12:35:54 1465
ru2 Russian PikMike 2019-01-26 12:35:32 1457
en2 English PikMike 2019-01-26 00:51:50 129 Tiny change: 'pants!\n\nUPD: You can d' -> 'pants!\n\n**UPD:* You can d'
en1 English PikMike 2019-01-25 12:11:12 1124 Initial revision for English translation
ru1 Russian PikMike 2019-01-25 12:10:30 1251 Первая редакция (опубликовано)