Educational Codeforces Round 70 [Rated for Div. 2]

Revision en4, by pikmike, 2019-08-09 12:15:41

Hello Codeforces!

On Aug/07/2019 17:35 (Moscow time) Educational Codeforces Round 70 (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 Ne0n25 Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all participants!

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

Hello Codeforces!

Ready to get deep?

Take a minute and ask yourselves — what skills are I missing, that I would love to have? What are those key qualities that would take me from being a decent developer to an extraordinary one? Am I where I want to be, in terms of personal progress?

At Harbour.Space, we focus on the key technical and social requirements of the jobs of the future. Our three-week courses are designed for students to acquire and develop specific skills through seminars, workshops, projects, and case studies in a very short amount of time.

Mike Mirzayanov’s course, Advanced Algorithms and Data Structures, is a great example of this:

This, in combination with our unique academic environment, extensive professional network, and our seaside campus in the beautiful city of Barcelona, provides for a truly unique learning experience.


Fill out the form below, get more information, and see how you can come attend Mike’s course to see what all the fuss is about!


See you soon!


Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 esbee 6 258
2 tfg 6 302
3 Heltion 6 310
4 jiangly 6 338
5 Geothermal 5 195

Congratulations to the best hackers:

Rank Competitor Hack Count
1 wwmm123 25
2 zdw1999 25:-2
3 geyanlu 14:-4
4 Mark9903 6:-5
5 awasd 3
109 successful hacks and 290 unsuccessful hacks were made in total!

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

Problem Competitor Penalty
A nantf 0:03
B Denverjin 0:11
C Geothermal 0:20
D dhxh 0:10
E lqs2015 0:19
F duxing201606 0:59

UPD: Editorial is out


  Rev. Lang. By When Δ Comment
en6 English pikmike 2019-08-09 18:42:29 918
ru6 Russian pikmike 2019-08-09 18:39:13 914
en5 English pikmike 2019-08-09 18:30:47 210
ru5 Russian pikmike 2019-08-09 18:30:14 210
en4 English pikmike 2019-08-09 12:15:41 2464
ru4 Russian pikmike 2019-08-09 12:14:27 2440
en3 English pikmike 2019-08-08 18:55:11 72
ru3 Russian pikmike 2019-08-08 18:54:31 74
ru2 Russian Una_Shem 2019-08-07 12:39:31 1561
en2 English Una_Shem 2019-08-07 08:54:13 1503 Tiny change: 'u soon!_\n_Harbour' -> 'u soon!_\n\n_Harbour'
en1 English pikmike 2019-08-06 16:07:38 1276 Initial revision for English translation
ru1 Russian pikmike 2019-08-06 16:06:35 1397 Первая редакция (опубликовано)