Junior Challenge is a yearly contest organised by volunteers from the Romanian programming community. You can read more about it in our previous blog post.

The second round takes place on Tuesday, September/05/2017 11:00 (UTC), and it will be unrated.

Contest format:

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

Many thanks to Andrei1998, bciobanu, tamionv, geniucos and george_stelian for authoring and preparing the tasks.

Round #46 (Div. 1.5)

The corresponding Round #46 starts at the same time, on Tuesday, September/05/2017 11:00 (UTC). The round will be rated for everyone with a rating below 1775 (this includes yellows).

Contest format:

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

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

Junior Challenge is a yearly contest organised by volunteers from the Romanian programming community. The contest is addressed to middle school students who want to prepare for the Junior Balkan Olympiad in Informatics, and starting this year, the European Junior Olympiad in Informatics.

This is the first international edition of the contest. There will be two separate competition days, and the rounds will be unrated. The first round takes place on Sunday, September/03/2017 15:00 (UTC).

Contest format:

• You will have to solve 4 tasks in 4 hours.
• The first task will be the easiest one, the other three will be in random order.
• 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.

Many thanks to Andrei1998, bciobanu, tamionv, geniucos and george_stelian for authoring and preparing the tasks.

Round #45 (Div. 1.5)

In parallel with Junior Challenge, we will organise two CS Academy rounds, that will be rated for everyone with a rating below 1775 (this includes yellows). The CS Academy contests will consist of all the problems in Junior Challenge, plus some extra easy ones. The corresponding Round #45 starts at the same time, on Sunday, September/03/2017 15:00 (UTC).

Contest format:

• You will have to solve 6 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 #44 will take place on Wednesday, August/30/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 #43 will take place on Sunday, 27/August/2017 12: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 lucyanna2018 as a problem author.

Prizes

We're going to award the same prizes as the previous Div. 1 + Div. 2 rounds:

1. First place: 100$
2. Second place: 50$
3. One random prize: 50$.

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.

Hello, Codeforces!

We are going to host a new contest at csacademy.com. Round #42 will take place on Wednesday, August/16/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 #41 will take place on Wednesday, 09/August/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 legar as a problem author.

Prizes

We're going to award the same prizes as the previous Div. 1 + Div. 2 rounds:

1. First place: 100$
2. Second place: 50$
3. One random prize, either 50$ or a custom CS Academy T-shirt, whichever the winner wants. :)

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. WHITE2302
2. ksun48
3. irkstepanov
4. qwerty787788
5. Shik

And to the random prize winner, Vvalter!

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

Hello, Codeforces!

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

Special prizes

This round will have 3 special prizes consisting of private coaching lessons with our contest coordinator, wefgef. Each lesson will be conducted on Skype and will last for 1 hour and 30 minutes. You can find out more details on the contest page.

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 #39 will take place on Wednesday, July/26/2017 15:00 (UTC). This round will be a Div. 2, affecting users with a rating below 1675.

Special prizes

This round will have 3 special prizes consisting of private coaching lessons with our contest coordinator, wefgef. Each lesson will be conducted on Skype and will last for 1 hour and 30 minutes. You can find out more details on the contest page.

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 24th Central European Olympiad in Informatics took place in Ljubljana, Slovenia, during July 10th-15th 2017. The most gifted high school students from 14 countries had the opportunity to prove their knowledge and skills in informatics.

If you didn't participate in the official online mirror and you didn't get the change to read the problem statements yet, we invite you to participate in two unrated contests that will use the tasks from CEOI. The first contest starts on Thursday, July 20, 11:00:00 UTC. The second contest starts on Friday, July 21, 11:00:00 UTC 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.

Hello, Codeforces!

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

We are glad to have tourist as a problem author.

Prizes

We've decided to continue awarding the same prizes as the previous Div. 1 + Div. 2 round:

1. First place: 100$
2. Second place: 50$
3. One random prize, either 50$ or a custom CS Academy T-shirt, whichever the winner wants. :)

Prize update

One random participant will get a private online coaching lesson with Errichto.

