Hello, Codeforces!

Once again, we've reached a round number that is a power of 2 at csacademy.com. In order to properly celebrate this, Round #64 will consist of interactive problems only. If you are not familiar with this type of problems on our platform, please read this blogpost before the contest.

The round will take place on Wednesday, 10/January/2017 15:05 (UTC). This contest will be a Div1 + Div2, with 7 tasks of varying difficulty that need to be solved in 2 hours.

Facebook event

Recently, Facebook has reintroduced the possibility of recurring events. 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:

1. First place: 100$
2. 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 [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

Happy New Year, Codeforces!

We are going to host a new contest at csacademy.com. Round #63 will take place on Wednesday, January/03/2018 15:05 (UTC). This round will be a Div. 2, affecting users with a rating below 1800.

Facebook event

Recently, Facebook has reintroduced the possibility of recurring events. If you choose "Interested" here, you will be notified before each round we organise from now on.

Contest format:

• You will have to solve 5 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.

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.

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

We are going to host a new contest at csacademy.com. Round #62 will take place on Wednesday, December/20/2017 15:05 (UTC). This round will be a Div. 2, affecting users with a rating below 1800.

Facebook event

Recently, Facebook has reintroduced the possibility of recurring events. If you choose "Interested" here, you will be notified before each round we organise from now on.

Contest format:

• You will have to solve 5 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.

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.

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

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

Facebook event

Recently, Facebook has reintroduced the possibility of recurring events. 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:

1. First place: 100$
2. 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 [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

We are going to host a new contest at csacademy.com. Round #60 will take place on Wednesday, December/06/2017 15:05 (UTC). This round will be a Div. 2, affecting users with a rating below 1800.

Facebook event

Recently, Facebook has reintroduced the possibility of recurring events. If you choose "Interested" here, you will be notified before each round we organise from now on.

Contest format:

• You will have to solve 5 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.

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.

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

We are going to host a new contest at csacademy.com. Round #59 will take place on Wednesday, November/29/2017 15:05 (UTC). This round will be a Div. 2, affecting users with a rating below 1800.

Contest format:

• You will have to solve 5 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.

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.

Don't forget to like us on Facebook, VK and follow us on Twitter.

The 9th International Autumn Tournament in Informatics will be held from the 22nd to 26th of November, 2017. The tournament is held in the city of Shumen, Bulgaria. The participants will not only compete in the field of Informatics, but will also be encouraged to enrich their knowledge and skills in the areas of computer science.

CS Academy will host the online mirrors of both competition days. The second contest starts on Saturday, November 25, 13:00:00 UTC, one hour after the onsite competition ends. The problem statements will be available in English.

Contest format

• You will have to solve 3 tasks in 5 hours.
• There will be full feedback throughout the entire contest.
• The tasks will have partial scoring. The maximum score for each problem will be 100 points.
• There will be no tie breaker, so two users having the same total score at the end of the contest will share the same place in the standings.

If you find any bugs please email us at [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

The 9th International Autumn Tournament in Informatics will be held from the 22nd to 26th of November, 2017. The tournament is held in the city of Shumen, Bulgaria. The participants will not only compete in the field of Informatics, but will also be encouraged to enrich their knowledge and skills in the areas of computer science.

CS Academy will host the online mirrors of both competition days. The first contest starts on Friday, November 24, 13:00:00 UTC, one hour after the onsite competition ends. The problem statements will be available in English.

Contest format

• You will have to solve 3 tasks in 5 hours.
• There will be full feedback throughout the entire contest.
• The tasks will have partial scoring. The maximum score for each problem will be 100 points.
• There will be no tie breaker, so two users having the same total score at the end of the contest will share the same place in the standings.

If you find any bugs please email us at [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

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

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$

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 [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

Привет, Codeforces!

Мы проведём очередной контест на csacademy.com. Раунд 57 состоится в субботу, 18 ноября 2017, в 18:05 (МСК). Раунд подготовлен для второго дивизона, и будет рейтинговым для участников с рейтингом меньше 1800. Участники из первого дивизиона приглашаются написать раунд вне конкурса.

Формат соревнования:

• Вам будут предложены 5 задач на 2 часа.
• Посылки тестируются сразу на всех тестах.
• Частичные баллы отсутствуют, поэтому необходимо пройти все тесты, чтобы решение засчиталось (правила ACM-ICPC).
• Динамическая стоимость задач. Это означает, что количество баллов за задачу будет зависеть от того, сколько участников успешно решит задачу. Баллы варьируются от 100 до 1000.
• При равном количестве баллов, выше окажется участник с минимальным штрафом.

Система штрафов:

• Штрафы вычисляются по следующей формуле: минута последнего успешно сданного решения + штраф за каждую отдельную задачу. Штраф за отдельную задачу равен log2 (количество_посылок) * 5.
• Не компилирующиеся решения, а также решения, не проходящие тесты из примеров, игнорируются при вычислении штрафа.
• После успешного решения задачи можно продолжать делать посылки по ней. Такие посылки игнорируются при вычислении баллов и штрафа.

Мы есть на Facebook, во ВКонтакте и в Twitter. Подписывайтесь, ставьте лайки!

We made a blog post about some of our latest platform improvements, and also were looking for some feedback here:

Platform improvements Nov 2017

The most significant changes are to the task page, so that it's much more streamlined with the workspace, with better usability. Take a look here for instance.

Any feedback is appreciated. :)

Hello, Codeforces!

We're going to host a new contest at csacademy.com. Round #56 will take place on Wednesday, 08/November/2017 15:05 (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 I_Love_Tina 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$

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 [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

Later Edit:

Congratulations to the winners:

1. izban
2. Radewoosh
3. V--o_o--V
4. LHiC
5. ainta

Also, the editorial has been published. Hope you enjoyed the contest!

Hello, Codeforces!

During the past days at CS Academy, we've been working on tweaking the rating algorithm, and now it's finally here! The total range of the rating has increased, and we also changed the cutoffs for the rating colors and, more important, for the divisions. From now on, you'll be rated in a Div. 2 round if your rating is below 1800.

Round #55

We are also going to host a new contest, Round #55 will take place on Wednesday, November/01/2017 16:05 (UTC). This round will be a Div. 2, affecting users with a rating below 1800.

Contest format:

• You will have to solve 5 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.

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.

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

We're going to host a new contest at csacademy.com. Round #54 will take place on Wednesday, 25/October/2017 15:05 (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 khadaev 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$

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 [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

We are going to host a new contest at csacademy.com. Round #53 will take place on Wednesday, October/18/2017 15:00 (UTC). This round will be a Div. 2, affecting users with a rating below 1675.

Contest format:

• You will have to solve 5 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.

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.

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

We're going to host a new contest at csacademy.com. Round #52 will take place on Wednesday, 11/October/2017 15:05 (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 HellKitsune as a problem author.

Contest format change

• The last problem will become visible only 20 minutes after the contest starts.

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$

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 [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

The Romanian Master of Informatics is a yearly competition addressed to high school students and organised by the Tudor Vianu highschool in Bucharest, Romania. The format of the contest is the one commonly found in olympiads.

RMI provides a great opportunity for young people to demonstrate their abilities in Informatics, to exchange knowledge and to enhance cross-cultural contacts in high-school education. Coming to RMI 2017, they will have opportunities to make new friends, to visit a friendly country, and to discover the culture of Romania.

CS Academy will host the online mirrors of both competition days. The first contest starts on Thursday, October 05, 11:00:00 UTC, after the onsite competition ends. The problem statements will be available in English.

Contest format

• You will have to solve 3 tasks in 5 hours.
• There will be full feedback throughout the entire contest.
• The tasks will have partial scoring. The maximum score for each problem will be 100 points.
• There will be no tie breaker, so two users having the same total score at the end of the contest will share the same place in the standings.

If you find any bugs please email us at [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

We are going to host a new contest at csacademy.com. Round #51 will take place on Wednesday, October/04/2017 15:00 (UTC). This round will be a Div. 2, affecting users with a rating below 1675.

Contest format:

• You will have to solve 5 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.

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.

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

We are going to host a new contest at csacademy.com. Round #50 will take place on Wednesday, September/26/2017 15:00 (UTC). This round will be a Div. 2, affecting users with a rating below 1675.

Contest format:

• You will have to solve 5 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.

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.

Don't forget to like us on Facebook, VK and follow us on Twitter.

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$

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 [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

We are going to host a new contest at csacademy.com. Round #48 will take place on Wednesday, September/13/2017 15:00 (UTC). This round will be a Div. 2, affecting users with a rating below 1675.

Contest format:

• You will have to solve 5 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.

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.

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

The 1st European Junior Olympiad in Informatics is taking place in Sofia, Bulgaria, from September 07 (arrival day) to September 13 (departure day) 2017.

CS Academy will host the online mirrors of both competition days. The second contest starts on Monday, September 11, 11:00:00 UTC, one hour after the onsite competition ends. The round will be unrated on CS Academy.

Contest format

• You will have to solve 3 tasks in 4 hours.
• There will be full feedback throughout the entire contest.
• The tasks will have partial scoring. The maximum score for each problem will be 100 points.
• There will be no tie breaker, so two users having the same total score at the end of the contest will share the same place in the standings.

If you find any bugs please email us at [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

Hello, Codeforces!

The 1st European Junior Olympiad in Informatics takes place in Sofia, Bulgaria, from September 07 (arrival day) to September 13 (departure day) 2017. EJOI is a significant event, a stepping-stone, in the development of the elite of the IT industry in Council of Europe member states.

CS Academy will host the online mirrors of both competition days. The first contest starts on Saturday, September 09, 11:00:00 UTC, one hour after the onsite competition ends. The round will be unrated on CS Academy.

Contest format

• You will have to solve 3 tasks in 4 hours.
• There will be full feedback throughout the entire contest.
• The tasks will have partial scoring. The maximum score for each problem will be 100 points.
• There will be no tie breaker, so two users having the same total score at the end of the contest will share the same place in the standings.

If you find any bugs please email us at [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

The first edition of EJOI (European Junior Olympiad in Informatics) will be taking place in Sofia, Bulgaria.

The first contest will take be on 9 September and the second one on 11 September.

We'll like to wish good luck to all participants attending the competition.

Prior to the competition we held a contest, Junior Challenge, as a preparation for the main contest.

If you're interested in the final standings, you can find them in this blogpost If you have any tips or tricks that might help young contestants, leave them in the comment section of the blogpost.

Hello, Codeforces!

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

This round will be authored by the CS Academy team.

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.

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 [email protected]

Don't forget to like us on Facebook, VK and follow us on Twitter.

Later Edit:

Congratulations to the winners:

1. Um_nik
2. Egor
3. Radewoosh
4. anta
5. uwi

Also, the editorial has been published. Hope you enjoyed the contest!