Hola, Codeforces!

We are pleased to invite you to participate in Codeforces Round 936 (Div. 2), which will start on Mar/22/2024 17:35 (Moscow time).

The round was prepared by exhausted, max0000561, azureglow and myself.

This round will be rated for participants whose rating is below 2100. Participants with higher ratings may participate out of the competition.

You will be given 6 problems and 2 hours to solve them. We hope you find them interesting.

We would like to thank:

• 74TrAkToR for coordinating the round.
• Our testers A_G, teraqqq, green_gold_dog, meowcneil, Noinoiio, sdyakonov, molney, IzhtskiyTimofey, zwezdinv, Nickir, Kihihihi, sergeev.PRO, lerasimus, 127.0.0.1, RomkaRS, makrav, Vash_nick, pskobx, VitalyKo, marzipan, zarubin, lunaTu, moniMono, xalwa, Gmix_Ivan_Zolo_57, Lelyte, KoT_OsKaR, __Foam, DamagedMoss5883, Iron_Fenix, OR_LOVe, Sonya_2009, tmari_sun, tfoppers, kuzyaa.
• MikeMirzayanov for Codeforces and Polygon platforms.

Special thanks to KoT_OsKaR and teraqqq for their help in creating tasks.

Good luck on the round and high rankings to everyone!

Score Distribution: 500−1000−1500−1750−2250−2750.

UPD: The date of the round has been changed to avoid interference with a competition on another platform.

UPD: Editorial

UPD: We plan to host the 2024 Universal Cup Summer Summits in Cancún, Mexico. The event has been scheduled from June 19 to June 23. The detailed schedule, materials, and list of the invited teams will be announced in the future. The 2nd Universal Cup Semifinals will be held on June 23, 2024. The contest will start at 17:00 (UTC +8) and end at 22:00 (UTC +8). Please note that there will be no extra time windows on the semifinals contest — all the teams must start in the only official time window. You may check the event time on your local timezone here: Link. The onsite participants will participate in the semifinals on June 22nd (one day before the online participants)

Hello everyone, we are happy to announce the 2nd Universal Cup Semifinal and the 2024 Universal Cup Summer Summit.

In Season 2, thanks to everyone's support and efforts from our staff, there was a lot of progress compared to Season 1. We have over 3000 teams registered and so far we have scheduled over 30 stages in this season. We also managed to implement a registration webpage and host all kinds of contests on our platform, including the run-twice contest, the prime contest and the challenge contest. We also reached many agreements with Huawei about future cooperation, including the most exciting part: the onsite final. (Cooperation between Universal Cup and Huawei)

In the 2024 ICPC Latin American Championship, Universal Cup was invited to run the Huawei Challenge as a major part of the event. Our co-president Jingbang also gave a brief introduction of Universal Cup during the event to all the participants and coaches.

We still have more things coming! We have just finalized the rules for selecting the 2nd Universal Cup Final teams. The 2nd Universal Cup Semifinals will take place online, in order to select teams for the Final Contest. The contest is scheduled on one of the last two weekends of June (June 23 or 30). In addition, we have decided to host a special event, the 2024 Universal Cup Summer Summit in June. Supported by Huawei, we plan on inviting 10 teams to the wonderful city of Cancun, Mexico. The event will last around 5 days, including an onsite competition using the semi-final contest, a city tour, and some other activities. All fees will be covered by us. The exact schedule will be announced soon.

We want to express our gratitude again to everyone, especially problem-setters who have shared their wonderful contests with us. We are also planning to design souvenirs and prizes which will go to our contributors and participants, so stay tuned!

Here are the rules for the semifinal and the summer summit.

Universal Cup

2024.3.19

Pay attention to the unusual round start time.

Hello, Codeforces!

Codeforces Round 935 (Div. 3) will start at Mar/19/2024 11:05 (Moscow time). The problems are expected 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 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 8 problems and 2 hours and 15 minutes to solve them.

Note that the penalty for the wrong submission in this round 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.

The problems are based on VKOSP.Junior. Authors: Kirill_Maglysh, NToneE, Gadget.

