Hi everyone!

The rated Codeforces Round #571 (Div. 2) will take place on Jun/28/2019 11:20 (Moscow time). This round is based on the Kremenchuk Summer Programming Cup 2019.

The contest is prepared by Dalgerok, Karasick, stanislav.bezkorovainyi, antontrygubO_o, danya.smelskiy, and me.

You will have 2 hours and 15 minutes to solve 6 problems.

Good luck!

We apologize for the issue that happened with the problem B. The round is unrated. If you want to read my emotional reply about it, please read this.

<almost-copy-pasted-part>

Hello! Codeforces Round 570 (Div. 3) will start at Jun/26/2019 17:35 (Moscow time). You will be offered 6 or 7 problems (or 8) with expected difficulties to compose an interesting competition for participants with ratings up to 1600. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.

You will be given 6 or 7 (or 8) problems and 2 hours to solve them.

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participants of the third division, you must:

• take part in at least two rated rounds (and solve at least one problem in each of them),
• do not have a point of 1900 or higher in the rating.

Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of my work. Thanks to my good friends Mikhail awoo Piklyaev, Maksim Neon Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round.

Good luck!

I also would like to say that participants who will submit wrong solutions on purpose and hack them afterwards (example) will not be shown in the hacking leaders table.

</almost-copy-pasted-part>

UPD: I also would like to thank Ashishgup and kocko for help with round preparation and testing!

UPD2: The contest will be extended for 15 minutes because the problems are more interesting than we thought. We also advise to read all the problems because some of them may have the same difficulty and we cannot know which one will be easier for you than the other.

UPD3: Editorial is published!

UPD4:

Congratulations to the winners:

Congratulations to the best hackers:

And finally people who were the first to solve each problem:

We are happy to announce that Moscow Workshops ICPC opens remote participation for division A in the Discover Vladivostok 2019 Programming Workshop.

Participants will receive a single login for a team of one, two or three people and will be able to choose a convenient time for solving problems. Participants of both full-time and distance training programs will do the final contest simultaneously. Analysis of all problems will also be available for remote participation students.

Among the trainers will be Filipp DPR-pavlin Rukhovich, co-coach of the bronze medalist MIPT team at the ICPC World Finals 2019; former ICPC finalist, present Head of Programming Committee in Grodno and Vladivostok's Workshops and in the Open Moscow Trainings; Ilya izban Zban, ICPC 2017 World Champion!

Remote participation is a unique opportunity to join the world of competitive programming when one could not manage to travel far.

While registering, please make a note in the note field that you would like to participate remotely. Here is the registration link

Remember that citizens of 18 countries have prerogative to get a free E-visa for 8 days to Vladivostok. Search here for the details

Hi, Codeforces!

We are glad to invite you to take part in Codeforces Round 569 (Div. 1) and Codeforces Round 569 (Div. 2), which will be held on Friday, June 21, 2019, at 19:35. The round will be rated for all participants from both divisions.

Problems for the round have been proposed by Ivan ScreaMood Fedorov, Kyrill kirillbogatiy Bessonov, Mukhammadjon Mr.Hakimov Hakimov, Fedor ---------- Ushakov, Fedor Kuyan Kuyanov, and me, Dmitry gop2024 Grigoryev.

The round have been prepared by us, Dmitry gop2024 Grigoryev, Fedor ---------- Ushakov, Dmitry TheWayISteppedOutTheCar Piskalov and Mukhammadjon Mr.Hakimov Hakimov.

We'd like to give thanks to Ildar 300iq Gainullin for excellent coordination of the round, to Sooke Sulfox Gnar, Xiuhan sunset Wang, Ziqian TLE Zhong, Junzhao FizzyDavid Yang, Jiaxuan samjia2000 Gao for testing and to Mike MikeMirzayanov Mirzayanov as well for his unbelievable Codeforces and Polygon platforms!

Participants in each division will be offered 5 problems and 2 hours to solve them. During the round, you will be helping pupils of one usual Moscow school. Score distribution will be announced, traditionally, closer to the start of the contest

Good luck!

UPD Score distribution for Div.2 is standart — 500-1000-1500-2000-2500

Score distribution for Div.1 — 500-1000-1500-1750-2250

UPD2

Thank you for your participation in the contest!

List of the winners of the contest:

Div.2

1. PSMaoTheKingOfAzerbaijan

2. atacan

3. Shayan.Kashefi_A

4. LiPro

5. BrutBurger

Div.1

1. Radewoosh

2. ACRush

3. ecnerwala

4. mango_lassi

5. neal

My frank congratulations to all the winners!

The editorial

Hi!

Tomorrow will take place All-Russian olympiad for students of 5-8 grades, in the name of Keldysh. Good luck to all the participants! Olympiad is conducted under the guidance of the Moscow Olympiad Scientific Committee, in particular GlebsHP, ch_egor, Endagorion, vintage_Vlad_Makeev, Zlobober, meshanya, cdkrot and, of course, Helen Andreeva.

We are happy to announce the codeforces round based on the problems of this olympiad! It will be a Div. 2 round, which will take place at Jun/16/2019 12:35 (Moscow time). You might have already participated in rounds based on the school olympiads, prepared by Moscow Olympiad Scientific Committee (rounds 327, 342, 345, 376, 401, 433, 441, 466, 469, 507, 516, 541, 545)

The problems of this olympiad were prepared by voidmax, alexey_kuldoshin, ch_egor, budalnik, achulkov2, manoprenko, vintage_Vlad_Makeev, Endagorion.

Thanks KAN for his help in organizing the Codeforces version of this contest and MikeMirzayanov for the Codeforces and Polygon.

Also I would like to thank the Tinkoff company and personally Tatyana Kolinkova for organizing the onsite competition.

Good luck!

Scoring: 500-1000-1500-1750-(2000+750)

upd. Congratulations to winners!

Div. 2:

1. thecodinglizard
2. baIuteshih
3. Cong1500DanPaiXia0
4. Yelan
5. HatsuneMikuo

unofficial Div. 1:

1. Radewoosh
2. isaf27
3. chemthan
4. uwi
5. kmjp

The editorial will be published soon.

upd. the editorial was published.

We glad to announce the first ICPC Alumni event happening in Russia!

ICPC Foundation is currently working on building the ICPC Alumni association across the globe and we're happy to announce our big reunion event to be held at a very special location — ITMO University, St.Petersburg, Russia.

We will be extremely honored to welcome you and your colleagues/classmates on this special day. In addition to this being a fun reunion for local ICPC participants, we will be recognizing the accomplishments of various ICPC volunteers who make the show happen each year!

ICPC Alumni Reunion Dinner will be held on Saturday, July 6th, 2019 at ITMO University (St.Petersburg, Russia) on Birzhevaya line 14-16. There will be a reception that begins at 5pm, with dinner to follow at 6pm. And those who want — may join us for a boat trip following the dinner.

Please be sure to RSVP via this form to secure your place before June 23, 2019:

Register

ICPC Executive Director Bill Poucher will be in attendance, and various other judges, staff, and coaches. We would be honored if you can make it as well, and partake in the festivities.

We are unfortunately unable to welcome all outside guests but have done our best to invite as many ICPC alumni as possible from Russia and Europe. Please feel free to forward this invitation to any other finalists/regional participants that you know to be in the area. You can also send their contact information to [email protected] so that we can add them to the invitation list if you'd prefer.

If you have any photos of your time as an ICPC contestant, coach or volunteer that you would like to be shown at the event added to the ICPC History Archives and/or shared over ICPCNews, please share it with us!

We’re looking forward to enjoying a fun reunion and celebration of all things ICPC!

안녕하세요, 코드포스! (Hello, Codeforces!)

I'm super happy to introduce you to Codeforces Round #566 (Div. 2), which will take place on Jun/11/2019 16:05 (Moscow time).

The round will be rated for all Division 2 participants, yet any Division 1 participants are welcome to join us out of competition.

You will be given 6 problems and 2 hours to solve them. Score distribution will be announced later.

The listed handles below are contributors. Thank you for all who listed!

• Problem idea: McDic (ABDEF), arsijo (C)
• Problem preparation: McDic
• Coordinator: arsijo
• Testers: Lawali , final_child , Dr_Park , pllk , Aleks5d , antoshkin
• Father of Codeforces and Polygon: MikeMirzayanov

This is my first Codeforces contest ever. I hope everyone who will join this contest enjoy. Thank you!

WINNERS:

1. Castor
2. thecodinglizard
3. puyu_liao
4. UoA_Kanade
5. abandonedw1
6. average_frog_enjoyer
7. orz_liuwei
8. emengdeath
9. ashutosh450
10. hyfzbtrs

UPDATES:

1. Let me spread the meme from McDic Minecraft Telegram group — Ggungah.
2. Score distribution is 500-750-1250-2000-2250-2750.
3. Editorial is available.
4. Congratulations for the winners!
5. I am sorry for weak systests for B and F. Sorry again.

<almost-copy-pasted-part>

Hello! Codeforces Round 565 (Div. 3) will start at Jun/09/2019 17:35 (Moscow time). You will be offered 6 or 7 problems (or 8) with expected difficulties to compose an interesting competition for participants with ratings up to 1600. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.

You will be given 6 or 7 (or 8) problems and 2 hours to solve them.

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participants of the third division, you must:

• take part in at least two rated rounds (and solve at least one problem in each of them),
• do not have a point of 1900 or higher in the rating.

Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of my work. Thanks to my good friends Mikhail awoo Piklyaev, Maksim Neon Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round.

Good luck!

I also would like to say that participants who will submit wrong solutions on purpose and hack them afterwards (example) will not be shown in the hacking leaders table.

</almost-copy-pasted-part>

UPD1: Big thanks to Um_nik, Rudy1444, nigus, _overrated_ and Temotoloraia for testing the round! And also big thanks to my dear friends Ivan BledDest Androsov, Roman Roms Glazov and Mikhail awoo Piklyaev for help with round preparation!

UPD2: Editorial is published!

UPD3:

Congratulations to the winners:

Congratulations to the best hackers:

And finally people who were the first to solve each problem: