Hello / 你好，Codeforces!

We are really excited to invite you to participate in Codeforces Round 1112 (Div. 1) and Codeforces Round 1112 (Div. 2), which will be held on Jul/26/2026 17:35 (Moscow time).

For both division 1 and division 2, you will be given 2.5 hours to solve 6 problems in each division.

The problems were authored and prepared by aaa_Pigeon2, _MCYYDS_, 131241, Oken, and jhvjh.

We would really like to thank the following people for making this round possible:

• Error_Yuan for the great coordination.
• _istil and ukbwyx for optimizing some details of problems.
• tiger2005, StarSilk for black red testing.
• RockyYue, WangYuanyi, _istil, Portulaca, jason_sun, wangmarui, N_z__ for red testing.
• Watersphere, zac2010, _luqyou_, ukbwyx, cdx123456, Arpa, a_little_cute for orange testing.
• yllls, Fa_Nanf1204 for purple testing.
• 1234567890regis, qym110809, wusixuan for blue testing.
• ini_____ for green testing.
• MikeMirzayanov and KAN for the great Codeforces and Polygon platforms.
• You for participating in this round.

The score distribution is as follows:

• Div. 1: $$$750 - 1250 - 1750 - 2250 - (2250 + 1750) - 3500$$$
• Div. 2: $$$500 - 750 - 1500 - 2000 - 2500 - 3000$$$

Hello Codeforces,

I'm so excited to invite you to participate in Codeforces Round 1111 (Div. 2), which will be held on Jul/18/2026 17:35 (Moscow time)!

You will be given $$$6$$$ problems to solve, one of which will be divided into subtasks. The problems were authored by me, makrav, and PvPro.

The contest was prepared by two IOI 2026 participants from Russia, so you can be sure that the problems are of the highest possible quality.

I would like to thank these people for making the contest possible:

• PvPro for coming up with an enormous number of problems for this round (and having most of them rejected by me).
• nifeshe for outstanding coordination and helping with problem preparation.
• Um_nik for preliminary reviewing the round.
• Intellegent, dinohaur, DizzyGroovy for being the first, second and third coolest testers respectively.
• allvik66, __baozii__, _istil, Wansur, TeaTime, Noobish_Monk for VIP testing.
• The rest of our testers: Mark_Pr, temporary1, Proof_by_QED, Arpa, omsincoconut, shorya1835, Argentum47, simplelife, naneosmic, nik_exists.
• MikeMirzayanov and KAN for the Codeforces and Polygon platforms.
• And You for participating!

The score distribution is as follows: $$$500 \ — \ 750 \ — \ 1250 \ — \ (1500 \ + \ 1250) \ — \ 3000 \ — \ 3500$$$

UPD: Editorial

Congratulations to the winners:

Unofficial participants:

1. potato167

2. peti1234

3. maspy

4. golomb

5. lnsuyn

Official participants: (subject to change)

1. zhenja

2. phantomas

3. AbdullahIshfaq_

4. n685

5. menborong

First solves (subject to change)
A. 00:01:14 by sivi_21
B. 00:03:32 by sevlll777
C. 00:05:38 by AshikeRuet
D1. 00:03:09 by HugeWide
D2. 00:20:32 by potato167
E. 00:29:55 by soumya_ranjan17
F. 00:46:05 by SleeplessSouris

Hello Codeforces!

I am glad to invite you to participate in Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2), which will start on Jul/16/2026 17:45 (Moscow time). You will be given 2 hours and 30 minutes to solve 8 problems, where one problem will be split into subtasks. Also, there is at least one interactive problem, so you are recommended to read the guide to interactive problems if you have not encountered them before.

Note that hacks will be disabled for problems A to D.

All problems are authored and prepared by myself.

Note the rule restricting the use of AI. If you are caught breaking this rule, you will be thrown into SSerxhs's basement. For your own well-being, I suggest adhering to the rules.

I would like to thank the following people for helping make this round possible!

• SSerxhs for his/her satisfactory coordination.
• Alexdat2000 for translating the statements to Russian.
• nifeshe for "I will solve this problem today" — nifeshe.
• StarSilk, EvenImage, tiger2005 for nutella testing.
• zeemanz, 0.1w33hw3, nifeshe, _istil, SATSKY_2025target_LGM for red testing.
• Seele_H, Proof_by_QED, GUAIKATTO, CReatiQ for orange testing.
• -WIDA-, Liang_SYEA, Argentum47, wakanda-forever for purple testing.
• fr200110217102, simplelife, XiaoXia, acmtoohard, big-mktx for blue testing.
• yuki_Ishijo for cyan testing.
• Whalica for green testing.
• MikeMirzayanov and KAN for the incredible Codeforces and Polygon platforms.