Contest format:

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

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 #37 will take place on Wednesday, July/12/2017 15:00 (UTC). This round will be a Div. 2, meaning that the rating change will only affect users with a rating below 1675.

Special prizes

This round will have 3 special prizes consisting of private coaching lessons with our contest coordinator, wefgef. Each lesson will be conducted on Skype and will last for 1 hour and 30 minutes. You can find out more details on the contest page.

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 25th Balkan Olympiad in Informatics takes place in Chișinău, Republic of Moldova, from July 02 (arrival day) to July 08 (departure day) 2017. The most gifted students from the Balkan region of Europe will have the opportunity to prove their knowledge and skills in informatics.

CS Academy will host the online mirrors of both competition days. The second contest starts on Thursday, July 06, 11:00:00 UTC, right after the onsite competition ends. The round will be rated on CS Academy. The problem statement 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 #36 will take place on Wednesday, July/05/2017 15:00 (UTC). This round will be a Div. 2, meaning that the rating change will only affect users with a rating below 1675.

Special prizes

This round will have 3 special prizes consisting of private coaching lessons with our contest coordinator, wefgef. Each lesson will be conducted on Skype and will last for 1 hour and 30 minutes. You can find out more details on the contest page.

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 25th Balkan Olympiad in Informatics takes place in Chișinău, Republic of Moldova, from July 02 (arrival day) to July 08 (departure day) 2017. The most gifted students from the Balkan region of Europe will have the opportunity to prove their knowledge and skills in informatics.

CS Academy will host the online mirrors of both competition days. The first contest starts on Tuesday, July 04, 11:00:00 UTC, right after the onsite competition ends. The round will be rated on CS Academy. The problem statement 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 happy to announce that we're going to host a new contest at csacademy.com. Round #35 will take place on Wednesday, 28/June/2017 15:00 (UTC). If you want to take part in this round you need to register before the contest begins. 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 geniucos as a problem author.

Prizes

We've decided to continue awarding the same prizes as the previous Div. 1 + Div. 2 round:

1. First place: 100$
2. Second place: 50$
3. One random prize, either 50$ or a custom CS Academy T-shirt, whichever the winner wants. :)

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. tourist
2. snuke
3. kmjp
4. RomaWhite
5. W4yneb0t

And to the random prize winner, D0GEzilla!

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

Hello, Codeforces!

We are happy to announce that we're going to host a new contest at csacademy.com. Round #34 will take place on Wednesday, June/21/2017 15:00 (UTC). This round will be a Div. 2, meaning that the rating change will only affect users with a rating below 1675. Unrated users will also be affected. High rated coders can participate unofficially.

If you want to take part in this round you need to register before the contest begins. As this is a Div. 2, it will consist of 5 tasks of more accessible difficulty.

Special prizes

This round will have 3 special prizes consisting of private coaching lessons with our contest coordinator, wefgef. Each lesson will be conducted on Skype and will last for 1 hour and 30 minutes. The topics approached during the lesson will be the choice of the winners. The prizes will be distributed as follows:

• 1 random prize for the top 20%
• 1 random prize for the next 30%
• 1 random prize for the bottom 50%

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 happy to announce that we're going to host a new contest at csacademy.com. Round #33 will take place on Wednesday, June/14/2017 15:00 (UTC). This round will be a Div. 2, meaning that the rating change will only affect users with a rating below 1675. Unrated users will also be affected. High rated coders can participate unofficially.

If you want to take part in this round you need to register before the contest begins. As this is a Div. 2, it will consist of 5 tasks of more accessible difficulty.

Special prizes

This round will have 3 special prizes consisting of private coaching lessons with our contest coordinator, wefgef. Each lesson will be conducted on Skype and will last for 1 hour and 30 minutes. The topics approached during the lesson will be the choice of the winners. The prizes will be distributed as follows:

• 1 random prize for the top 20%
• 1 random prize for the next 30%
• 1 random prize for the bottom 50%

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 happy to announce that we're going to host a new contest at csacademy.com. Round #32 will take place on Thursday, 08/June/2017 15:00 (UTC). If you want to take part in this round you need to register before the contest begins. This contest will be a Div1 + Div2, with 7 tasks of varying difficulty that need to be solved in 2 hours and 30 minutes.

