I'm proud to announce that Codeforces Round #457 (Div. 2) will be held on 19 Jan, 14:35 UTC. The problemset is authored by jamiechoi, longhuenchan and me (STommydx). It is our first round in Codeforces and hope you all find the problems interesting.
We would like to thank the following people as the round would not be possible without their kind help: gritukan for coordinating the round, Arpa for testing the problems and MikeMirzayanov for the great Polygon and Codeforces platform.
The contest will consist of 5 problems and you'll be given 2 hours to solve them. The scoring distribution will be announced close to the start of the round as tradition.
Let me close this blog post by answering the most frequently asked question in Codeforces. This round is rated for all Div. 2 participants. As usual, Div. 1 participants can join out of competition.
Good luck and high ratings!
Scoring distribution: 500-1000-1500-2250-2500
We are extremely sorry for the situation for problem B. We are figuring out a correct solution for problem B. I hope you all enjoy the rest of the problems.
The round is over. Congratulates to the winners!
The editorial will be available tomorrow.
Editorial is ready!