Score distribution:

update:

Tutorial has been published: tutorial

Now a few words from our sponsor.

🏁The final round of Spectral::Cup 2026 is coming!

This round is special to us. Not only will it conclude our three-round Spectral::Cup tournament, but it will also take place during our company’s birthday month — Spectral::Technologies turned 7 this July 🎉

Round 3 is the final part of our birthday celebration. The rest is in this video 😄

Hello, Codeforces!

Codeforces Round 1109 (Div. 3) will start at Jul/14/2026 17:35 (Moscow time). You will be offered 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 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. After open hacks all accepted solutions will be rejudged on successful hacks.

You will be given 7 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.

Problems have been created and written by itz_pabloo.

We would like to thank:

1. MikeMirzayanov for Polygon and Codeforces platforms.

2. Vladosiya for the excellent coordination.

3. Friendiks and Nickir for their help in preparing the problems.

4. k1r1t0, lewc, FairyWinx, zwezdinv for red testing.

5. Sokol080808, cry, AI-qv4rk, KotlechkovEgor, Fakewave for yellow testing.

6. SapeginIgor, dvb1r, VitaliiV, Gutark, feblokas, _liravel_, kaferius_cf for purple testing.

7. Maria_Chudinova, Yassia, Wileyne, Algolagon, veliak, eyfxrby, sanya37y, opa, Neckt00 for blue testing.

8. misha.arkhipov, s28b_shagabutdinov, Sava_is, nikk128, k_Teleport for cyan testing.

9. sovenok1, HelloFromMars for green testing.

10. mlovbnee for grey testing.

Good luck!

UPD: Editorial is out!

Hello, Codeforces!

We are glad to announce that Codeforces Round 1108 (Div. 2) will take place on Jul/12/2026 17:35 (Moscow time). The round will be rated for participants with rating below $$$2100$$$. You will be offered $$$6$$$ problems, with $$$2$$$ hours and $$$15$$$ minutes to solve them. At least one problem will be interactive, so please make sure to read the guide for interactive problems before the contest.

The problemset was created and prepared by 0mar, countful, diss_quack, farmpiggie, lce4113, Whoname, and me. We are all members of the UCSB ICPC community.

Thank you to the following people who made the round possible:

• Um_nik for pre-review of the round.
• cry for coordination of the round.
• Alexdat2000 for Russian translations of the problem statements.

• Our army of testers: BucketPotato, golomb, _istil, GusterGoose27, __baozii__, Arpa, omsincoconut, DylanSmith, AksLolCoding, spacewalker, Enigmurl, Bruteforcer101, Hori, Argentum47, lrnnz, mtand872, SpyrosAliv, Lance0, Atouts, bakunawa, lems, ColtsFan10, atsliwak, akimuuwu, and conqueror_of_4fecta.

• VIP tester sagbis for solving problem A and nothing else.
• MikeMirzayanov and KAN for the wonderful platforms Codeforces and Polygon.
• You, for your participation.

We hope you will enjoy the round!

Left/Top: ezraft, Whoname, 0mar, lce4113, countful, diss_quack at the ICPC Southern California Regional.

Right/Bottom: diss_quack, ezraft, lce4113, farmpiggie at the ICPC North American Championship.

UPD: The scoring distribution is $$$500-750-1500-1750-2250-2750.$$$

UPD2: Editorial

This weekend concluded the second Midnight Code Cup: 24 hour final round took place in Belgrade on July 4-5.
29 teams competed for the champions title, team members coming to Serbia from 20 different countries.

Credits

The champions: team taxi confidently took the lead and performed strongly throughout the whole round. A close game was played in the rest of the top places up until the end, teams superfight and itmo_1.2017 ended up taking second and third place respectively.

Final results: https://2026.midnightcodecup.org/standings/
Problems: https://2026.midnightcodecup.org/problems/
First Photos (more will be added to the same folder later): Folder
Instagram: https://www.instagram.com/midnightcodecup
X: https://x.com/midnightcodecup

Amazing Jury: Aksenov239, qwerty787788, tourist, nsychev, cdkrot, naagi, Gassa, Arpa, pashka, yulik.daniel, xiaowuc1, isaf27, mnaeraxr, aropan, Solenoid555, NALP, SergeyMelnikov.

Wonderful Sponsors: Recraft, Nebius, OpenAI, Alber Blanc, Revolut, Logical Intelligence, Joom, Pinely, GPT4Telegram, KINO.Impact.

