Hi, Codeforces!

I have some great news. But maybe you've already noticed? Seen the updated logo?

I'm glad to announce that Telegram is back as our title sponsor. I'm happy, and not just because this means we can keep developing and maintaining the system and (most importantly) running rounds for a long time to come.

But there's something else, too. It was Pavel Durov who, way back in 2010, spent several hours asking questions and trying to understand what I had in mind. Then he put his faith in our community — and Codeforces received support for the very first time. That support helped us for many years. So this means a lot to me personally, and I'm proud that now, more than 16 years after that first conversation, that support is coming back.

This helps with every round we run and gives us a chance to do new things, too. I'm glad to share that thanks to renewed support from Telegram, we've already started moving our infrastructure to a professional data center, making the system faster and more reliable.

I'm sure this won't be the only new thing happening soon. Expect more good news.

Mike

Hello, Codeforces!

We are excited to invite you to participate in Codeforces Round 1120 (Div. 1) and Codeforces Round 1120 (Div. 2) on Sep/12/2026 17:35 (Moscow time).

The round will be rated for participants from both divisions. You will be given 6 problems and 3 hours to solve them. At least one of the problems will be divided into subtasks.

The problems were authored and prepared by me, CutSandstone, and sukon.

We would like to thank:

• abc864197532 for being the coordinator.
• Um_nik for preliminary reviewing the round.
• Alexdat2000 for translating the statements to Russian.
• baluteshih, dlu, kevinyu, MattTheNub, n685, nadya271, yunz_qiao, _istil, alvingogo, avnithv, awoo, BurnedChicken, Fysty, Misuki, passwordisa, pbj2006, snowythecat, WiwiHo, and YuukiS for testing the round and providing valuable feedback.
• KAN and MikeMirzayanov for the great Codeforces and Polygon platforms.
• And finally,

  You

  , for participating!

The scoring distribution is:

1. Div. 1: $$$(500 + 1000)$$$ — $$$1750$$$ — $$$1750$$$ — $$$2500$$$ — $$$3000$$$ — $$$3250$$$
2. Div. 2: $$$500$$$ — $$$1000$$$ — $$$(750 + 1250)$$$ — $$$2250$$$ — $$$2250$$$ — $$$3000$$$

We hope you enjoy the problems.

Good luck and have fun!

UPD:

Congratulations to the winners (subject to change):

Div. 1:

1. Kevin114514
2. XorGhost
3. strapple
4. PiGoat
5. zjy2008

Div. 2 (trusted participants):

1. gausset
2. Dream_Sky
3. Guddu_06
4. Saransh_Gupta_
5. zhudaxia

UPD 2:

Sorry for the late tutorial, its posted now!

Hello Codeforces!

The series of Educational Rounds continues thanks to the support of the Neapolis University Pafos.

Educational Codeforces Round 194 (Rated for Div. 2) will start on Sep/08/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 7 problems and 2 hours to solve them. I hope everyone participating finds interesting problems for them to solve.

I would like to express my gratitude to Mike MikeMirzayanov Mirzayanov for creating Codeforces and Polygon, two platforms which made conducting programming contests and preparing problems for them much more convenient. Also big thanks to testers: awoo, FelixArg, Alenochka.

Our friends at Neapolis University Pafos have a message for you:

Planning to apply for the Computer Science and Artificial Intelligence (CSAI) program at Neapolis University Pafos?

JetBrains Youth Clubs can help you prepare.

🤖 AI Club is a chance to explore one of the core areas you’ll study in the CSAI program. You’ll work with AI topics, strengthen your understanding, and get more experience before university.

➗ Math Club helps you sharpen the mathematical problem-solving skills you’ll need for the program. There’s also a direct application benefit: participation in the Math Club can give you 30% of your entrance test mark for the Computer Science and Artificial Intelligence BSc supported by JetBrains Foundation.

Both clubs are designed for high school students with a strong interest in STEM who want to challenge themselves and prepare for the next step.

👉 Join JetBrains Youth Clubs: AI and Math

Good luck in solving the problems! See you at the contest.

UPD: The editorial has been published.

#include "codeforces.h"
#include <chrono>
#include <vector>

using namespace std;
using namespace std::chrono_literals;
using namespace cf;

