Hi Codeforces!

I am pleased to invite you to Codeforces Round #793 (Div. 2), which will take place on 22.05.2022 17:35 (Московское время). You will be given 6 problems and 2 hours to solve them.

The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1 participants can participate unofficially in the round.

All problems in this round were prepared by me and rivalq. We have worked on this round for a long time and hope you find every problem interesting.

I would like to thank:

• antontrygubO_o for marvellous coordination of the round.
• errorgorn, kclee2172, AmShZ, nvmdava, TheScrasse, aryanc403, koderkushy, PurpleCrayon, nor, AlperenT, towrist, ExplodingFreeze, conquered, naresh0839, The_Hawkeye, Siuuuuu_7, GuptaSir, sp005, obliviousz, davidgarg20, competitive__programmer, and the_hyp0cr1t3 for testing this round and giving really valuable feedback.
• MikeMirzayanov for the amazing Codeforces and Polygon platforms!
• You for participating and upvoting.
• NEAR for supporting this round, details can be found in this post.

Score Distribution:

750 – 1000 – 1500 – 2000 – 2500 – 2750

Good luck and have fun! See you in the standings. Make sure to read the statements very carefully.

Thanks to competitive__programmer, video editorials for some of the problems will be available on his channel after the round.

Congratulations to winners!!

Global Top 5:

1. jiangly, superfast AK!

2. Beduardo

3. SSRS_

4. neal

5. turmax

Official Top 5:

1. Beduardo

2. Brewess

3. Kizuna_AI

4. Focalors

5. csyakuoi

Special mention to AwakeAnay for the only Indian to AK the round!

UPD 1: Links to video editorials of Problem B and Problem C

UPD 2: Editorial for problems A-D is here.

UPD 3: Editorial for E is added.

UPD 4: Editorial for F is added.

Hi, Codeforces!

We are glad to invite you to Codeforces Round 792 (Div. 1 + Div. 2) which will take place on May/19/2022 17:35 (Moscow time). You will have 2 hours to solve 8 problems. The round will be rated for participants of both divisions.

I would like to thank those who made this round possible:

• Artyom123 и KAN for coordination and their active help
• gamegame, generic_placeholder_name, kpw29, physics0523, I_love_kirill22, I_love_teraqqq, SecondThread, vsinitsynav, SlavicG, flamestorm, snowysecret, KiruxaLight for testing and providing tons of useful feedback to make the round better
• MikeMirzayanov for such great platforms Codeforces и Polygon

We would also like to thank NEAR for supporting the round. This company is founded by former competitor AlexSkidanov. NEAR is built by many prominent competitive programmers, including twice ICPC champion eatmore and GCJ and TCO winner Egor.

• The participants who end up in the first 255 positions will receive prizes in NEAR coins. The participant on the first place will receive Ⓝ128, the next two participants will receive Ⓝ64, the next four participants will receive Ⓝ32, etc.

Score Distribution:

500 — 750 — 1250 — 1500 — 1750 — 2000 — 2500 — 3250

We really hope that you like the problems! Good luck!

Editorial: link

Hello, Codeforces!

I'm glad to invite you to Round 791 which will start at May/14/2022 12:35 (Moscow time). Please notice the unusual time.

There will be 6 problems in the round. Round is based on Team Olympiad in Lipetsk which is being held for the seventh time. Problems were proposed and prepared by iakovlev.zakhar, Kon567889, iura, andr1y, Masha237, welleyth and me. I would like to thank Aleks5d and KAN for CF round coordination and testers: Um_nik, 353cerega, errorgorn, Stepavly, divanik, nnv-nick, 4qqqq, to be continued...

Of course, I'd like to thank all Codeforces team for Codeforces and Polygon beautiful platforms!

