Hi Codeforces,

We're excited to invite you to Codeforces Round #809 (Div. 2), which will take place at Jul/18/2022 17:35 (Moscow time). All problems were created and prepared by lunchbox, lce4113, and me. It will be rated for all participants with ratings lower than 2100.

Thanks to the people that made this round possible:

• IgorI for coordinating the round, patiently guiding us through the preparation process, and translating all statements to Russian.
• KAN, for guiding and assisting IgorI in the coordination.
• Apple_Method, izhang, lethan3, moo., null_awe, and ezraft for proposing problems that didn't make it to the final version of the round.
• PurpleCrayon for feedback and suggestions in the early stages of the round.
• Our testers, for their time and feedback: EnDeRBeaT, 0mniking, AlperenT, FairyWinx, ak2006, TheScrasse, sus, SirPh, litesam, asrinivasan007, Igorbunov, Runtime-Terr0r, timreizin, and Aaeria.
• MikeMirzayanov for the excellent platforms Codeforces and Polygon.

You will be given 2 hours to solve 5 problems, one of which will be divided into 2 subtasks. The scoring distribution will be announced later.

UPD: The scoring distribution will be $$$500 - 1000 - 1250 - (1000 + 1250) - 2250$$$.

UPD2: The editorial has been posted at https://codeforces.cc/blog/entry/105008.

UPD3: Winners

Official

1. WYZFL
2. c8k
3. tiger1926
4. b6e0
5. iztrax

Everyone

1. tourist
2. SSRS_
3. WYZFL
4. Rubikun
5. noimi

Hello, Codeforces!

Imakf and I are glad to invite you to Codeforces Round #808 (Div. 1) and Codeforces Round #808 (Div. 2), which will take place on Jul/16/2022 17:35 (Moscow time). In both divisions, you will be given 6 problems and 2 hours to solve them all.

We would like to thank:

• Monogon for his 1-year cute coordination and very helpful discussion.
• KAN for the great help with round preparation.
• Wolam for his discussing the problems with us, which helps us to find the solution.
• smg23333 for donating his csgo time to test the problems in advance.
• AliShahali1382, SecondThread, wxhtzdy, taran_1407, Retired_cherry, antontrygubO_o, Tlatoani, errorgorn, hg333, kassutta, timreizin, Taday, Qiuly.qwq, dorijanlendvaj, arvindr9, gamegame, EmptySoulist, prabowo, Yakumo_Ran, star_xingchen_c, generic_placeholder_name, 74TrAkToR and Sexpert for testing the round and their invaluable feedbacks.
• MikeMirzayanov for amazing platform Codeforces and Polygon.
• geranazavr555, KAN, myav and unreal.eugene for translating the statements into Russian.

Score distribution will be announced before the round.

Wish you all wouldn't gain negative ratings in this round! (This is theoretically possible XD)

UPD1: Score distribution is

Div 2: $$$500 - 1000 - 1500 - 1750 - 2250 - 3000$$$

Div 1: $$$500 - 750 - 1250 - 1750 - 2500 - 3250$$$

UPD2: Editorial

UPD3: Congratulations to the winners!

Div 1

1. Isonan
2. djq_cpp
3. tourist
4. jiangly
5. Um_nik

Div. 2

1. _WidowMaker_
2. N193r
3. Ayaka_s_Dog
4. PaiGuChicken
5. Absolute_Radiance

Hello Codeforces,

We are glad to invite you to Codeforces Round #807 (Div. 2), which will be held on Jul/15/2022 16:35 (Moscow time). As usual, the round will be rated for participants with ratings lower than 2100, while those who have higher ratings are encouraged to participate unofficially. Please note the unusual start time.

You will be given 6 problems to be solved in 2 hours and 15 minutes. There may or may not be interactive problems, so you are encouraged to prepare in case they do appear by reading this guide.

The round is authored by abc241 and me, while joining us is also inwbearX who contributed significantly to the preparation. This is our first time setting rounds in Codeforces, and it wouldn't be possible if there were no support from the following people.

• errorgorn for fantastic coordination.
• KAN, lackadaisical_lad, geranazavr555, unreal.eugene and MikeMirzayanov for translating the statements into Russian.
• antontrygubO_o, kevinxiehk, mango_lassi, Adam_GS, lackadaisical_lad, Utkarsh.25dec, Zappeko, thanhchauns2, TLP.39, 36champ, jampm, DeMen100ns, Neothehero, and sid. for testing the round.
• MikeMirzayanov for Polygon and Codeforces.

The score distribution is $$$500$$$ — $$$1000$$$ — $$$1250$$$ — $$$1750$$$ — $$$2500$$$ — $$$3000$$$.

We are looking forward to your participation. Good luck and enjoy our round!

Update: the editorial is up!

Update 2: Winners!

Div. 2

1. stemroot
2. ZZenisltt
3. WYZFL
4. H_stove
5. myeeye

Div. 1 + Div. 2

