Educational Codeforces Round 63 [Rated for Div. 2]

Revision en4, by PikMike, 2019-04-23 17:28:03

Hello Codeforces!

On Apr/22/2019 17:35 (Moscow time) Educational Codeforces Round 63 (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!

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

Hi Codeforces!

This summer, we want to invite you to Tech Scouts, the two-week summer camp we run from the 8th-19th of July in one of Barcelona's leading international schools, St.Paul’s.

This camp, divided into Creative and Technical tracks, is designed to lay out the foundation of knowledge for high-school students in the fields of technology, mathematics, business and design. Both tracks are taught in English.

We would love to see you guys at our camp this year — if you’re interested in joining, or if you just want to know more, just head over to the Tech Scouts website.

This camp is for anyone passionate about tech or design, so if you know someone who might be interested, be sure to let them know too!

Ps. Don’t wait too long — you still have an early bird discount, but only until May 20th

UPD: The round will contain 6 problems.

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 Um_nik 6 111
2 Cinro_9baka 6 207
3 Ilovebxy 6 247
4 ivan100sic 6 249
5 ainta 6 411

Congratulations to the best hackers:

Rank Competitor Hack Count
1 halyavin 292:-18
2 Haunted_Cpp 31
3 WileE.Coyote 30:-4
4 Disappointment 27:-1
5 czasem_tak_trzeba 23
790 successful hacks and 697 unsuccessful hacks were made in total!

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

Problem Competitor Penalty
A iaeyoayao 0:01
B MesyuraTheOldDumbGoblin 0:03
C NeKrasnyj 0:07
D FlyToTheSky 0:07
E Rezwan.Arefin01 0:17
F Um_nik 0:59

UPD: The editorial is out

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English PikMike 2019-04-23 17:28:03 76
ru4 Russian PikMike 2019-04-23 17:27:38 74
en3 English PikMike 2019-04-23 17:22:17 2530
ru3 Russian PikMike 2019-04-23 17:20:34 2506
en2 English PikMike 2019-04-22 16:44:04 47
ru2 Russian PikMike 2019-04-22 16:43:38 36 Мелкая правка: 'sup>\n\n***UPD:*** В раунд' -> 'sup>\n\n**UPD:** В раунд'
en1 English PikMike 2019-04-21 14:42:54 2292 Initial revision for English translation
ru1 Russian PikMike 2019-04-21 14:41:43 2405 Первая редакция (опубликовано)