Codeforces and Polygon may be unavailable from March 27, 11:00 (UTC) to March 27, 14:00 (UTC) due to technical maintenance. ×

By Teza, history, 10 hours ago, In English

Greetings, Codeforces Talents!

We are thrilled to invite you to Teza’s first Codeforces competition!

Teza, founded in 2009 as a high-frequency trading firm, has evolved into a leading systematic quantitative hedge fund. From equities to options, futures, and crypto, we transform complex mathematical concepts into financial strategies that operate across the world's largest markets.

Our team is composed of some of the brightest minds in the industry, including International Olympiad winners in Physics and Mathematics, and the youngest individuals ever to earn double Ph.D.s in Computer Science and Physics from MIT. Our CEO, Misha Malyshev, a MIPT graduate with a Ph.D. from Princeton, is known for setting an unbeaten world record for returns on capital on Wall Street. Learn more about Misha.

We have a team member who has discovered a new star, highlighting our commitment to pioneering exploration in all fields. We believe that only exceptional minds make markets efficient.

Good luck to all participants! And for those not competing, thank you for stopping by — if you're passionate about technical and algorithmic challenges, solving Olympiad-style problems as your day-to-day job, we’d love to connect.

Apply here →

Check out our career opportunities here and explore where your skills can take you.

Enjoy the competition and happy coding!

Full text and comments »

  • Vote: I like it
  • +122
  • Vote: I do not like it

By MidnightCodeCup, 4 weeks ago, In English

Neapolis University Pafos

We’re excited to launch the first-ever Midnight Code Cup (MCC) — a team competition featuring an online Qualification round and a 24-hour onsite Final. Expect algorithmic challenges, optimization puzzles, cutting-edge computer science, and some just plain weird problems. It’ll be exhausting. And fun.

Who are we?

A team of problem solving geeks veterans enthusiasts, eager for the return of this contest format. The idea of Midnight Code Cup was born at Recraft.AI (AI image generation and graphic design pioneers) with huge support from JetBrains (creator of Kotlin, intelligent IDEs, and AI-driven developer tools) as well as Neon (developer-first open-source database) and Pinely (HFT company powered by competitive programmers).The sponsor list is not final and will be updated.

We are also thankful to have Codeforces as our hosting partner.

Who can participate?

Teams of 3 ready to rock and roll! No programming language, affiliation or problem solving methods restrictions. You only need to be at least 18 years old and have a slightly concerning enthusiasm for coding challenges.

Save the Date

April 12, 2025: Online Qualification (4 hours) – here at Codeforces, starts at 13:00 UTC

June 7–8, 2025: Onsite Final (24 hours) – Belgrade, Serbia

Problem setters and jury: Aksenov239, isaf27, NALP, Taube, Gassa, cdkrot, PavelKunyavskiy, tourist, qwerty787788, MaxBuzz, pvs, Solenoid555, nsychev, naagi

Registration opens soon – you have enough time to find a team. Leave your email here and you will be the first to register.

See you at Midnight!

Update: We've set the start time for the qualification round (13:00 UTC). The duration has been changed to 4 hours to accommodate participants across multiple time zones, although covering all regions globally remains a challenge.

Update 2: The registration is open now: https://midnightcodecup.com

Full text and comments »

  • Vote: I like it
  • +301
  • Vote: I do not like it

By Diall_, history, 4 days ago, translation, In English

Hello, Codeforces \[^-^]/

The competitive programming laboratory of the IT campus NEIMARK from Nizhny Novgorod is pleased to invite everyone to participate in Codeforces Round 1013 (Div. 3), which will be held on Mar/25/2025 17:35 (Moscow time).

The round is based on the problems of the final of the first olympiad by IT campus NEIMARK. 312 students from 28 subjects of the Russian Federation took part in the olympiad. And at the final competition, in addition to Nizhny Novgorod students, we met finalists from the Chuvash Republic, Moscow, Tolyatti, Kirov, Saransk and Ulyanovsk.

If you participated in the final of this olympiad, please refuse to officially participate in this round.

The topics of the tasks will be related to the working days and weekends of our laboratory. The laboratory has existed for a little less than a year, but during this time several training camps, many personal and team trainings have been held, and dozens of tasks for school and student competitions have been developed (you can find some of these competitions in the section Gym). We opened competitive programming clubs in schools in Nizhny Novgorod, and began training interested IT teachers. We also acted as a venue for several programming competitions.

And at Mar/25/2025 17:35 (Moscow time) we will finally share with you one of the most important results of our work.

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.

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.

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).

We hope you will enjoy problems! The tasks were prepared by our laboratory staff: Alexey ashmelev Shmelev, Islam l-_-l Shayakhmetov and Diana Diall_ Alyaseva.

Thanks to MikeMirzayanov for the CodeForces and Polygon systems. Thanks to Vladosiya for the coordination and help in preparing the round.

Thanks to our testers: MForest, OG_Matveychick1, Tmitmi, Riladavin, quaha, eepsilon, SL0NYARA, konred, NerfThis, gtheoden42, sasha00123, doreshkin, blinowartemcka, --S, bugrova, Itsmylove1