1. tourist
2. SSRS_
3. stemroot
4. Um_nik
5. arvindf232

Hello Codeforces!

SlavicG, flamestorm, MikeMirzayanov and I want to invite you to Codeforces Round #806 (Div. 4).

It starts on Jul/12/2022 17:35 (Moscow time).

The format of the event will be identical to Div. 3 rounds:

• 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: TimDee, Gheal, Max_Calincu, down, _Vanilla_,sandry24, jampm, haochenkang, tibinyte, Etherite.

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

Good Luck!

Update: Editorial

Hello! Codeforces Round #805 (Div. 3) will start at Jul/10/2022 17:35 (Moscow time). You will be offered 7-8 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 7-8 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, Vladosiya, Aris, SixtyWithoutExam and me Gol_D.

Also many thanks to turmax, Crescendo, antonis.white, Ronnie007, okwedook, Bugman, Kavaliro, antoshkin, omikad, yorky, Jostic11, Ziware, Kniaz, andrey.starodubtsev, Spaggetti and aniervs for testing the contest and valuable feedback.

Good luck!

UPD: Editorial

Hello Codeforces!

On Jul/08/2022 17:35 (Moscow time) Educational Codeforces Round 131 (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:

Hey, Codeforces!

Welcome to the 131st educational round hosted by Harbour.Space and Codeforces.

Quite exciting, isn’t it? Now it's time for you to dive deeper into the competitive programming world with the 10 days intensive Summer Camp organized by Harbour.Space and Leagues of Code.

Don’t forget about the discounts for participating in our Summer Camp. Every member of the Codeforces community gets a 30% discount for on-site participation or a 50% discount for online participation with promo-code CFLOC2022.

Our Summer Camp is a training program that will teach participants competitive programming. It will take place in Barcelona and online on July 18-29, both participation formats are available.

We are inviting students ages 10 to 24, interested in improving their skills or seeking intensive, high-level training prior to the IOI. Teachers in the camp will be ICPC World Final Silver medalist mhq, SWERC 2022 Winners MaksymOboznyi, ICPC World Final Champion pashka and others. Participants will be divided into classes based on their level and previous experience. Classes will be held in English.

Good luck with the round!

UPD: Editorial is out

The International Olympiad in Informatics 2022 is scheduled to start in a month. To help you prepare today, we announce an online judge with IOI problems. Right here, on codeforces.

Available now

On https://ioi.contest.codeforces.cc/ you can find a contest for each day of each IOI contest since 2002. Participate virtually in a 5-hour contest or simply upsolve problems there! Virtual participants will appear in separate scoreboards for each year as well as in an upsolving scoreboard. Don’t forget to disable coach mode to appear in the upsolving scoreboard.

Future work

We have at least some problem materials for contests since 1998, but IOI has had competitive programming problems since 1994. Even if these problems are not very useful for training, they have significant historical value. Unfortunately, early-year materials on ioinformatics.org are incredibly bad, so if you have something (e.g., solutions, interactor, checkers, library sources), please contact me right away!

I am also considering adding original contest results as ghost participants to the scoreboards.

Let me know in the comments, what else would you like to see in the IOI archive?

How to help?

I'm sure some problems are misconfigured. The most probable errors are tests in wrong subtasks or changes in grader not mentioned in the problem statements. Let’s find them in upsolving mode, to avoid ruining the training process for contestants. If you have solutions (preferably partial solutions), please, become an early tester. Report issues via github repo. Pull requests to problem statements and validators are also always welcome there!

Please, contribute with contest materials for earlier IOI!

If you are a member of an IOI committee, help the project a lot by enforcing a better archival process for the future contests. In particular, it would be great to have as part of the public archive:

• Statements in markdown
• Any kind of non-English statements
• Test data generators and tests generation command lines
• Any description of solutions intended behavior or score
• no new archive format every year :)

Also, you can donate to pavelkunyavskiy.crowdforces.near, to help pay for outsourcing some work, but that’s not necessary.

Special thanks

• MikeMirzayanov and geranazavr555 for implementing a lot of stuff in Codeforces and Polygon
• ligaydima , Dimitrys and especially Masha237 for help converting problem statements to polygon format.
• lperovskaya for maintaining archive on contest.yandex.ru/ioi, which become a great material source, as well as for proofreading this text
• Petr for solutions and other materials of IOI2002 (and IOI2000, and IOI2001 I hope to publish later).
• eduardische for showing me the old IOI site with problem materials, and Martins Opmanis for maintaining it.
• yeputons for original archive resources and idea back in 2011

Hello, Codeforces.

We have exciting news! Look at the logo. See the changes?

Yes, we are happy to announce our new sponsor and partner – the TON Foundation!

We appreciate their support!

The Open Network (TON) is a fully decentralized layer-1 blockchain designed by Telegram to onboard billions of users. The TON Foundation is aimed to further develop and advance the TON Blockchain and its related products for a mass audience.

