Hi Codeforces!

I have a great announcement for you. This month, we're holding the second Codeforces Blitz Cup! Remember all the WA1s and CEs we've seen from LGMs stressing out to submit before the opponent? They are coming back!

The Codeforces Blitz Cup is a single-elimination personal tournament where matches follow the special Blitz Rules. In short, each match is a 40-minute PvP contest, where problems open one by one, and only the first AC counts. The players can't use any help or prewritten code except a small template, and we get to watch them think and code live.

• Detailed rules
• Bracket

Check out last year's final rounds streams: day 1, and the final day 2 to get the feel for the format.

• Eligibility: Grandmasters or above
• Registration deadline: February 12, 10:00 UTC
• Elimination rounds: February 13th to 26th (free schedule)
• Live finals: February 28 to March 1 (online)

See you blitzing!

Oh hello there. I, chromate00, am back! Oh no, I hope you are not misunderstanding me, I'm not pulling a joke on the announcement this time. I'm too busy for that right now. So here's the (mostly copy-pasted) announcement of Codeforces Round 1080 (Div. 3).

Anyways. Starting from Sunday, February 15, 2026 at 14:45^UTC, you will be given $\mathbf{7}$ or $\mathbf{8}$ problems to be solved in $\mathbf{2.5}$ hours.

The round will be hosted by 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 but the usual penalty of 10 minutes for each wrong submission, following the rules of educational rounds.

Remind yourself 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)
• not have a rating of 1900 or higher at any moment in time.

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 (unless you register unrated).

Also, note the rule restricting the use of AI. If you are caught while breaking this rule, you will be sent to cry's new basement on Mars without oxygen.

This round is made possible by the help of the following people:

• Vladosiya for coordinating the round (and translating the statements);
• Proof_by_QED for his continued support;
• Dominater069 for red-black testing;
• awoo, __baozii__, catgirl, ttamx, sammyuri, Intellegent for red testing;
• Arpa, omsincoconut, spike1236, beaaaan, -firefly-, temporary1, turska, Friedrich for yellow testing,
• SpyrosAliv, reirugan, tin.le2, yse; YamOCHca, conjectureguy, Edeeva for purple testing;
• ananthak, Ermiooo159, my_bloody_valentine, ai4youej, itz_pabloo, bestial-42-centroids for blue testing;
• ALnQ417, ne_justlm for cyan testing;
• MikeMirzayanov and KAN for great platforms Codeforces and Polygon.

I hope that you will enjoy the contest. Good luck and have fun!

UPD1: Editorial has been posted

Greetings Codeforces community!

We are excited to announce the Constructor Open Cup 2026, our annual online programming competition organized by Constructor University and JetBrains Foundation.

What is the Constructor Open Cup?

Constructor Open Cup is an online contest organized by Constructor University and JetBrains Foundation to promote interest in computer science, data science, software development, and software engineering.

Put your knowledge and skills to the test in this 4-hour competition and stand a chance to walk away with a scholarship for a bachelor's degree in Software, Data and Technology (BSc SDT) at Constructor University, Germany’s #1 private university*!

Constructor Open Cup timetable

February 2 — February 12, 2026 | Practice Round

Get familiar with the testing environment during this practice round.

February 12, 2026 at 2 PM (UTC) | Main Round

You will have 4 hours to complete a series of algorithmic programming tasks. Registration closes 1 hour before the start of the contest.

Hello, Codeforces!

sevlll777 and I are glad to invite you to participate in Codeforces Round 1079 (Div. 1) and Codeforces Round 1079 (Div. 2). Both rounds will take place at Wednesday, February 11, 2026 at 14:35^UTC. There will be 6 problems in each round, some of them can be divided into several subtasks. You will have 3 hours to solve all the problems. The round will be held according to the Codeforces rules and will be rated for both divisions.

At least one problem will be interactive, so we highly recommend to read guide for interactive problems before the contest.

We would like to thank:

• Um_nik for pre-reviewing the round.
• FairyWinx for coordination and helping with problem ideas/preparation.
• MikeMirzayanov and KAN for the best platform.
• SomethingNew, A_G for VIP testing.
• SomethingNew, antontrygubO_o, Um_nik, BurnedChicken for nutella testing.
• PvPro, zeemanz, A_G, k1r1t0, BledDest, triple__a, awoo for red testing.
• Noobish_Monk, Kolychestiy, antonis.white for orange testing.
• madlogic, robotolev for purple testing.
• Matrosk1n, egor4444ik, slash0t, deni1000, dan00ile, Mox_Taest3r, dariasaligina for blue testing.
• IceHydra, bessarab for cyan testing.
• Uznik_Postmoderna for green testing.
• Pimerroc, Dima-prog-coder, Manatth for gray testing.

UPD 1: The score distribution is as follows:

• Div. 1: $500 - 750 - (750 + 750) - 2250 - (2000 + 1000) - 3500$
• Div. 2: $500 - 1000 - 1250 - 1500 - (1500 + 1500) - 4000$

UPD 2: Editorial

Wishing everyone good luck and high ratings!

Hello, Codeforces!

This Sunday there will be a Moscow Olympiad for Young Students. This contest is prepared by Moscow Olympiad Scientific Committee that you may know by Moscow Open Olympiad, Moscow Team Olympiad, Metropolises Olympiad and All-Russian olympiad in the name of Keldysh.

We are glad to invite you to Codeforces Round 1078 (Div. 2) based on the problems of this olympiad, which will take place on Sunday, February 8, 2026 at 09:05^UTC. Note the unusual time of the round. The round will be held according to the Codeforces rules and will be rated for all participants with rating below 2100.