int main() {
    Blog announcement("Codeforces Round 1119 (Div. 3)");

    announcement << "Hello Codeforces!\n";
    announcement << "I am delighted to invite you to participate in " << Codeforces Round 1119 (Div. 3) << "!\n";
    announcement << "The problems were written and prepared by " << nik_exists << ".\n\n";

    announcement << ContestInfo {
        .start_time = Sep/05/2026 17:45 (Moscow time),
        .duration = 2h + 15min,
        .number_of_problems = 7,
        .subtasks = true // possibly not adjacent
    };

    announcement << RatingRules {
        .rated_for_rating_below = 1600,
        .unrated_registration_allowed = true,
        .trusted_max_rating_below = 1900,
        .trusted_min_rated_rounds = 5
    };

    announcement << JudgingRules {
        .scoring = codeforces::ICPC,
        .wrong_answer_penalty = 10min,
        .open_hacking_phase = 12h,
        .final_tests = after_open_hacks
    };

    auto is_cheater = [](User user) {
        // https://codeforces.me/blog/entry/133941
        if (user.used_ai_in_contest()) return true;
        if (user.discussed_problems_online_before_contest_end()) return true;
        if (user.violated_other_rules_im_too_lazy_to_list()) return true;
        return false;
    };

    for (auto user : get_users(2259)) {
        if (is_cheater(user)) user.send_to_cry_basement();
    }

    announcement << Acknowledgments {
        .coordinator = cry,
        .russian_translation = Vladosiya,
        .red_testers = {__baozii__, AksLolCoding, awesomeguy856, nifeshe},
        .golden_testers = {Arpa, Intellegent, Proof_by_QED, temporary1},
        .purple_testers = {Argentum47, Euclid73, Jteh, Lilypad, SpyrosAliv, nimoxide, omsincoconut, wakanda-forever, yse},
        .blue_testers = {CatsAreCool, Vladosiya, chromate00, fatespeaker, linearspace, reirugan, simplelife},
        .green_testers = {hannah12345},
        .codeforces_and_polygon = {KAN, MikeMirzayanov}
    };

    announcement << "\nBest of luck, and thank y'all so much for competing!\n";
}

EDITORIAL

Merhaba Codeforces!

We are proud to invite you to Codeforces Round 1118 (Div. 2), which will be held on Aug/29/2026 17:35 (Moscow time).

The round will be rated for participants whose rating is below 2100, but higher rated users are also welcome to participate out of competition. You will be given 6 problems, one of which will be divided into a subtask, and 2 hours to solve them. 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.

The problems were authored by me (ItsNotMeItsYou), carcinisation, mychecksdead and Seferoglu.

This round was prepared by some members of the 2025 and 2026 IOI team of Türkiye, and we hope you enjoy all our problems.

We would like to thank:

• cadmiumky for his outstanding coordination of the round,

• Um_nik for the preliminary review,

• Alexdat2000 for Russian translations,

• MikeMirzayanov and KAN for Codeforces and Polygon,

• Our testers: destructive_criticism, tolbi, dinohaur, anpaio, kalimm, nifeshe, https, kafamcokkaristi, FatihCihan, LucaLucaM, PieArmy, int23_t, temporary1, robert9524, Kel_Mahmut, dead0ne, kawasaki, Synd209, elotelo, Anfeco,

• anpaio for improving at least one problem,

• destructive_criticism and dinohaur for at least one unused suggestion,

• You for participating in the round.

Score distribution: $$$500-(750+1000)-1250-2000-2250-3000$$$

Good luck & have fun!

UPD: The editorial is out! Sorry for underestimating the difficulties of the problems, especially B2 and D. We tried to serve as many cool problems as we could. And apparently, this led to some difficult ones.

Congratulations to the winners:

Official participants (subjects to change):

• xl123
• BTinn
• asterunee
• Alexander_0918
• no-girlfriend

Unofficial participants (subjects to change):

• xl123
• PiGoat
• BTinn
• maspy
• asterunee

Hello, Codeforces!

We are happy to invite you to an exciting online event: ICPC Online Challenge powered by Huawei.

This Challenge features the problem

Scheduling Algorithm for Collaborative Inference System With the rapid advancement of artificial intelligence, large language model (LLM) services are becoming increasingly integrated into people’s daily lives and work. At the same time, the economic efficiency and data security of these services are receiving greater attention.

Edge-Cloud Collaborative Inference has emerged as a promising approach to addressing these challenges. In this architecture, LLM inference is divided between a user’s on-premises edge environment and the cloud. Using a U-shaped split, the first and last layers of the model run on the edge, while the computationally intensive middle layers run in the cloud. This allows private inputs and outputs to remain on the user’s side while cloud resources are used for the heavier computation.