Good luck for everyone and praise the sun \[^-^]/

Upd. Editorial

Full text and comments »

  • Vote: I like it
  • +202
  • Vote: I do not like it

By fengzhengwei, 6 days ago, In English

There will, and there shall be a THU round!

Nihao Codeforces! After the unfortunate event which led to Codeforces Round 1010 (Div. 1, Unrated) and Codeforces Round 1010 (Div. 2, Unrated) being unrated last week, we’re back and stronger than ever!

Tsinghua University’s Student Association of Algorithmic Competitions (THUSAAC) is pleased to invite you to participate in Codeforces Round 1012 (Div. 1) and Codeforces Round 1012 (Div. 2) on Mar/23/2025 08:35 (Moscow time). This round will be RATED for everyone. You will be given 2 hours and 30 minutes to solve 5 problems for division 1 and 6 problems for division 2, and two of each will have subtasks. Note the unusual time of the round.

Our team of amazing problem setters include: Iam1789, Ecrade_, E.Space, QuietBeautifulThoughts, gyh20, SpiritualKhorosho, dapingguo8, myee, abruce, _Lucien. Some of the problems prepared were not used in the final contest but we would still like to thank them nonetheless.

We would also like to express our gratitude to the following individuals:

THUPC is an annual event hosted by Tsinghua University’s Student Association of Algorithmic Competitions. It is the largest student-run competitive programming contest in China with the top 100 Competitive Programming teams from all over China coming onsite to vie for the crown of BEST CP Team in China after qualifying from a pool of 1000+ teams.

We hope you will enjoy and have fun in the contest. Good luck.

UPD: Here comes the scoring distribution.

Division 1:

$$$750+(1000+500)+(1000+1250)+2500+3000$$$

Division 2:

$$$500+1000+1750+2000+(2000+1000)+(2000+1500)$$$

UPD2: Congratulations to the winners!

Div.1:

  1. tourist

  2. ecnerwala

  3. jiangly

  4. ksun48

  5. JDScript0117

Div.2:

  1. liudiao

  2. lnw143

  3. ilovelll

  4. boboquack

  5. Madeeyuth

UPD3: Editorial

Full text and comments »

  • Vote: I like it
  • +451
  • Vote: I do not like it

By Serval, 7 days ago, In English

Hi Codeforces!

I Serval am glad to invite everyone to participate in Codeforces Round 1011 (Div. 2), which will be held on Mar/22/2025 17:35 (Moscow time).

This round will be rated for participants with rating lower than 2100. We will be glad to see the participants with a higher rating to take part in our round unofficially as well!

You will be given 6 problems to solve in 2 hours, one of which will be divided into two subtasks. Scoring distribution will be announced later.

I would like to thank everyone that makes this round possible:

Good luck & Have fun! (∠・ω < )⌒☆

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

UPD2: Editorial is out. Congratulations to the winners!

Div. 2:

  1. sounansya
  2. DuyNgaDocTon1410
  3. SoloRejudger
  4. nocap
  5. Asbjorn

Div. 1 + Div. 2:

  1. potato167
  2. A_G
  3. arvindf232
  4. antontrygubO_o
  5. TKT_YI

Full text and comments »

  • Vote: I like it
  • +383
  • Vote: I do not like it

By wilcot, 11 days ago, translation, In English

Hello, Codeforces.

The XIII BSUIR Open Programming Championship will be held from March 17 to May 3, 2025 (Minsk, Belarus).

Registration is already open and available until March 20 (inclusive). Teams consisting of 3 students from one higher educational institution, as well as school teams from different educational institutions are allowed to participate. Registration is made by the team captain on the website acm.bsuir.by.

The competition will be held in several stages:

  • March 17 — 24 — Qualifying round (in absentia, mandatory for schoolchildren and students of BSUIR)
  • April 9, 14:00-19:00 — Semi-final (in person, at sites organized by educational institutions)
  • April 26 — Student final (in person, Minsk, BSUIR, Building 4, 9 Gikalo Street)
  • May 3 — School final (in person, Minsk, BSUIR, Building 4, 9 Gikalo Street)

More information about the upcoming Olympiad and registration can be found on the website acm.bsuir.by.

Some previous videos:

Full text and comments »

  • Vote: I like it
  • +36
  • Vote: I do not like it

By awoo, history, 11 days ago, translation, In English

Neapolis University Pafos

Hello Codeforces!

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

