Hello Codeforces!

On July 16, 18:05 MSK Educational Codeforces Round 25 will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

The round will be unrated for all users and will be held on extented ACM ICPC rules. After the end of the contest you will have one day to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 7 problems and 2 hours to solve them.

The problems were prepared by Ivan BledDest Androsov and me.

Good luck to all participants!

UPD: The editorial can be found here.

Hi!

On Thursday, July 13, 2017, at 15:05 UTC Codeforces Round #424 will be held. Some of the problems will be from VK Cup 2017 Finals, some are prepared by Codeforces team to complete the problemset.

There will be six problems in the second division, five as usual in the first, three of them shared. The problems of this round are proposed, prepared and tested by: send_nodes, akvasha, ilya_the_lamer, fcspartakm, Perforator, MikeMirzayanov, PavelKunyavskiy, qwerty787788, Belonogov, izban, tourist, vepifanov, AlexFetisov, winger, Errichto, Gassa, naagi, ashmelev, Endagorion, ifsmirnov, Arterm and me. Huge thanks to all who helped with the preparation!

There will be prizes from VK social network in this round as well! Namely, among participants solved five or more problems in second division, or two or more problems in first division, five are to be selected randomly. They will receive championship souvenirs. There is no country nor language restriction, everyone can win a prize. One don't have to have participated in VK Cup to receive the prize. Exact selection algorithm will be announced before the start of the round.

Good luck!

Congratulations to the winners!

Div. 1:

1. TakanashiRikka
2. moejy0viiiiiv
3. Petr
4. anta
5. matthew99

Div. 2:

1. ccz181078
2. repeating
3. ioyeoa
4. ReaLNero
5. beet

The analysis is here.

The problems correspond to problems of VK Cup 2017 - Finals as follows:

• Problem 830C - Bamboo Partition — is problem 823C - Bamboo Partition, author is me;
• Problem 830D - Singer House — is problem 823E - Singer House, authors are send_nodes and me;
• Problem 830E - Perpetual Motion Machine — is problem 823F - Perpetual Motion Machine, authors are akvasha and ilya_the_lamer.

We invite you to participate in the boot camp that will be held at Yanka Kupala Grodno State University in collaboration with Moscow ACM ICPC Workshops from 15 to 25 August, 2017.

The cost of participation per single person is: 490 USD.

The cost features the curriculum, food and accommodation at the Grodno State University campus and trip schedule on days-off.

Grodno State University, being located almost in the center of Europe, is one of the centers for ACM ICPC coaching. Among the events hosted at GrSU are: bootcamps and open competitive programming championships.

Registrate here!

Recommended time of arrival: August 14, or 15 until 12:00am

Recommended time of departure: August 26, or 25 after 20:00 (8pm)

Look here for more information.

Hi!

On Tuesday, July 11, 2017, at 16:35 UTC Codeforces Round #423 will be held. Some of the problems will be from VK Cup 2017 Finals, some are prepared by Codeforces team to complete the problemset.

Note that there will be two rounds based on VK Cup Finals, so I want to ask finalists not to discuss problems until the end of the second round.

There will be six problems in each division, four of them shared. The problems of this round are proposed, prepared and tested by: gritukan, demon1999, fcspartakm, Perforator, MikeMirzayanov, PavelKunyavskiy, qwerty787788, Belonogov, izban, tourist, vepifanov, AlexFetisov, winger, Errichto, Gassa, naagi, ashmelev, Endagorion, ifsmirnov, Arterm and me. Huge thanks to all who helped with the preparation!

There will be prizes from VK social network in this round! Namely, among participants solved five or more problems in second division, or three or more problems in first division, five are to be selected randomly. They will receive championship souvenirs. There is no country nor language restriction, everyone can win a prize. One don't have to have participated in VK Cup to receive the prize. Exact selection algorithm will be announced before the start of the round. There will be prizes in the second round using Finals' problems as well!

Good luck!

Congratulations to the winners!

Div. 1:

1. W4yneb0t
2. moejy0viiiiiv
3. koosaga
4. Radewoosh
5. dotorya

Div. 2:

1. ccz181078
2. rqy1458814497
3. houruize
4. _Is_It_Rated_
5. liutianyi000

The analysis is here.

Corresponding problems from VK Cup 2017 - Finals:

• Problem 827B - High Load is problem 823A - High Load, the author is MikeMirzayanov;
• Problem 827C - DNA Evolution is problem 823B - DNA Evolution, the authors are MikeMirzayanov and me;
• Problem 827E - Rusty String is problem 823D - Rusty String, the authors are gritukan and demon1999;
• Problem 827F - Dirty Arkady's Kitchen is problem 823G - Dirty Arkady's Kitchen, the authors are demon1999 and gritukan.

The souvenirs winners are:

Congratulations!

Today, on July 9, 2017 the VK Cup 2017 Finals is being hold in Saint Petersburg!

