The CROC company and the Ministry of Defense of Russian Federation invite the schoolchildren of the 9-11th years of education in Moscow and the Moscow region to take part in a school programming championship. The championship is called Coder-Strike 2014. The championship will be held based on Codeforces.

Goals

We aim to support talented high school children, help to form the community of programming enthusiasts, develop future IT professionals. The modern industry offers scientific challenges that cannot be solved without profound knowledge in the field of algorithms and data structures. We want to provide out participants with potential ways of development of with the opportunities that open in front of high qualified professionals.

Participants

You can participate if you study at 9-11th school year of one of a high school of Moscow or Moscow region. You should also be over 14 years old at the moment of registration to the championship. In order to become a participant of the championship, you need to register before you take part in the qualifying round at http://crocok.ru/championship/. You should submit the participant application form to take part in the championship officially.

Schedule

The qualification round will consist of 2-3 easy programming problems, your solutions will be checked during the round. The rounds 1-2 and the finals will be conducted by the traditional Codeforces rules, you can learn more about them by these links:

• rules
• rules

Championship Finals

The championship finals will take place on April, 22 in the CROC company office on 5, Volochayevskaya street. The finalists will have an excursion along the company office an meet the leading specialists of CROC and the Ministry of Defence of Russian Federation. The time of the finals will be specified later.

The award ceremony will be on May, 20-23 on the exhibition by the Ministry of Defense called 'Complex Safety'.

Prizes

All the participants who make it to the finals get souvenirs from the CROC company and the Ministry of Defense of Russian Federation.

Participation Out-of-Competition

All the willing users can participate in the championship out of competition. In this case the application form is not required. The sorting rounds and the finals will be Codeforces rating rounds.

Soon (on March 16, 19:30 MSK) you are lucky to participate in Codeforces Round #236 for both divisions.

Problems have been prepared by me. It’s my first round for both divisions and I hope not last. I want to thank Gerald Agapov (Gerald) for help in preparation of this round, Ilya Los (IlyaLos) and Ignatyev Alexander (aiMR) for testing of problems, Mary Belova(Delinur) for translating the problems, Michael Mirzayanov (MikeMirzayanov) for marvelous Codeforces and Polygon systems.

UPD: Scoring system:

Div. 2: 500 — 1000 — 1500 — 2000 — 2500

Div. 1: 500 — 1000 — 1500 — 1500 — 2000

UPD:

Contest finished, congratulation for winners!

Div.2 :

1. vladb
2. iceiceice
3. LoneFox
4. ofpsxx
5. adsz

Div. 1:

• 1 sillycross
• 2 KADR
• 2 vepifanov
• 4 Endagorion
• 5 glassices
• 6 cgy4ever
• 7 rowdark
• 8 snuke
• 9 ftiasch
• 10 fsouza

UPD:

Editorial.

UPD:

Round Statistics from DmitriyH.

Hello everyone!

Codeforces Round #235 (Div. 2) will take place on March 10th at 19:30 MSK.

This is my first Codeforces round and I hope not the last one.

I'd like to thank Gerald Agapov (Gerald), Roman Rubanenko (Rubanenko), Sergey Oryshych (Oryshych) for helping me to prepare round, and Mariya Belova for translation of all problem statements into English.

Scoring: 500-1000-1500-2000-2500

GL & HF!

Top five:

1. UESTC_XHXJ

2. GoodByeAhu

3. OrzSKYDEC

4. simonlindholm

5. angelyue

Congratulations of participant hoanglmdiv2, who solved the problem E.

Unfortunately, my fault, in the round hit the problem that was previously used on another competition. Since it does not comply Codeforces, problem E will be deleted.

English tutorial

Hi! Soon Codeforces Round #234 (Div. 2) will take place, i am the author, Dmytro Berezin :)

Thanks to Gerald Agapov (Gerald) for the help in round preparation, Maria Belova (Delinur) for tasks translations, Mike Mirzayanov (MikeMirzayanov) for perfect system, and Sergii Nagin (Sereja) for his agreement (to share his evening with me) to help in testing.

Distribution will be announced as soon as found :) Standard :)

Good luck!

On 02.03.14 there was a serious technical failure: Codeforces and related infrastructure hard drives have been corrupted. Unfortunately, it turned out that in contrast to all other components, the Codeforces database was not replicated properly. Polygon and Gym files were not injured. However, the Codeforces data has been significantly damaged.

We've rolled back the system to the state on February 7. It will remove 22 days of Codeforces life. Immediate efforts will be directed at the total exclusion of such situations. This is a very serious loss for me personally, which I can only blame myself.

Many thanks for all of you who supported us on a temporary Codeforces page. You helped much to find motivation in this difficult situation.

Currently the Gym is disabled. It will be opened back soon. We will return official contests and gym trainings with problems (but not results).

Data to be recovered:

• official contests with problems (but without results);
• public trainings in Gym;
• non-public trainings in Gym, but we do not know their owners — write me if you've prepared non-public training in Gym (not a mashup).

Sorry again for the inconvenience.

Hello everyone!

Codeforces Round #228 (Div. 1 and Div.2) will start at Monday, 3 February 2014, 19:30:00 MSK.

This is my 2nd round on Codeforces. (Click here to see my last round) , As usual, there will be 7 problems: 2 for Div2, 2 for Div1 and 3 for both. And same with the last round, the main character of all problem will be Fox Ciel.

I would like to thank Gerald for testing, and MikeMirzayanov for the Codeforces project including polygon system.

Good luck and have fun!