Prizes

Given that this round number is a power of 2 (and powers of 2 have a special place in a programmer's heart), we decided to award three prizes:

1. First place: 100$
2. Second place: 50$
3. One random prize, either 50$ or a custom CS Academy T-shirt, whichever the winner wants. :)

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.

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. tourist
2. anta
3. yutaka1999
4. lexuanan
5. lucyanna2018

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

Hello, Codeforces!

CS Academy will continue continue to host the online mirrors of Romania's National Selection Camps for IOI 2017. Round #6 takes place on Tuesday, 06 June 13:00 (UTC). The round will be unrated for all users. The statements will be available in English. If you want to take part in this round you need to register before the contest begins.

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 happy to announce that we're going to host a new contest at csacademy.com. Round #31 will take place on Tuesday, 30/May/2017 15:00 (UTC). If you want to take part in this round you need to register before the contest begins. This contest will be a Div1 + Div2, with 7 tasks of varying difficulty that need to be solved in 2 hours and 30 minutes.

We are glad to have Lewin as problem setter.

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. Golovanov399
3. y0105w49
4. mmaxio
5. snuke

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

Hello, Codeforces!

CS Academy will continue continue to host the online mirrors of Romania's National Selection Camps for IOI 2017. Round #5 takes place on Wednesday, 24 May 15:00 (UTC). The round will be unrated for all users. The statements will be available in English and Romanian. If you want to take part in this round you need to register before the contest begins.

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.

Later edit: We decided to cancel the contest due to the overlap with the ACM ICPC World Finals. Even more, two of the problems used in the contest are not currently supported by our platform.

Hello, Codeforces!

We are happy to announce that we're going to host a new contest at csacademy.com. Round #30 will take place on Wednesday, May/24/2017 12:00 (UTC). This round will be a Div. 2, meaning that the rating change will only affect users with a rating below 1650. Unrated users will also be affected. High rated coders can participate unofficially.

If you want to take part in this round you need to register before the contest begins. As this is a Div. 2, it will consist of 5 tasks of more accessible difficulty.

Special prizes

This round will have 3 special prizes consisting of private coaching lessons with our contest coordinator, wefgef. Each lesson will be conducted on Skype and will last for 1 hour and 30 minutes. The topics approached during the lesson will be the choice of the winners. The prizes will be distributed as follows:

• 1 random prize for the top 20%
• 1 random prize for the next 30%
• 1 random prize for the bottom 50%

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!

CS Academy will continue continue to host the online mirrors of Romania's National Selection Camps for IOI 2017. Round #4 takes place on Monday, 22 May 13:00 (UTC). The round will be unrated for all users. The statements will be available in English and Romanian. If you want to take part in this round you need to register before the contest begins.

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 happy to announce that we're going to host a new contest at csacademy.com. Round #29 will take place on Wednesday, May/17/2017 15:00 (UTC). This round will be a Div. 2, meaning that the rating change will only affect users with a rating below 1650. Unrated users will also be affected. High rated coders can participate unofficially.

If you want to take part in this round you need to register before the contest begins. As this is a Div. 2, it will consist of 5 tasks of more accessible difficulty.

Special prizes

This round will have 3 special prizes consisting of private coaching lessons with our contest coordinator, wefgef. Each lesson will be conducted on Skype and will last for 1 hour and 30 minutes. The topics approached during the lesson will be the choice of the winners. The prizes will be distributed as follows:

• 1 random prize for the top 20%
• 1 random prize for the next 30%
• 1 random prize for the bottom 50%

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 first round of Romania's IOI 2017 Selection Contests took place a week ago. CS Academy will host the online mirror on Sunday, 14/May/2017 09:00:00 (UTC). You will have to solve 3 problems in 5 hours. The statements will be available in English and Romanian.

Update: The round will be unrated because of the overlap with Russian Code Cup.

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.

Support for countries

In the account settings you can now choose your country. We've also added country filters to the contest scoreboard.

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.