Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

Codeforces Round #605 (Div. 3)

Revision en4, by vovuh, 2019-12-13 19:07:44

<almost-copy-pasted-part>

Hello! Codeforces Round 605 (Div. 3) will start at Dec/12/2019 16:35 (Moscow time). You will be offered 6 or 7 problems (or 8) with expected difficulties to compose an interesting competition for participants with ratings up to 1600. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.

You will be given 6 or 7 (or 8) problems and 2 hours to solve them.

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participants of the third division, you must:

  • take part in at least two rated rounds (and solve at least one problem in each of them),
  • do not have a point of 1900 or higher in the rating.

Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of my work. Thanks to my good friends Daria nooinenoojno Stepanova, Mikhail awoo Piklyaev, Maksim Neon Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round.

Good luck!

I also would like to say that participants who will submit wrong solutions on purpose and hack them afterwards (example) will not be shown in the hacking leaders table.

</almost-copy-pasted-part>

UPD: Great thanks to Artem Rox Plotkin and Dmitrii _overrated_ Umnov for testing the round and help with bugs fixing! Artem is also proposed one of the problems for today's round!

UPD: Editorial is published!

Tags codeforces, 605, third division

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English vovuh 2019-12-13 19:07:44 160
ru5 Russian vovuh 2019-12-13 19:07:28 152
en3 English vovuh 2019-12-13 12:50:40 79
ru4 Russian vovuh 2019-12-13 12:50:21 75
en2 English vovuh 2019-12-12 12:38:34 226
ru3 Russian vovuh 2019-12-12 12:36:59 235
ru2 Russian vovuh 2019-12-11 16:56:25 0 (опубликовано)
en1 English vovuh 2019-12-11 16:56:18 2213 Initial revision for English translation
ru1 Russian vovuh 2019-12-11 16:55:41 2225 Первая редакция (сохранено в черновиках)