The score distribution will be published later. And the editorial will be published right after the system test.

By the way, yesterday is the Chinese new year. So I'd like to say Happy New Year to everyone who celebrate it! And I'm very glad to be the writer of the first round in the new year.

Update1: Good news for participants of Petrozavodsk training camp. Top 20 participants of the camp by this round results will get t-shirts from Codeforces.

Update 2: The score distribution for Both Division is regular (500-1000-1500-2000-2500).

Update 3: We postpone the round 10 minutes by technical reasons (dinner on Petrozavodsk Training Camp), sorry for the inconvenience.

Update 4: We've increased the contest time by 5 minutes.

Update 5: Contest ended, thanks for your participating! I'll post the editorial soon.

Update 6: Editorial.

Winners:

DIV1:

1. tourist
2. PavelKunyavskiy
3. Egor
4. 2222
5. dreamoon_love_AA

Sadly no one solved E correctly. Egor's solution can pass if the TL is 7 seconds instead of 6, what a pity!

DIV2:

1. I_love_Hoang_Yen
2. iaacboy
3. GoldExperience
4. shivatejesh
5. lordpawel

They are the only people who solved all tasks!

Hello!

Soon (on January 30 at 19:30 MSK) you are lucky to participate in Codeforces Round #227 for Div. 2 participants. Traditionally, Div. 1 participants can take part out of the competition.

Problems have been prepared by me. I want to thank Gerald Agapov (Gerald) for help in preparation of this round, Mary Belova (Delinur) for translation of statements, Michael Mirzayanov (MikeMirzayanov) for marvelous Codeforces and Polygon systems.

The main character of the tasks is the cat George.

UPD1: Scoring will be next: 500, 1000, 1500, 2000, 2500.

UPD2: Contest finished, congratulations to winners!

1. Sorto
2. graphis
3. InternationalGrandmaster
4. Skedar
5. mateusz

UPD: Editorial

UPD: Statistics

Hello!

Soon, on January 24th at 19:30 MSK, you are lucky to participate in Codeforces Round #226 for Div. 2 participants. Traditionally, Div. 1 participants can take part out of the competition.

Problems have been prepared by: Aleksey Chesnokov (CleRIC), Kirill Butin (KirillB) and Ivan Popovich (NVAL). This is the first round prepared by us and we hope that everything will be OK.

During the round you will be helping to the hero of the problems — usual bear.

We want to thank Gerald, Delinur, Aksenov239 and MikeMirzayanov for the system.

Scoring: 500-1000-1500-2000-2500.

Good Luck!

UPD: Round rescheduled for 5 minutes later

UPD: Editorial

UPD: We hope that you liked round.

Congratulations to winners:

1. cptbtptp

2. SquirrelDetected

3. MahooshojoNHB

4. Dong5k

5. yada

Hello everyone!

We invite you to participate at Codeforces Round #225, scheduled Monday, 20th January at 7:30 PM MSK. This is the third round I coauthor, along with Codeforces Round 198 (Div. 1) (and of course Div. 2 version of contest) and Codeforces Round 191 (Div. 2).

If you recall my old rounds, you'll see that main character is Iahub. The other writer of this round is... Iahub... the real person corresponding to "Iahub" character. Let me introduce you to Rares Buhai (rares.buhai). He's the author of Div. 2 C / Div. 1 A, Div. 1 D and Div. 1 E. You can expect those problems to be interesting, coming from a 2 times IOI gold medalist (being allowed to participate 2 more times). All other problems are created by me. I like them, but I wouldn't be objective if I said that they're interesting. Let's see if someone will think so after the contest :)

Like last time, I'll give you a little spoiler about the tasks. We tried to make the problem set as varied as possible. In order to get a good rank, one needs to be good at "ad hoc" problems as well as have good algorithmic knowledge.

As always, thanks to MikeMirzayanov for Codeforces platform, to Delinur for translating tasks, to Gerald for helping us prepare the round and to DamianS and ll931110 for testing it.

We wish everyone high rating and to have fun!

UPD Score distribution:

Division 1: 500 — 1500 — 1500 — 2000 — 2500

Division 2: 500 — 1000 — 1500 — 2500 — 2500

UPD Contest is over! Thanks for everyone who participated! I need to say we're impressed of your creative and totally unexpected solutions for Division 1 D.

Div. 1 winners:

1. yeputons
2. Arcueid
3. Dmitry_Egorov
4. ACMonster
5. scott_wu

Div. 2 winners:

1. Sick_coder
2. akaring
3. c0d3junki3
4. raihatneloy
5. sky0917

UPD Editorial

Good day everybody)

Welcome to regular Codeforces round #224 for Div.2 participants, first Div2 Only in new 2014 year:). As always Div.1 participants can take part out of the competition.

The problems were prepared by authors Pavel Kholkin (HolkinPV) and Gerald Agapov (Gerald). I can't already remember exactly in how many rounds I participate as author, co-author of just active assistant) Traditionally thanks to Michael Mirzayanov (MikeMirzayanov) for perfect Codeforces and Polygon systems and Mary Belova (Delinur) for translating the problems.

UPD: Score distribution will be dynamic, but the problems will be in supposed order of increasing complexity. The first dynamic round in this year)

We wish everyone good luck, high rating and excellent mood)

UPD2: the contest is over, we hope you enjoy it) the editorial is already here)

Congratulations to winners:

1) tankmagiciangirl
2) NagaiNatsuyasumi
3) lijian3256
4) TankKiller
5) dashabi