Hello Codeforces!
We are glad to invite you to Codeforces Round 668 (Div. 1) and Codeforces Round 668 (Div. 2), which will take place on 06.09.2020 17:35 (Московское время).
The problems were created by Ari, Kuroni, JettyOller, Monogon, antontrygubO_o and hugopm.
We would like to thank:
dorijanlendvaj, Jatana and enoone for helping with the preparation of the tasks.
gamegame for always being nice and supportive.
DatVu, JettyOller, MofK and atoiz for stealing the round #666, forcing us to retheme around ponies.
Monogon for making the author list more colorful.
redblossom, thenymphsofdelphi, qlf9, mcfr, Tlatoani, aohkgnadnart_, McDic, cup_of_tea, bestial-42-centroids, Noam527, Mbfibat, wolfris, ffao, Falseeee, fpc_coder and fivefourthreeone for testing.
MikeMirzayanov for the Codeforces and Polygon platforms.
There will be 5 problems in each division and will be given 2 hours to solve them (or post memes in the comments if you can't solve any).
We tried to make interesting problems, short statements, useful samples and strong pretests, and we hope you will like it.
Scoring will be announced shortly before the round and editorial will be posted shortly after the round (it is already written).
Good luck!
UPD: The number of problems is now 5 in each division.
UPD2: Score distribution:
- Div.1: 500 — 1000 — 1500 — 2250 — 3000
- Div.2 : 500 — 1000 — 1750 — 2250 — 3000
UPD3: Editorial is out
UPD4: We are sorry for problem div1E being well-known. No setter or tester have seen this problem. We apologize and hope you still enjoyed the contest.
UPD5: Congratulations to the winners:
Div.1
Div.2