On Mar/17/2025 17:35 (Moscow time) Educational Codeforces Round 176 (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, Alex fcspartakm Frolov and me. Also, huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

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

Admission to the Computer Science and Artificial Intelligence bachelor's program at Neapolis University Pafos is open!

The JetBrains Foundation supports this bachelor's program and offers 15 fully funded scholarships for the most talented applicants. The scholarships cover tuition, accommodation, medical insurance, visa fees, and pocket money (€300 per month).

Learn more here →

First admission round:

  • Application deadline – April 23, 2025
  • Entrance test – April 27, 2025

UPD: Editorial is out

Full text and comments »

  • Vote: I like it
  • +94
  • Vote: I do not like it

By KaiSuoShuTong, 2 weeks ago, In English

Nihao! Hello to all fans of competitive programming and Codeforces enjoyers!

On behalf of Tsinghua University’s Zhili College, we — your proud and slightly sleep-deprived Class of 2028 Information and Computing Science students — are happy to invite you to participate in Codeforces Round 1010 (Div. 1, Unrated) and Codeforces Round 1010 (Div. 2, Unrated), which will take place on Mar/15/2025 17:35 (Moscow time). Note the unusual start time of the round.

You’ll have 3 hours to tackle 7 problems for division 1 and 6 problems for division 2, the round will be rated for all participants. It’s a little longer than your typical Codeforces round, and yes, we know you’ll be sleep-deprived — but who needs sleep when there’s coding to do, right?

This round’s problems are brought to you by the incredible Ecrade_, newbiewzs, chen_03, 18Michael and sunzh. Special thank you to dapingguo8, Zesty_Fox and Iam1789 who also prepared problems that were ultimately not used in this round.

A massive THANK YOU to the following legends who made this event possible:

Zhili Cup itself is an annual event hosted by Tsinghua University’s Zhili College along with its freshmen of ICS. We are delighted to meet you on Codeforces this year.

Good luck, and may your code be bug-free and your coffee cup never empty.

See you at the round!

UPD: Here comes the scoring distribution.

Division 1:

$$$500 + 1000 + 1750 + 1750 + 2250 + 2500 + (1500 + 1500)$$$

Division 2:

$$$500 + 1000 + 1500 + 2000 + 2750 + 2750$$$

UPD2: Due to technical problems, the round is postponed for 30 minutes.

UPD3: The round is postponed to the usual Codeforces time and won't be rated. We (Codeforces team) apologize for these problems.

UPD4: Contest is over! Thank you to everyone who participated in the round even though it is unrated, we truly hope that you all enjoyed our problems and had a great time participating. The editorials will be a bit delayed but we promise they'll be here soon! See you guys again soon!

UPD5: Editorial

Full text and comments »

  • Vote: I like it
  • +646
  • Vote: I do not like it

By chromate00, 7 weeks ago, In English

Oh hello there. This is chromate00, just casually on the announcement of Codeforces Round 1009 (Div. 3). And now, you see a drawing.

$$$\square$$$ — $$$\triangle$$$ — $$$\triangle$$$ — ◯ — $$$\triangle$$$ — $$$\square$$$ — $$$\triangle$$$

And then, you think. You see a square, a triangle, and a circle. Also, a Korean problemsetter. You immediately imagine the certain survival game that popped up in your memory. And you may be right. Or you might be wrong. Whatever, what I can ensure you is that you will be absolutely stunned to see the problems. Or astonished. You might not believe what you see. This round might change everything.

Anyways, the preface was a bit too long. Starting from Mar/11/2025 17:35 (Moscow time), you will be given $$$\mathbf{7}$$$ problems to be solved in $$$\mathbf{2.5}$$$ hours. There is at least one interactive problem, so I strongly urge you to read the guide if you are unfamiliar with the format.

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 (relatively recent) rule restricting the use of AI. If you are caught while breaking this rule, you will be terminated.

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

I hope that you will also be in the spectacular moment.

UPD: Editorial has been posted.

UPD2: Congratulations to the top participants definitely except for the ones who cheated their way out!

All participants:

  1. ksun48
  2. arvindf232
  3. StarSilk
  4. maspy
  5. risujiroh

Trusted (rated) participants:

  1. sharvil_cpp
  2. Xing_Kong_C......has been terminated
  3. jxu
  4. 1zaid1
  5. eysikingE
  6. I_am_the_Lowest
  7. ConvexHulllllll

Full text and comments »

  • Vote: I like it
  • +92
  • Vote: I do not like it

By omsincoconut, 3 weeks ago, In English

Hello, Codeforces!

I'm glad to invite everyone to Codeforces Round 1008 (Div. 1), Codeforces Round 1008 (Div. 2), which will be held on Mar/10/2025 17:45 (Moscow time).

You will be offered $$$7$$$ problems in both divisions 1 and 2, and you will be given $$$2$$$ hours and $$$30$$$ minutes to solve them.

Both divisions contain at least one interactive problem(s). Please look up the guide if you are unfamiliar with them.

I'd like to give my utmost thanks to

I hope everyone will indulge in the tasks blissfully.

Score distribution

Division 1: $$$500-1000-1500-2250-2250-2500-3000$$$

Division 2: $$$500-750-1250-1750-2000-2750-3500$$$

Congratulations to the winners!

Division 1

  1. jiangly

  2. Ormlis

  3. Um_nik

  4. tourist

  5. ksun48

Division 2

  1. a1048576

  2. SussykinWantsNatalia

  3. DanielAnker

  4. Manasvi

  5. hungpc1577

Editorial

Full text and comments »

  • Vote: I like it
  • +228
  • Vote: I do not like it


×
Can't find such blog