By csacademy, 9 months ago, ,

Hello, Codeforces!

We're going to host a new contest at csacademy.com. Round #49 will take place on Wednesday, 20/September/2017 15:00 (UTC). This contest will be a Div1 + Div2, with 7 tasks of varying difficulty that need to be solved in 2 hours.

We are glad to have zscoder as a problem author.

#### 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:

1. First place: 100$2. Second place: 50$

• 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.

•
• +128
•

 » 9 months ago, # |   +11 When can I receive my prizes from #43 :p
•  » » 9 months ago, # ^ |   +14 Sorry, we had that somehow marked as solved, and you didn't write to us after the round. :) I've sent you an email, and will send you the prize when you answer with your preferred payment method.
 » 9 months ago, # |   +31 Reminder : Contest starts in 3 hours.
 » 9 months ago, # |   +29 Hi. I just finished the editorial for problem Amusement park (link) (editorial link) I really enjoy Expected value problems, so I wanted the editorial to be as good as possible to understand. If you have any feedback, it's greatly appreciated since this is one of my first editorials.
•  » » 9 months ago, # ^ | ← Rev. 2 →   +13 Also, if your solved the problem but your solution requires infinite sums or crazy math, I really suggest to take a look at the editorial for a easier approach :)