However, this architecture requires repeated interaction between the edge and the cloud during both the prefill and decoding stages. When requests are processed sequentially, these interactions can create “bubbles”—periods in which computing resources remain idle while waiting for other parts of the system.

Your challenge is to design a concurrent scheduling strategy that:

• maximizes overall system throughput; and
• ensures that every request satisfies its latency Service Level Objective (SLO).

Participants will need to carefully coordinate computation and communication across the edge and cloud while balancing throughput and per-request latency requirements.

We hope you will enjoy this challenging optimization problem inspired by real-world AI infrastructure.

Start: August 14, 2026 11:00 UTC (UTC+0)

Finish: August 28, 2026 10:59 UTC (UTC+0)

Prizes

By participating in this Challenge, you agree to the official Rules.

The use of AI tools, including generative AI and AI-assisted coding tools, is permitted during the Challenge. Participants remain fully responsible for the correctness, originality, and compliance of their submissions with all applicable rules.

To be eligible for a prize, you must register through: https://icpc.global/regionals/finder/ICPC-Online-Challenge-2026.

If you cannot access the rules document, please contact [email protected].

Good luck, and we hope you enjoy this complex yet exciting Challenge!

💻 Are you ready to test your problem-solving skills and push your limits in the world of algorithms and data processing? The Technology Olympics 2026 brings you two exciting competitions where creativity, logic, and technical mastery meet high-level challenges—and top teams win prizes!

🎈 Algorithm Track

• Preliminary Round (Online): Friday, September 25, 2026
• Final Round (Onsite – Tehran, Iran): Wednesday, November 3, 2026
• Closing Ceremony: Thursday, November 4, 2026

The problems were authored and prepared by alireza_kaviani, mohammadsam, ArshiaDadras, AlefHeKaaf and AiPd.

📊 Data Processing Track

• Preliminary Round (Online – 24 Hours): Friday, September 11, 2026
• Final Round (Onsite – Tehran, Iran): Thursday, November 4, 2026
• Closing Ceremony: Thursday, November 4, 2026

🏆 Prizes for Each Track

Top 5 Teams in Preliminary Round:

• Travel support to Tehran (up to $200 per person)
• Hotel accommodation during the onsite final
• Meals and refreshments during the event
• Teams ranked 6th to 10th will also qualify for the onsite final

Cash prizes:

• 🥇 1st: $600
• 🥈 2nd: $450
• 🥉 3rd: $300
• 🏅 4th: $250
• 🏅 5th: $200

Cash prizes will be awarded upon participation in the onsite final. Qualified international teams will also receive travel and accommodation support according to the rules of each track, including:

• Travel support to Tehran (up to $200 per person)

• Hotel accommodation during the onsite final

• Meals and refreshments during the event

• Teams ranked 6th to 10th will also qualify for the onsite final.

• Qualified teams will be invited to an online briefing webinar before the final round, covering competition rules, travel arrangements, event schedules, submission procedures, evaluation criteria, and other logistical details.

Hello, Codeforces!

We are excited and pleased to announce that Codeforces Round 1117 (Div. 2) will be held on Aug/17/2026 17:35 (Moscow time). This round will be rated for all participants with rating below $$$2100$$$. You will be given $$$2$$$ hours to solve $$$6$$$ problems and some problems will be divided into subtasks.

All problems were authored and prepared by egorka5opka, oblememan and me.

We are extremely grateful to these wonderful people:

• Akulyat for coordinating the round and assistance in preparing problems;
• Um_nik for preliminary review of the round;
• Our testers: 300iq, __baozii__, Tizz1e, Friendiks, _icy_, Wileyne, Megnis, omsincoconut, _istil, AksLolCoding, madlogic for their time and effort in testing the problems.

The score distribution is below.

$$$500-750-1250-1750−2250−(2750+1000)$$$

GLHF!

UPD1 For those who were affected by the incorrect constraints on problem D and wish for the round not to affect their rating, please leave a comment stating "I don't want the round to be rated for me" in the "Ask a question" section found on the main contest page under the problems.
This applies only to those who were genuinely affected, meaning you must have received a TL (or any other suitable verdict) for that problem.

UPD1.1 Requests are accepted until Tuesday, August 18, 2026 at 12:00UTC (please note the timezone).
The rollback will be done after that.

UPD2 Editorial

UPD3 Winners and First to solve

Official participants:

Unofficial participants:

First to solve: