Hello, Codeforces!
We are happy to announce that we're going to host a new contest at csacademy.com. Round #13 will take place on Thursday, 27/Oct/2016 16:00 (UTC). If you want to take part in this round you need to register before the contest begins. Just like the previous rounds, this will be a Div1 + Div2, with 7 tasks of varied difficulty that need to be solved in 2 hours and 30 minutes. We are honoured to have josdas, I_Love_Tina and atatomir as problem setters.
We'd also like to thank Yury_Bandarchuk for translating the statements in Russian.
This round is going to have some money prizes, as follows:
- First place: 125$
- Second place: 100$
- Third place: 75$
- Fourth and fifth place: 50$
- After the contest ends we may decide to award one or more special prizes on subjective basis.
Contest format:
- You will have to solve 7 tasks in 2 hours and 30 minutes.
- 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.
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.
Round #11 winners
As we announced before Round #11, we were supposed to award two more special prizes. Again, we decided to choose the winners randomly, using the same algorithm as in the previous rounds. So the winners of the two special prizes, each worth 50$, are Ra16bit and ajinkya1p3. The two will be contacted soon via email.
Platform changes since Round #12
New archive design

As you can see above, we've made some pretty drastic changes to the way our archive looks.
Tags and difficulty
We've also added tags and difficulty to all the existing problems. The tags are of two types: first level tags act like categories and they can nest second level tags. Clicking on a tag displays only problems having that tag OR, in the case of categories, at least one of its nested second level tags.
The difficulty of the problems falls in four categories: easy, medium, hard and hardest.
Multiple workspaces

You can now have up to 10 different workspaces. Each of them is a collection of files, one for each supported language.
Code sharing — now easier than ever

Whenever you compile/run a source, a "Share" button appears to the left of the "Compile" one. You can copy the url and then paste it wherever you want. Accessing the link opens a page like this (notice the "Fork" button):

Forking a source creates a new workspace and initialises it with the shared code.
New interview archive
Although not fully public yet, we'd like to share with the Codeforces community our new interview archive. It currently has 24 problems, some of them from previous CSA rounds, others are brand new. The idea behind this new project is to become a useful tool for everyone who is preparing for interviews with some of the top IT companies in the world. The purpose of these problems in not to AC them, but to help you learn how to explain your solution. Check out the editorials for an example.
We tried to provide you with a unique experience, many tasks supporting interactive widgets as you can see below:

^ Task Min Max Subarray

^ Task Justify Formatting
Task workspace split view
And the final platform change, we modified the task workspace such that split view works not only with the problem statement, but with all the other tabs too (editorial, submissions, etc).
We still recommend using an updated version of Google Chrome. 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.