We would like to thank:

1. Vladosiya for coordinating the round.

2. nigus, Gheal, KKT_89, Noinoiio, systy, FBI, SiERic, moonpie24, nik.danilov, SashaT9, Pa_sha, FedShat, an_na, khaser, Ghevar, Boris_Ber, PUFL, blook, yakuri354, iluminat_Btopou_AkkayHT for testing.

3. gurovic for improving the quality of the statements.

4. MikeMirzayanov for Polygon and Codeforces platforms.

Всем удачи!

UPD: Editorial is out

Hello Codech....err i mean Codeforces!

I invite you to participate in Codeforces Round 934 (Div. 1) and Codeforces Round 934 (Div. 2) which will start on Mar/16/2024 17:35 (Moscow time).

You will be given 6 problems and 2 hours 15 minutes to solve them in both divisions. Division 1 has $$$\textbf{2 subtasks}$$$, and Division 2 has $$$\textbf{1 subtask}$$$.

Joining us on the problem setting panel are:

• Coordinator: Ashley errorgorn Khoo.

• Authors: Satyam satyam343 Kumar Roy, Aditya Everule Jain, Shreyan Dominater069 Ray.

• Russian Translation: Alexey Alexdat2000 Datskovskiy.

• Red Testers: Kostia kostia244 Savchuk, Jeroen jeroenodb Op De Beek, Andrei andrei_boaca Boaca, Luan LipArcanjo Arcanjo, Fernando ffao Fonseca, Alexander teraqqq Babin, Aleksei Vercingetorix Esin, Zixuan RDDCCD Yan, Aws Kaitokid Issa, hyforces.

• Yellow Testers: Naveen evenvalue Kulkarni, Kaio MvKaio Vieira, pavement, penguin133, zengminghao, Irmuun Irmuun.Ch Chinbat, Jared golions Goff, James jamessngg Sng, Sergey Kniaz Kniazevskiy, Chien-Yi -1e11 Chien, camc, Hriday the_hyp0cr1t3 G, Aryan aryan12 Maskara, Thomas oursaco, Weobe, Leonardo defnotmee Valente Nascimento.

• Purple Testers: Milind milind0110 Gupta, straw berr y.

• Blue Testers: Matthew chromate00 Roh, Ahmad Ahmad45123 Elwasefi, Kirill Sk0rlupka Kobets, Ivan peshkoff Peshkov, Yi Xiang Tyx2019 Tey, June cjc Chen, Kirill AbsurdMan Petrov, ExpensiveAC, Elyes ElyesChaabouni Chaabouni, Ianlsam, Non-origination, nsqrtlog

• Cyan Testers: Vyacheslav Kirito.LVL99 Komarov, Harsh Codula Sharma.

• Gray Testers: Sergey ansergeyg An.

• Negative Rated Testers: Cozma tibinyte Tiberiu-Stefan.

I would like to thank MikeMirzayanov for platforms Codeforces and Polygon.

Please do read a few problems in advance at the very least. Especially with all the subtasks, it is strictly in your benefit to read and choose the problems you want to try. Good luck. We hope you enjoy the problemset.

Score Distribution will be posted soon.

$$$\textbf{UPD}$$$ : Score Distribution :
Div2 : 500 + 1000 + 1500 + 2250 + 2250 + (2250 + 2750).
Div1 : 500 + 1250 + 1250 + (1250 + 2000) + (2000 + 1500) + 4500.

$$$\textbf{UPD2}$$$ : Sorry for the issue with the queue towards the end. Hope you enjoyed the round.

$$$\textbf{UPD3}$$$ :
Div2 :
1) WanYuanShenWanDe
2) tzc___________________wk
3) kcodex
4) mily
5) Oinng123

Div1 :
1) tourist
2) jiangly
3) gyh20
4) Benq
5) ecnerwala

$$$\textbf{UPD4}$$$ : Editorial is out.

Hello Codeforces!

We are pleased to announce a new long-term partnership between Codeforces and Neapolis University Pafos. Now educational rounds will be supported by Neapolis University Pafos. Stay tuned and you will find out more soon.