Andrew Rogozov, founding member at the TON Foundation, says, "We strongly believe in the idea of competitive programming itself, because it is in the TON Blockchain DNA." The TON Blockchain protocol was designed by Nikolai Durov — who is a two-time ICPC world champion, a three-time IMO gold medalist, a multiple IOI medalist, and a co-founder of Telegram — and other winners of international competitions. Now the TON Blockchain core team consists of winners of blockchain contests held by Telegram.

The TON Foundation has already supported the CodeTON Round 1 earlier in March 2022. More than 22K users were registered, and 12K participants made at least one submission. "Codeforces is an unparalleled platform for developing the programming skills of coders all over the world. We are of one mind with the Codeforces team that such contests reveal a treasury full of talents," adds Andrew Rogozov.

I send rays of gratitude to Telegram and personally to Pavel Durov, who has supported our community for many years. With this help we have come a long way — we have run hundreds of rounds, developed the ecosystem, our community has grown hundreds of times. And we are moving forward! Support from the TON Foundation pleases with its succession.

I'm happy to announce that starting July 2022, we have the option to increase problem writer payouts. Hooray!

• Div. 2: $300;
• Div.1 + Div. 2: $600;
• sponsored round: $900.

In addition, we continue to encourage payments in cryptocurrency. In this case, we pay out +25%. I look forward to new rounds on our platform.

— Mike Mirzayanov

Hello, Codeforces! Or, as we like to say in Romania: Noi nu spunem asa ceva, Codeforces!

We are proud to finally invite you to participate in Codeforces Round #804, which will start on Monday, July 4th, 2022, 14:35 UTC You will be given 5 problems and 2 hours to solve them. We greatly recommend to read all the problems, statements are very short and straight to the point.

In this round, the theme is not Independance Day related. I know, maybe we should've made the theme "Freedom", but we are not Americans and the puns within the problems were already written.

Joining me on the problem setting panel are:

• Setters: Gheorghies Gheal Alexandru, Cozma tibinyte Tiberiu-Stefan, Voicu cadmiumky Mihai Valeriu

• Vip-Testers: Um_nik, antontrygubO_o, BlueDiamond, lucaperju, atodo

• Testers: LucaIlie, borgar02, freak93, $$$\,\,\,\,$$$ Ionut_Padurariu, Lemur95, FairyWinx, $$$\,\,\,\,$$$ Brodicico, apostoldaniel854, Kirill22, $$$\,\,\,\,$$$ Olympia, lavish315, Kuroni, $$$\,\,\,\,$$$ caheman, theodor.moroianu, TheScrasse, $$$\,\,\,\,$$$ mhq, VELJAODI, Tudy006, stefdasca, CaesarPP, Fanurie, elizatoma000w, mat50013, IacobTudor, codrincrismariu, Matteo.Verz, mircea_007, amcbn, mihneacazan, armand09

• Coordinator: Artyom123

Also, we would like to thank:

• intrusiv for not deserving to be publicly named
• tibinyte for being a "codechef carry".
• Gheal for getting order #804 at KFC.
• lucaperju and VELJAODI for inviting some of the testers :)
• Artyom123 for captivating coordination, rejecting only Boring tasks. 9 div2Bs to be precise
• antontrygubO_o for improving one of the tasks!
• TON for supporting this round, details can be found in this post.
• MikeMirzayanov for great platforms, Codeforces and Polygon!

Here is the scoring distribution: $$$500 - 1000 - 1500 - 1750 - 2500$$$.

Good luck & have fun & the third part!

UPD1: Editorial is up!

UPD2: Winners!

Div 2:

• First_Brave_Niuniu
• fAKelyh
• ifzw
• H_stove
• Remakee

Div 1:

• SSRS_
• heno239
• jiangly
• MeliodasIRA
• noimi

Hi Codeforces!

ScarletS and I are glad to invite you to Codeforces Round #803 (Div. 2) which will be held on Jun/28/2022 17:35 (Moscow time). The round will be rated for participants with rating lower than 2100. The theme of the round will be déjà vu! (Wait, wasn't that already a theme before?)

Thanks to the people who made this round possible:

• errorgorn, for his fantastic coordination of the round;
• MikeMirzayanov, for creating the amazing Codeforces and Polygon platforms;
• KAN, for translation of the statements into Russian;
• antontrygubO_o, AmShZ, Sexpert, MagentaCobra, AlperenT, satyam_343, Vladithur, polarity-, fishy15, epicxtroll, Surprise_Me, jampm, Yangster, Il9, ak2006, FionnKimberOShea, Codula, and bakekaga for testing the round, catching any mistakes and providing lots of valuable feedback!

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

You will have 135 minutes to work on (and solve!) 7 problems. At most one of the problems will be interactive. Make sure to read this blog and familiarize yourself with these types of problems before the round!

The scoring distribution is $$$250-500-1000-1500-2000-2500-3250$$$.

Good luck, and see you on the scoreboard!

UPD: Editorial is out!