Contest director: Sofia Tekhazheva
Org support, the coolest: lperovskaya, Karina Tinicheva and Recraft Team.

Huge thanks to everyone who helped pre-solve the problems and promote the competition!
Congratulations to the finalists and the winners!

How It Went

As well as a 24-hour contest can go! Finalists reported having lots of fun, which was our goal. Now, to the problems.

Problems

This year the problem set was gradually revealed throughout the contest. It started with problems B, E, F, G, H, K and L. After the first hour, problem A was opened. Then, problems D, E and I were revealed at each following hour. Finally, problem C was added in the evening to relax teams a little bit.

Here’s a short description of each problem:

Hey all, I know it's a late notice, but we're doing a live-from-Japan-10-hour-long-AWTF-heuristic-finals-commentary that starts in around 25 minutes form now.

AFAIK, this will be the first time when heuristic finals will be commentated live, which technically means this will be the most professional livestream from heuristic finals as well!

Link to YT livestream: https://www.youtube.com/live/R9DAkDF5gIs

Link to a FAQ: https://x.com/FakePsyho/status/2074534053081223525

If you need a summary of day 1, just go over my twitter posts.

Hello Codeforces!

The series of Educational Rounds continues thanks to the support of the Neapolis University Pafos. They offer a BSc in Computer Science and AI with JetBrains Scholarships. Gain cutting-edge skills in AI and machine learning, preparing you for high-demand tech careers. Limited scholarships available — don't miss your chance to study in Europe for free!

Educational Codeforces Round 192 (Rated for Div. 2) will start on Jul/06/2026 17:35 (Moscow time).

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 problems and 2 hours to solve them.

The problems were proposed and prepared by Maxim FelixArg Novotochinov, Adilbek adedalic Dalabaev, Roman Roms Glazov and me. We would like to express our gratitude to MikeMirzayanov for creating Codeforces and Polygon — without them, these rounds would not be possible.

Also, big shoutout to the round testers: shnirelman, Brovko, awoo, Alenochka, paomur. Thank you for helping us prepare the contest!

We wish you good luck in the contest!

UPD Congratulation to our winners!

1. taxi with 14304.84 points! jacobtpl, frodakcin, thomas0115
2. superfight: 12062.47 -XraY-, Maksim1744, scanhex
3. itmo_1.2017: 11970.62 izban, Belonogov, enot110

The Midnight Code Cup final round is happening this weekend, 4-5 of July in Belgrade, Serbia.

Over 500 teams from all over the world competed for the spot on the finals. Top 25 + wildcards will meet in less then a week to determine the Midnight Champion. The contest will last for 24 hours, starting at noon on 4 July, local time. Unlike traditional programming contests, participants are encouraged to use any tools available, including AI assistants, to solve a diverse set of algorithmic, optimization, and engineering problems designed by an international jury that includes ICPC World Champions.

Follow the finals on socials:
X
Instagram
Surprise stream:
Chess Grandmaster an Nepomniachtchi ("Nepo") has played against 10 MCC finalists.

Hello Codeforces!!!

I am more than happy to invite you to my first solo round Codeforces Round 1107 (Div. 3), which starts on Jun/30/2026 17:35 (Moscow time). You will be given $$$7$$$ problems and $$$2$$$ hours $$$15$$$ minutes to solve them.

All the problems were authored and prepared by me.

The round will be hosted by the rules of educational rounds (extended ICPC). Thus, all solutions will be judged on preliminary tests during the round, and after the round, there will be a 12-hour phase of open hacks. After the open hack phase, all accepted solutions will be rejudged on successful hacks. Also, note that there is no score distribution — rank will be determined by the number of problems solved, followed by penalty; wrong submissions will incur the usual penalty of 10 minutes, following the rules of educational rounds.

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

I would like to thank the following people for making this round possible:

• cry for his careful coordination.
• Vladosiya for providing Russian translations.
• _istil, Proof_by_QED, simplelife, kevinxiehk, temporary1, reirugan, Jrke, Forge, Intellegent, Argentum47, __baozii__, awesomeguy856, SpyrosAliv, omsincoconut, expertaq, skellyboi05, yse, M.Y., Edeeva, nik_exists, fishy15, madlogic, chromate00, singharpit2492, Arpa, DivinePunishment, Lilypad for testing the round and providing valuable feedback.
• MikeMirzayanov and KAN for the legendary platforms.

Additionally, if you are a tester of Codeforces Round 1095 (Div. 2) and you are rated for Division 3, I would request you not participate in the round, as it is possible you have seen some tasks before.

I would be looking forward to your participation, and I hope you love the problems.

GLHF.

Editorial