On Mar/15/2024 17:35 (Moscow time) Educational Codeforces Round 163 (Rated for Div. 2) will start.

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, Ivan BledDest Androsov, Maksim Neon Mescheryakov, Roman Roms Glazov and me. Also, huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Big thanks to the testers shnirelman and Optoed for their valuable advice and suggestions! Special thanks to Vladosiya for his help with the round.

Good luck to all the participants!

UPD: Unfortunately, there were issues with the problem E judgement during the contest. There were only 18 participants affected by it, so the round stays rated. Rated participants whose verdict on problem E changed may request unrated participation (they have received the directions on how to change their participation to unrated). If you have not received any personal notifications about it in the contest dashboard, you have not been affected.

UPD2: Editorial is out

Hello, Codeforces!

On Mar/11/2024 17:35 (Moscow time) Codeforces Round 933 (Div. 3) will start.

You will be offered 7 problems, dedicated to the adventures of a restless mathematician, a programmer and just a funny character named Rudolf and his brother Bernard, and 2 hours 15 minutes to solve them. Problems have 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 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.

Note that the penalty for the wrong submission in this round is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. 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.

Problems have been created and written by: vladmart, Sasha0738, t0rtik, Alexey_Parsh, Mordvin13, daha.002, Vladosiya and natalina.

We would like to thank:

1. Vladosiya and Gornak40 for coordinating the round.

2. MikeMirzayanov for Polygon and Codeforces platforms and helping prepare the problems.

3. step_by_step, ashmelev for red testing.

4. KseniaShk, senjougaharin for yellow testing.

5. robotolev, Sochu for purple testing.

6. dan_dolmatov, SashaT9, FBI, SpicyOctopus for blue testing.

7. Gargera0, Matrosk1n, Alex_TULGU, Alenochka, gas for cyan testing.

8. bugrova, Toy_mouse, ringku_ for green testing.

Good luck!

