9

Codeforces Round #760 (Div. 3)

 2 years ago
source link: http://codeforces.com/blog/entry/97874
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Codeforces Round #760 (Div. 3)

By BledDest, 24 hours ago, translation,

Hello, Codeforces!

On Tuesday, December 14, 2021 at 14:35UTC the Codeforces Round #760 (Div. 3) will start. This is a usual round for the participants from the third division. The round will contain 8 problems, which are mostly suited for participants with rating below 1600 (or we hope so). Although, as usual, participants with rating of 1600 and greater 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 (we hope that our tests are strong enough, so there won't be too many solutions hacked during this phase).

You will have to solve 8 problems in 2 hours and 15 minutes. The penalty for a wrong submission is equal to 10 minutes.

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

  • take part in at least two rated rounds (and solve at least one problem in each of them),
  • 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.

The problems were prepared by Brovko, shnirelman, Lankin, awoo and me. We would like to thank the testers of the round: vovuh, Nil_Sinyaev, IsaacMoris, altynai, MarcosK, soyaa, Zula., Omar.Yasser, mumumucoder, peroon and kocko.

And, the last but not the least, thanks to Mike MikeMirzayanov Mirzayanov for Codeforces and Polygon systems!

Good luck in the contest! I hope you'll enjoy solving the problems we have prepared.


About Joyk


Aggregate valuable and interesting links.
Joyk means Joy of geeK