Just to remind you, the total prize fund is 2490368 rubles, 20 teams consisting of 39 contestants in total will fight for it. Past years champions are tourist and niyaznigmatul in 2015, and tourist and subscriber in 2016. Who is going to take the first place today?

You can watch live results of the competition here, the start is at 08:05 UTC.

Good luck to all contestants and fans!

Final standings

UPD: Hooray! The results of the final competition were summed up. Congratulations to the winners!

1. ershov.stanislav, aid,
2. V--o_o--V, LHiC,
3. enot110, I_love_Tanya_Romanova,
4. zemen, Zlobober,
5. nikgaevoy, gnomina007,
6. RomaWhite, witua,
7. Trumen, felix,
8. Rubanenko, MrDindows,
9. Tima, AKim,
10. Golovanov399, I_hate_ACM,
11. Goofy57, Shapo,
12. ztk, ballon,
13. Nobik_Glem, Omelianenko,
14. Seemann, george..s,
15. Temirulan, aidos.nurmash.
16. EvErka, greencis,
17. IlyaLos, extraVirgin20,
18. YakutovDmitriy, BudAlNik,
19. Lilith, Copymaster,
20. SergeiFedorov.

Hello everyone!

This Sunday July 2, 19:05 MSK rated Codeforces Round #422 (Div. 2) will be held.

This time I'm the only one author in contradistinction to the Round 415. Many thanks to coordinator Alex netman Vistyazh for help in preparations of the round, Vladislav winger Isenbaev, Alex AlexFetisov Fetisov, Nikolay KAN Kalinin and Ildar gainullin.ildar Gainullin for testing the problems and also to Mike MikeMirzayanov Mirzayanov for Codeforces and Polygon platforms.

As in the Round 415, the main characters of the tasks will be the stunning girl Noora and hacker Leha.

Participants will be given six problems and two hours to solve them. As always, participants from the first division can take part out of competition. Scoring will be announced before the round.

I hope you'll enjoy my round. I wish everyone good luck and high rating!

UPD1: Note that the number of tasks which would be proposed for the solution has been changed.

UPD2: The scoring for this round is: 500 — 750 — 1250 — 1750 — 2250 — 2500.

UPD3: Congratulations to the winners! Editorial will be posted soon.

Div. 2:

1. Nisiyama_Suzune

2. cephian

3. Cherish

4. Irina_Rog

5. ColdSu

Div. 1:

1. natsugiri

2. Um_nik

3. KrK

4. irkstepanov

5. _Reborn_

Special congratulations to natsugiri, who is the only one among all the participants who coped with all six tasks!

UPD4: Editorial.

Hello Codeforces!

On June 29, 18:05 MSK Educational Codeforces Round 24 will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

The round will be unrated for all users and will be held on extented ACM ICPC rules. After the end of the contest you will have one day to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 7 problems and 2 hours 15 minutes to solve them.

The problems were prepared by Mikhail PikMike Piklyaev, Alexey Perforator Ripinen and me.

Good luck to all participants!

I also have a message from Harbour.Space University about the ML course held at the university:

Nowadays machine learning technologies are widely used in practice in various applied fields such as retail, mass media, PR and marketing, banking, telecommunications, manufacturing, science and many other areas.

We are pleased to announce our Industrial Machine Learning course, aimed to teach the structure and the life cycle of the machine learning process and covers topics ranging from the problem statement to final quality assessment as well as estimation of the economic effect.

This course is taught by two Data Scientists from Yandex, Emeli Dral and Victor Kantor. Emeli Dral is the Head of Predictive Analysis, whereas Victor Kantor is the Head of User Behaviour Analysis Group at Yandex.

http://in.harbour.space/data-science/industrial-machine-learning/

They share with us their knowledge on everything from the most promising applications of data science today to applying the latest advancements in machine learning to your work.

UPD: The editorial can be found here.

During the discussion after the Round 421 it turned out that the author's solution was wrong. Yes, we had several testers, we had a bruteforce solution that worked correctly, we had a stress testing between the bruteforce and the main solutions. However, all these measures haven't prevented the mistake: the testers haven't noted the issue, the stress haven't found any counter-tests. The solutions also produced the same answers all small tests we had in the testset, so we only found the issue when a test used for a hack was added.

We are terribly sorry about the mistake. We did our best to ensure the problems are ok, I don't know any available method that we haven't used to check the problem.

We've spent the last few hours trying to come up with a new, correct solution to the problem, but right now I don't see any solution that seems undoubtedly correct to me. There are a few that work better than the author's, but yet unproved, you can try to prove this one, for example. I think this problem should be solvable with careful case analysis, and I'm trying to do this right now. I'll post the results here. I'd also be glad if someone post the solution with proof.

Thus, I apologize that the round should be declared unrated. Hope for your understanding.