UPD: Because of the technical issue (see the post https://codeforces.net/blog/entry/126654), temporarily the only available C++ compilers are: C++14 (GCC 6-32) and C++17 (GCC 7-32).

UPD2: Editorial is posted.

Hi everybody,

In a few days there will be a Moscow Open Olympiad. This olympiad is prepared by Moscow Olympiad Scientific Committee that you may know by Moscow Olympiad in Programming, Moscow Team Olympiad, and Megapolis Olympiad (rounds 327, 342, 345, 376, 401, 433, 441, 466, 469, 507, 516, 541, 545, 567, 583, 594, 622, 626, 657, 680, 704, 707, 727, 751, 775, 802, 829, 852).

The Open Olympiad consists of the most interesting and difficult problems proposed by our authors' team. Therefore, we decided to conduct a non-rating mirror of the Olympiad on Codeforces. The Olympiad takes place in two rounds, each consisting of $$$4$$$ problems, not ordered by difficulty, and $$$5$$$ hours to solve them. The difficulty of the problems is comparable to the level of Div. 1. Each problem is worth $$$100$$$ points that are distributed into multiple subtasks with different constraints that allow the participant to earn partial score. Testing is done in the IOI format, where the participant receives a full testing report on all tests in the Online-subtasks during the competition. The feature of the Open Olympiad is that some problems have Offline-subtasks, the results of which will only be available after the end of the competition. Note, that you will not have access to the scoreboard during the competition.

The competition problems were created and prepared by Mangooste, vaaven, Tikhon228, ViktorSM, isaf27, TheEvilBird, sevlll777, Papaz239 и pakhomovee guided by Ormlis, grphil and Helen Andreeva.

The mirror on Codeforces will take place in Mar/08/2024 12:05 (Moscow time) and Mar/09/2024 12:05 (Moscow time).

Special thanks to MikeMirzayanov for the codeforces and polygon systems, which were used in preparing the problems for this Olympiad.

Many thanks to the Olympiad testers: dshindov, FelixDzerzhinsky, Adikolon, isaf27, adepteXiao, talant, AgafonovArtem, Dart-Xeyter, inhabitant, Kapt, Siberian, alexashkins, alexxela12345, Sweezy, v0s7er, MOHOXPOM, Titoffifee.

Good luck!

UPD1: The solutions were tested on offline-groups. The scoreboard for the first day is also available.

UPD2: The solutions were tested on offline-groups. The scoreboard for the second day is also available.

UPD3: Combined scoreboard

Hello, Codeforces! 😇

We are glad to invite you to participate in Codeforces Round 932 (Div. 2), which will take place at Mar/05/2024 17:35 (Moscow time) 🔥 😱 🤩

The round has been fully prepared by students of the School CPM 💓 (School of the Pedagogical Skills Center): IzhtskiyTimofey, AndreyPavlov, and myself. The theme of all the problems will be our beloved school 😈

This round will be rated for participants with a rating below 2100 😊 Participants with a higher rating can take part out of competition 😋

We would like to thank 💕:

• Our wonderful coordinator Artyom123 for helping prepare the problems and valuable advice! 😍

• CPM students azureglow and max0000561 for proposing problems 😎

• Our teacher grphil for nurturing young talents 💋

• TheEvilBird and NToneE for creating wonderful contests for the superhard group 🤮

• Geothermal for detailed feedback on the problems and improving the quality of the statements in English 💘

• Our testers A_G, SomethingNew, induk_v_tsiane, zwezdinv, k1sara, meowcneil, antonis.white, maomao90, MOHOXPOM, qualdoom, makrav, sergeev.PRO, Kihihihi, DimonKrutoi, htetgm, tiom4eg, Mikhango, MrEssiorx, adepteXiao, YakovLya, sunsh1ne, AVdovin, Egorsa, mishgun, dasha..zhilina, marzipan, kaido, jgjgjjg, mkshh, Makarchik_228, Nikitun for suggestions to improve the problems 😘

• MikeMirzayanov and the entire Codeforces team for creating the wonderful platforms Codeforces and Polygon 💖 💙 💚 💛

You will be offered 6 problems and 2 hours to solve them! We tried to make interesting, beautiful, NP-complete problems with strong pretests 😁

Score distribution: $$$500 - 1000 - 1500 - 1750 - 2500 - 3000$$$ ✨

We wish everyone good luck in the round, and we would also like to wish good luck to the participants of the upcoming Open Olympiad in Informatics and ROI! 🥇

UPD: Editorial

UPD 2: Congratulations to the winners!

Div. 2:

1. Sakura_lenlen

2. keeping_practicing

3. INeedCarb

4. LJL_T

5. yyyz04

Div. 1:

1. tourist

2. jiangly

3. BurnedChicken

4. m_99

5. Sugar_fan

We apologize for the disbalance in our problemset. However, we hope these problem fun and interesting!

Hi,

We would like to invite you to participate in the live online mirror contest of The 2024 ICPC Asia Pacific Championship next weekend. ICPC Asia Pacific Championship is a new playoff round introduced to the Asia Pacific region this year. It is the contest for top non-winning teams from all regional contests in the region to qualify to the World Finals. See the region rules and competition page for more details.

The official contest is scheduled to start at Saturday, 2 March 2024, 9am (UTC+7). The live online mirror contest is scheduled to start only 5 minutes later, to keep both contests run almost in sync. The contest is 5 hours long and consists of several problems.

Please note that we might have to postpone the live online mirror contest in case the official contest is delayed. This is to the ensure that the tasks are not available to the public until the official contest starts. The official contest will be livestreamed here and the scoreboard can be accessed here.

The contest will use ICPC-style scoring (same as the official contest) and will be unrated. You can participate as an individual or as a team, although as a team of three members is preferred.

See you on top of the leaderboard.

The 2024 ICPC Asia Pacific Championship Judges

UPD1: The official contest is postponed by (at least) 30 minutes, so the mirror contest is postponed similarly.

UPD2: The official contest is postponed by 20 minutes (instead of the originally announced 30 minutes) after its original schedule, but the mirror contest is still scheduled to start 30 minutes after its original schedule to avoid more confusion.

UPD3: The analysis is available here