Hello, Codeforces!
We're going to host a new contest at csacademy.com. Round #78 will take place on Wednesday, 25 April 15:05 (UTC). This contest will be a Div1 + Div2, with 7 tasks of varying difficulty that need to be solved in 2 hours.
Some of the problems will be based on a contest from Romanian Olympiad IOI selection camp.
Facebook event
We recently created a new Facebook event. If you choose "Interested" here, you will be notified before each round we organise from now on.
Contest format:
- You will have to solve 7 tasks in 2 hours.
- There will be full feedback throughout the entire contest.
- Tasks will not have partial scoring, so you need to pass all test cases for a solution to count (ACM-ICPC-style).
- Tasks will have dynamic scores. According to the number of users that solve a problem the score will vary between 100 and 1000.
- Besides the score, each user will also get a penalty that is going to be used as a tie breaker.
Prizes
We're going to award the following prizes:
- First place: 100$
- Second place: 50$
About the penalty system:
- Computed using the following formula: the minute of the last accepted solution + the penalty for each solved task. The penalty for a solved task is equal to log2 (no_of_submissions) * 5.
- Solutions that don't compile or don't pass the example test cases are ignored.
- Once you solve a task you can still resubmit. All the following solutions will be ignored for both the score and the penalty.
If you find any bugs please email us at contact@csacademy.com
Don't forget to like us on Facebook, VK and follow us on Twitter.
Just a reminder: The contest will start in 20 minutes
Which of these tasks were on Romanian Selection camp, and if there were other tasks would you mind sharing them?
The last 3 were exactly the second selection we had. We also had one more selection contest (the first one), but besides the fact that there is no translated version of the tasks, I believe it's likely that the guys from csa would want to use them in another round as well, so I'll let them decide whether to disclose them now or later.
They can probably use only one problem from the first selection. The others are options for the next GP of Romania (or something similar), for when the time comes.