Problems of this competition were prepared by silvvasil, Semen07, allvik66, dope, teraqqq guided by TheEvilBird, grphil and Helen Andreeva.

Thanks to FairyWinx for the round coordination, and also thanks for MikeMirzayanov и KAN for Codeforces and Polygon platforms, which was used to prepare problems of this olympiad.

We also thank:

• t.ravnushkin, KiKoS, didedoshka, feblokas, makrav, blook, zhiganov_v, lewc, gmusya for testing the main Olympiad problems;

• __baozii__, _istil, ArSarapkin, fishy15, PvPro, madlogic, -firefly-, FelixArg for testing the round;

• RP-1, stepanov.aa for the preparing Olympiad problems that were not included in the round.

The scoring will be available later.

UPD: Scoring distribution: 500 — 1000 — 1750 — 2000 — 2500 — (1750 + 1750)

UPD: Since the round is based on an onsite olympiad, viewing other participants' submissions and upsolving will be available starting from 12:00 UTC

UPD: Until 13:00 UTC due technical reason

UPD: Editorial

Hello, Codeforces!

After years of hard work, we are euphoric to invite you to participate in Codeforces Round 1077 (Div. 1) and Codeforces Round 1077 (Div. 2), which will be held at Thursday, January 29, 2026 at 14:35^UTC. For both divisions, you will be given $7$ problems and $3$ hours to solve them. For at least one of the divisions, one of the problems will be divided into two subtasks.

The problems are invented and prepared by Bronya_H, Error_Yuan, StarSilk, Tobo, __baozii__ and me.

We would like to thank:

• SSerxhs for his Superb, Stellar, Extraordinary, Reliable, Xcellent, Helpful and Supportive coordination.
• Alexdat2000 for Russian translations.
• zeemanz and bookcat for providing some ideas that were not ultimately used.
• cry for inventing a basement of infinite capacity to imprison cheaters.
• errorgorn, tiger2005, EnofTaiPeople, and dXqwq for black opal testing.
• geospiza, Aging1986, Sugar_fan, Duck_sajin, qkm66666, AYTDD, Fantasy_Blue, Intellegent, SATSKY_2025target_LGM, _istil, wangmarui, rucaco, fallleaves01, permutation, nifeshe, and A_G for ruby testing.
• Proof_by_QED, sh1ziku, 0x3F, K_tian, aori., sszcdjr, hxu10, CirnoNine, and chennie for topaz testing.
• fatalerror, Fusu, -WIDA-, shendeliliang, and Liang_SYEA for amethyst testing.
• Kato_Shoko, TEYL, clearlove13, Non-origination, chromate00, fr200110217102, and XiaoXia for sapphire testing.
• imhighshou and Clclclcl for aquamarine testing.
• MikeMirzayanov for his obsidian Codeforces and Polygon platform.

The score distribution is below.

Div. 1: $750 - 1250 - 1750 - 2000 - 2250 - (2000 + 3500) - 3000$.

Div. 2: $500 - 1000 - 1500 - 2000 - 2500 - 2750 - 3000$.

We sincerely hope you can enjoy the problems. Good luck and see you on the field !

UPD1: The hacks are disabled for problems A-D in Div 2, and for problems A-B in Div 1. We have final tests consisting of pretests and hacks for all problems.

UPD2: Editorial

Hello, Codeforces!

We are glad and excited to invite you to take part in Codeforces Round 1076 (Div. 3), which will take place on Sunday, January 25, 2026 at 14:35^UTC. You will be given 2 hours and 15 minutes to solve 7-8 probmles. At least one problem will be interactive, so we highly recommend to read guide for interactive problems before the contest.

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.

As a reminder, only 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 (and solve at least one problem in) at least five rated rounds
• and not have had a rating of 1900 or higher at any moment in time.

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 (unless you register unrated).

Problems were authored by KluydQ, YF_YUSUF, Wansur, Mendeke.

We would like to give special thanks to:

• Vladosiya and soullless for the great coordination and chance to host this contest.
• Wansur, k1r1t0, Arpa, Aldk, SorahISA, QazLon, itz_pabloo, YF_YUSUF, Daki-sa, Yessimkhan, Arkanefury, hamburger46, gbula, China001, Dobri_oke, Idam, wadibay, Darko, uwbt17, raiywbek, CLown1331 for their time and effort in testing.
• MikeMirzayanov and KAN for the great Codeforces and Polygon platforms.

UPD: Editorial is here

Hello, Codeforces!

We are excited and pleased to announce that Codeforces Round 1075 (Div. 2) will be held on Friday, January 23, 2026 at 14:35^UTC. 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.

The round is based on the Sharygin International Geometry Olympiad All problems were authored and prepared by yanb0, furt1ve and me.

We would like to express our special thanks to:

• Akulyat for coordinating the round and assistance in preparing problems;
• the testers: Wansur, __baozii__, k1r1t0, Mark_Pr, _istil, OG_Matveychick1, TimDee, zhenja, abs0lute, princeee, NotDWT, Sokol080808, machine_solution, Pobe, madlogic, wuhudsm, pattern-seeker, dvb1r, VitaliiV, penwick, sanya37y, itz_pabloo, Morselllprimo, AK_15, Golden_Square, Norman165, arsen1y, graphs_enjoyer, tih-a, emirhanbanan, ak1ko, s97b, thereverberation, bibiq for their time and effort in testing the problems;
• MikeMirzayanov and KAN for the great platforms.

The score distribution is below.

$500-1000-(1250+750)-(2000+750)-2500-3250$

GLHF!

UPD1 The round is over, thank you for participation.

UPD2 Editorial

UPD3 Winners and First to solve

Div2

Div1 + Div2

First to solve