I also would like to thank golikovnik, egneeS, dshindov and Inessa Shuykova (Lipetsk teams' coach) for preparing other Olympiad problems that haven't been taken for this round.

Thanks to NEAR for supporting this round, details can be found in this post.

Note that if you are an official participant of the Olympiad, you are not allowed to participate in this round.

Scoring distribution will be announced later.

Wish you good luck and high rating!

UPD.1 Scoring distribution: $$$500 - 1000 - 1500 - 1750 - 2250 - 3000$$$.

UPD.2 Congratulations to winners!

Official participants:

1. xiaoziyaooo

2. StickyFingers

3. mybing

4. huangweiliang

5. NewPC2022

Unofficial participants:

1. SSRS_

2. leaf1415

3. uwi

4. maspy

5. TripleM5da

UPD.3 Editorial is available here.

Hello Codeforces!

On May/13/2022 17:35 (Moscow time) Educational Codeforces Round 128 (Rated for Div. 2) 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.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

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

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

Our friends at Harbour.Space also have a message for you:

Harbour.Space takes over SWERC by winning gold and silver for the first time in its history and will go to the ICPC World Finals. Congratulations to all of our participants and coaches that made this a reality!

This is a very important moment in Harbour.Space and Codeforces long partnership, with 127 educational rounds being organized and a big Harbour.Space Scholarship Contest held on July 22th. We have selected contest winners (cum00, Meijer and amanbol) to form our current teams.

Since its creation, one of Harbour.Spaces’s goals has been to win SWERC and compete at a high level in the ICPC globally. On April 24th, that objective was accomplished when Harbour.Space’s team RAW POTS (read it backwards!) won the gold medal and the overall contest against Southwestern Europe’s top contenders.

Team Raw Pots — gold medal:

Maksym Oboznyi (MaksymOboznyi), Marco Meijer (Meijer), and Danil Zashikhin (cum00)

Team Kempirqosaq — silver medal:

Temirlan Baibolov (bthero), Dinmukhamed Tursynbay (DimmyT), and Amanbol Kanatuly (amanbol), ranked 4th and won a silver medal.

Team Harbour.Backspace — ranked 27th:

Anier Velasco (aniervs), Fadi Younes, and Ekaterina Podruzhko, ranked 27th.

The faculty, current students, alumni, and everyone involved with Harbour.Space would like to congratulate the winners and participants at SWERC 2021-2022 for their wonderful performance and hard work.

As usual, we are always excited to see Codeforces participants as our students here at Harbour.Space. That’s why we encourage you to apply to our latest apprenticeship program in partnership with Hansgrohe, as a Kotlin Developer until May 31st, 2022.

Harbour.Space University Team

UPD: Editorial is out

Hello Codeforces!

SlavicG, mesanu, MikeMirzayanov, Errichto, and I welcome you to Codeforces Round 790 (Div. 4). It starts on May/10/2022 17:45 (Moscow time).

The format of the event will be the same as before:

• 5-8 tasks;
• ICPC rules with a penalty of 10 minutes for an incorrect submission;
• 12-hour phase of open hacks after the end of the round (hacks do not give additional points)
• after the end of the open hacking phase, all solutions will be tested on the updated set of tests, and the ratings recalculated
• by default, only "trusted" participants are shown in the results table (but the rating will be recalculated for all with initial ratings less than 1400 or you are an unrated participant/newcomer).

We urge participants whose rating is 1400+ not to register new accounts for the purpose of narcissism but to take part unofficially. Please do not spoil the contest for the official participants.

Only trusted participants of the fourth division will be included in the official standings table. This is a forced measure for combating unsporting behavior. To qualify as a trusted participant of the fourth division, you must:

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

Regardless of whether you are a trusted participant of the fourth division or not, if your rating is less than 1400 (or you are a newcomer/unrated), then the round will be rated for you.

Many thanks to the testers: timreizin, magnus.hegdahl, Adam_GS, KrowSavcik, qwexd, pseudocoder10, jampm, Neophiliatic, Codula and of course _Vanilla_.

We suggest reading all of the problems and hope you will find them interesting!

Good luck!

UPD: the start of the round is delayed by 10 minutes.

UPD: Editorial is published!

Hello, Codeforces! ฅ(*`ω´*)ฅ

We are glad to invite you to take part in Codeforces Round 789 (Div. 1) and Codeforces Round 789 (Div. 2), which will be held on May/08/2022 17:35 (Moscow time).

The round will be rated for all participants from both divisions. Participants in each division will be offered 6 problems and 2 hours to solve them. Both divisions will share 4 problems.

The problems were written and prepared by funer, dark_light, FreshP_0325, Frank_DD, qsmcgogo, winterzz1, Sugar_fan, TomiokapEace and me.

Thank to:

• RedMachine-74 for excellent coordination of this round! And translating the statements to Russian.

• KAN for helping us to review and fix some statements.

• TomiokapEace for helping us to translate all the statements and tutorials to English.

• Sugar_fan for giving valuable advice and helping us to fix some statements.

• Elder_Giang, ddytxdy, zwezdinv, zarubin, olyazyryanova, marzipan, MichsSS, playf, TeaTime, gojira, plagues, AlexLuchianov, kpw29, Huah, Yzm007, Duck_sajin, Operation27, Venn, Nephry, Sugar_fan, errorgorn, Um_nik, TadijaSebez, Prokhor74, Grigoreva-Irina, Dragonado, lunaTu and jqdai0815 for testing this round and giving good advice.

• MikeMirzayanov and his Codeforces team for amazing systems Codeforces and Polygon!

• NEAR for supporting this round, details can be found in this post.

Here are some things I personally want to say. This is my second round. Three years have passed since the first round round 573 I held. Now I have graduated and worked. I like codeforces very much. Though I have already participated in work, haven't trained for a long time, my ability has degraded a lot, I will still come to codeforces to participate in the contest in my spare time. This time I also prepared some problems to propose a round, but for some reasons, most of them were rejected. In particular, one of my favorite problems was rejected because "many testers don't like it". I'm a little frustrated, but I also understand that the coordinator's job is to make the round better and more people like this round. I think it's a great honor to prepare round on codeforces and let so many people around the world try to solve the problem I prepared. I will accumulate some more interesting ideas for the next round and try to make more people like the problems I prepared.

I'd like to express my great gratitude to my friends for preparing this round with me, I don't think I can prepare this round alone without them. I really appreciate having the support of my good friends in my round.

In addition, the three naughty cats mentioned in the statement.(*=｀ω´=)ﾉ I understand that I shouldn't post pictures irrelevant to the statement, so I post it here ↓

Finally, I hope you like the problems in this round, good luck and have fun!(≧ω≦)/

The score distribution will soon be published.

UPD1: Although our coordinator allows to post the PDF of Chinese statements in the contest material, it seems that codeforces does not allow it. We are only allowed to post something after the round. So we will still post Chinese tutorials after the round.

UPD2: List of contributors is a bit changed, and the score distribution will be:

• Div.2: 500 — (750 + 1000) — 1250 — 2000 — 2000 — 2750

• Div.1: 500 — 1250 — 1250 — 2000 — 2500 — 3500

UPD3: Note that the score of the last problem of Div.1 has changed, 4000 → 3500.

UPD4: Editorial is out, and Chinese Tutorial will soon be published.

UPD5: Chinese Tutorial is out.

UPD6: Congratulations to the winners!

Div.1:

1. maroonrk

2. tourist

3. eecs

4. ainta

5. duality

Div.2:

1. NiNiV

2. WA_On_Pretest2_Forces

3. ouql

4. KroosTheKeenGlint

5. jialiang250

I'm glad to invite you to Codeforces Round 788 (Div. 2), which will be held on May/06/2022 17:35 (Moscow time).

This round is rated for the participants with rating lower than 2100.

You will be given 6 problems and 2 hours to solve them. All problems were prepared by me, Hemose and ZerooCool.

I would like to thank:

• Monogon, for a lot of things (awesome coordination, helping in preparation, rejecting only not interesting tasks and a lot of useful discussions).

• I_Love_Slim for teaching us BLABIZO useful concepts.

• Our army of testers YahiaSherif, TripleM5da, TheScrasse, Bakry, IsaacMoris, TeaTime, magnus.hegdahl, generic_placeholder_name, NemanjaSo2005, Abdelrahman_Etman, TheSawan, gojira, Priyam2k, Urvuk3, Menna-Allah05, Khater.

• MikeMirzayanov, for the amazing Codeforces and Polygon platforms.

• NEAR for supporting this round, details can be found in this post.

The statements are short and we have tried to make the pretests strong. I encourage you to read all the problems.

For people who don't like stories, you will find all the stories written in italic you can skip them safely.

We are sincerely looking forward to your participation. We hope everyone will enjoy it.

Good luck and see you in the standings!

UPD: The score distribution is 500-1000-1750-2250-2750-3000.

UPD: We hope you liked the problems, here is the Editorial

Hello! Codeforces Round 787 (Div. 3) will start at 05.05.2022 17:35 (Московское время). You will be offered 6-7 problems 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 a rating of 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks.

You will be given 6-7 problems and 2 hours and 15 minutes 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 participant of the third division, you must:

take part in at least five 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 our work. Problems have been created and written by ITMO University teams: MikeMirzayanov, MisterGu, myav, Gol_D, Aris, KwisatzCoderach, me Vladosiya.

Also many thanks to avevad, yorky, UncleSema, vsinitsynav, GoracioNewport, Tvorozh0k, any_nickname, I.AM.THE.WILL and Jostic11 for testing the contest and valuable feedback.

Good luck!

UPD:Editorial

Hello! Codeforces Round 786 (Div. 3) will start at May/02/2022 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.

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.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Alexander fcspartakm Frolov, Ivan BledDest Androsov and Mikhail awoo Piklyaev. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Also huge thanks to ashmelev, Vladosiya, mesanu and I.AM.THE.WILL for testing the round and valuable feedback on the problems!

Good luck!

UPD: Editorial is published!

Hello Codeforces,

I invite you to participate in Codeforces Round 785 (Div. 2) which will be held on 30.04.2022 17:35 (Московское время). The round will be rated for participants of Division 2 with rating strictly less than 2100. But as always, the participants of Division 1 are welcome to take part out of competition.

You will be given 6 problems and 2 hours to solve them. Moreover, there will be atleast $$$1$$$ and atmost $$$1048576$$$ interactive problems. So, you are advised to refer to the guide on interactive problems in case you are not familiar with them.

I would like to thank the following people for their contribution to the round:

• Artyom123 for his amazing coordination, helping me throughout the preparation of the round and translating the statements.
• Um_nik, Monogon, kclee2172, TheScrasse, yash_daga, Sad_reacts_only, AlperenT, Utkarsh.25dec, abhidot, PR_0202, towrist, Rubalien, hritik31, snowysecret, alok_k6618 and harsh2804 for testing the round and providing their feedback.
• MikeMirzayanov for the great Codeforces and Polygon platforms.
• NEAR for supporting this round, details can be found in this post.
• You for participating.

This will be my second Codeforces round and based on the feedback by participants on Round #730, I have implemented the following changes:

• The round will have no theme. I have tried to keep the problem statements as short and to the point as possible.
• The pretests have been made stronger (specifically, more pretests have been included).
• I have tried to keep the samples and their explanation as useful as possible.
• No floating-point precision issues this time.
• The I/O constraints for the interactive problem(s) have been kept low to provide a fair ground to the languages with slower I/O.

The score distribution will be released strictly before the round and the editorial will be released strictly after the round.

Good luck and have fun!

UPD: The score distribution is $$$500-750-1500-2000-2750-3250$$$.

UPD: Editorial

UPD: Congratulations to the winners

Div. 1 + Div. 2 -

1. ksun48
2. I_love_teraqqq
3. JiBaDa
4. Geothermal
5. errorgorn

Div. 2 -

1. JiBaDa
2. A-SOUL_Ava
3. Beduardo
4. happy-potato
5. Moomer

First solves -