You can use several words in query to find by all of them at the same time. In addition, if you are lucky search understands word forms and some synonyms. It supports search by title and author. Examples:

  • 305 — search for 305, most probably it will find blogs about the Round 305
  • andrew stankevich contests — search for words "andrew", "stankevich" and "contests" at the same time
  • user:mikemirzayanov title:testlib — search containing "testlib" in title by MikeMirzayanov
  • "vk cup" — use quotes to find phrase as is
  • title:educational — search in title

Results

1.
By KAN, 11 months ago, In English
Rounding 2025 Hi Codeforces! 2025 comes to an end. However square the year was, we held a number of rounds: 29 Div. 1 and 31 Div. 2-only contests, to be precise! Additionally, 18 Div. 3, 4 Div. 4, and 13 Educational rounds made the schedule even more congested. <img src="/predownloaded/c8/54/c854d6a423b830263449cca6ff841c8e4e02e024.png" style="width:1400px; float:center; margin: 1em 1em 1em 1em"/> December is not only the <strike>perfect</strike> [only](/blog/entry/149140?#comment-1332941) time to wrap the year, but also to celebrate and thank all the people who made this year possible. That's why I want to highlight with this post the people whose efforts shaped Codeforces contests. I'd like to say a huge thank you to every active community member who created and/or prepared problems for Codeforces rounds! Without your ideas and creativity, it would be impossible to hold so fun and interesting competitions. There are so many of you from every corner of the world, so that it's impossible...
Div. 1 and 31 Div. 2-only contests, to be precise! Additionally, 18 Div. 3, 4 Div. 4, and13

Full text and comments »

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

2.
By Kuroni, history, 6 years ago, In English
Codeforces Round #715 <p style="text-align: right;"> <i> "Love" is a violent word.<br> "I love that about you..." Doesn't that just mean "If that changed, I wouldn't love you anymore?"<br> "Love" is a word that binds you.<br> — Touko Nanami — </i> </p> Hi Codeforces! [user:Ari,2021-04-13] and I are pleased to invite you to participate in [contest:1508] and [contest:1509], which will be held at [contest_time:1508]. Each division will have **6 problems** and **2 hours and 15 minutes** to solve them. Big thanks to the following people: - Sir [user:antontrygubO_o,2021-04-13] for being an amazing coordinator; the round wouldn't happen without you ❤️ - [user:Scrubpai,2021-04-13], [user:1-gon,2021-04-13], [user:hugopm,2021-04-13], [user:tfg,2021-04-13], [user:dorijanlendvaj,2021-04-13], [user:xuanquang1999,2021-04-13], [user:300iq,2021-04-13], [user:Mike4235,2021-04-13], [user:Luminal,2021-04-13], [user:QuangBuiYT,2021-04-13], [user:jamienguyen,2021-04-13], [user:Pichu,2021-04-13], [user:ch...
Codeforces Round #715, ,2021-04-13] for testing the round and providing valuable feedback. - [user:MikeMirzayanov,2021-04, ], [user:TheDramaQueen,2021-04-13], [user:nor,2021-04-13], and [user:alimq,2021-04-13] for testing the round and

Full text and comments »

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

3.
By McDic, history, 7 years ago, In English
Codeforces Round #633 **내가 돌아왔다!** (Hello, Codeforces!) I am thrilled to introduce you to [Codeforces Round #633](https://codeforces.me/contests/1338,1339). Followings are basic information: - This contest will take place on [contest_time:1338]. - The round is **rated for all participants** who can understand this announcement. There will be two divisions. - There are **5 problems** in each division and you will have **2 hours** to solve it. - Score distribution will be announced later. Followings are contributors: - **Authors**: [user:McDic,2020-04-10] (All Div.2 problems and Div.1 D), [user:tzuyu_chou,2020-04-10] (Div.1 E) - **Coordinator**: [user:antontrygubO_o,2020-04-10] - **Testers**: - **Phase 1** (When this round was supposed to be Div.2): [user:dorijanlendvaj,2020-04-10], [user:SoulTch,2020-04-10], [user:pajenegod,2020-04-10], [user:AryaPawn,2020-04-10], [user:Rahul,2020-04-10], [user:mcdx9524,2020-04-10], [user:300iq,2020-04-10], [user:Nemo,2020-04-10], [user:tfg,2020-04-10]...
Codeforces Round #633, round was originally supposed to be rated for Div.2 only. However, after we completed Phase 1testing

Full text and comments »

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

4.
By star_xingchen_c, 6 years ago, In English
Codeforces Global Round 13 Hello Codeforces! On [contest_time:1491] we will host [contest:1491]. **<img src="/predownloaded/2e/e2/2ee2f0f95f05aae6ca6f47812dae2dc2aabf277b.png" style="width: 200.0px;float: right;margin: 0 1.0em 1.0em 1.0em;max-width: 100.0%;max-height: 100.0%;">** It is the first round of a 2021 series of [Codeforces Global Rounds](https://codeforces.me/blog/entry/65002). The rounds are open and rated for everybody. The prizes for this round: - 30 best participants get a t-shirt. - 20 t-shirts are randomly distributed among those with ranks between 31 and 500, inclusive. The prizes for the 6-round series in 2021: - In each round top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT). - The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest. - The best 20 participants over all series get sweatshirts and place certificates. Thanks to XTX, which in 2021 supported the global rounds ...
Codeforces Global Round 13, **UPD3:** System testing finished, congrats to the winners!, ] for testing the round and sticking on difficult problems providing valuable, testing the round and sticking on difficult problems providing valuable feedback

Full text and comments »

Announcement of Codeforces Global Round 13
  • Vote: I like it
  • +1092
  • Vote: I do not like it

5.
By satyam343, 3 years ago, In English
think-cell Round 1 Hello, Codeforces! Welcome to the [contest:1930] supported by think-cell, which will start on [contest_time:1930]. It will be a combined rated round for both divisions. All problems were authored and prepared by [user:Elegia,2024-02-13] and [user:satyam343,2024-02-07]. We would like to thank: - [user:errorgorn,2024-02-13] for round coordination and help with preparation - [user:KAN,2024-02-17] for helping with the preparation of problems - [user:Alexdat2000,2024-02-13] for Russian translation - [user:GoatTamer,2024-02-17] and [user:Non-origination,2024-02-17] for discussing problems with us while our proposal was in review and testing the round. - [user:Kaitokid,2024-02-13], [user:antekb,2024-02-13], [user:vgtcross,2024-02-13], [user:riano_,2024-02-13], [user:mtw,2024-02-13], [user:AboAbdoMC,2024-02-13], [user:Vladithur,2024-02-13], [user:BERNARD,2024-02-13], [user:milind0110,2024-02-13], [user:conqueror_of_tourist,2024-02-13], [user:Um_nik,2024-02-13], [user:gamegame...
think-cell Round 1, problems with us while our proposal was in review and testing the round. - [user:Kaitokid,2024-02-13

Full text and comments »

Announcement of think-cell Round 1
  • Vote: I like it
  • +798
  • Vote: I do not like it

6.
By Endagorion, 12 years ago, In English
Codeforces Round #300 (with prizes!) Hello, Codeforces! [On Sunday, April 26th at 19:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?day=26&month=4&year=2015&hour=19&min=0&sec=0&p1=166) the 300'th regular Codeforces Round will take place. I would like to congratulate all Codeforces members and administration on this remarkable milestone. The platform has grown hugely in size and quality since its foundation, has hosted lots of exciting competitions, and has been providing the opportunity to everyone to hone their problem solving and algorithmic mastery. For this we thank the Codeforces platform creator [user:MikeMirzayanov,2015-04-24] and all the Codeforces crew. Keep up the incredible job, guys! That being said, I'm excited to announce that the problems on the jubilee three-hundredth Codeforces Round will be set by me, Mikhail Tikhomirov ([user:Endagorion,2015-04-24]). You may remember the past rounds with my problems: [#99](http://codeforces.me/contests/138,139), [#109](http://codeforces.me/contest...
Codeforces Round #300 (with prizes!), Round will take place. I would like to congratulate all Codeforces members and administration on this

Full text and comments »

Announcement of Codeforces Round 300
  • Vote: I like it
  • +1212
  • Vote: I do not like it

7.
By SirShokoladina, history, 8 years ago, translation, In English
Codeforces Round #497 by Skyglow <img style="float: right; margin: 0px 30px 20px 50px;" src="/predownloaded/7a/cb/7acb70215acb214185582e201c004419b1a7622f.jpg"> Hello, everyone! We are a Death Metal band [Skyglow](http://skyglowband.com/). Recently we released our first album. And since we happen to be sport programmers, we decided to make a Codeforces round in honor of this! The round will take place on [contest_time:1007]. There will be five problems for each division, three of them will coincide. The problems were made up by me and [user:SirRembocodina,2018-07-09], the contest was also prepared with the help of [user:TeaPot,2018-07-09], [user:GrumpyKitten,2018-07-09], [user:mingaleg,2018-07-09] and [user:niyaznigmatul,2018-07-09]. Thanks to [user:demon1999,2018-07-10] and [user:winger,2018-07-13] for testing, our coordinator [user:arsijo,2018-07-09] and, of course, [user:MikeMirzayanov,2018-07-09] for Codeforces and Polygon platforms. You can listen to the album by following the link: - https://skygl...
Codeforces Round #497 by Skyglow, [user:niyaznigmatul,2018-07-09]. Thanks to [user:demon1999,2018-07-10] and [user:winger,2018-07-13] for testing, -10] and [user:winger,2018-07-13] for testing, our coordinator [user:arsijo,2018-07-09] and, of

Full text and comments »

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

8.
By MikeMirzayanov, 8 years ago, translation, In English
Hello, ITMO! <img src="https://assets.codeforces.com/images/itmo-logo.png" style="margin:1em 1em 1em 1em; float:right;"/> Hi Codeforces! For you, perhaps it was yet another Codeforces round. But not for me. [contest:1066] is the first round tested on new judging servers at ITMO University. And this is not just an update of location. Ta-dam! Now your solutions will be judged on the new Intel i3-8100 processors. And this is not all news. The number of judging servers has increased, which means fewer queues during rounds! I am pleased to announce that now I live in St. Petersburg, I work at ITMO, and Codeforces is gradually moving from the walls of dear to me Saratov University to ITMO University. The decision to move was not easy for me. My plan is that, based on ITMO, I can focus more on Codeforces development and work on the platform. The number of world champions per square meter is simply overwhelming, and working with a large team of such enthusiasts (and professionals!) of sports pro...
Codeforces Round #516 (by Moscow Team Olympiad). — [user:MikeMirzayanov,2018-10-13]

Full text and comments »

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

9.
By AmShZ, 4 years ago, In English
Codeforces Round #800 Hi Codeforces! [user:Keshi,2022-06-13], [user:alireza_kaviani,2022-06-13] and I are delighted to invite you to participate in [contest:1693] and [contest:1694]. - Start time: [contest_time:1693] - Duration: $120$ minutes - Number of Tasks: $6$ for both divisions - Rated range: ($-\infty$,$1899$] for Div2, [$1900$, $\infty$) for Div1 We are honored to have set the 800th Codeforces round. We wish this wonderful platform all the best along with many other exciting rounds. Huge thanks to the following people: - [user:antontrygubO_o,2022-06-13] for his breath-taking coordination. - Our testers [user:um_nik,2022-06-13], [user:errorgorn,2022-06-13], [user:koosha_mv,2022-06-13], [user:irkstepanov,2022-06-13], [user:ArchUser84,2022-06-13], [user:sohsoh,2022-06-13], [user:fatemetmhr,2022-06-13], [user:Dorost,2022-06-13], [user:nor,2022-06-13], [user:pooya-shams,2022-06-13], [user:Arnch,2022-06-13], [user:Kahou,2022-06-13] and [user:mosaev,2022-06-13] for testing the round an...
Codeforces Round #800, ], [user:Arnch,2022-06-13], [user:Kahou,2022-06-13] and [user:mosaev,2022-06-13 ] fortesting the round

Full text and comments »

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

10.
By errorgorn, 3 years ago, In English
Confession: I sent problem H to goodbye Going to be 100% honest here, I sent problem H to goodbye. I feel really bad to authors of Goodbye 2023 for ruining their round, it seems the round would have been better by just removing H. As much as the community is out here roasting [user:74TrAkToR,2023-12-31], I also had a part to play in this contest. I wish to be as transparent as I can here without saying any classified information (apologies to [user:KAN,2023-12-31] and [user:74TrAkToR,2023-12-31] if anything here shouldn't be disclosed). To give some context, here is what went down in goodbye round from my perspective: - 13 days before contest: KAN asks me if I can source a 1E for goodbye. I asked traktor to send me the testing gym so that I could gauge how hard the 1E should be. He told me he will send me after he translates the statements. (UPD: Note that the IMO 1986 problem was already removed before this stage which is why a new 1E was needed, I never saw this IMO problem) - 11 days before contest: traktor send it...
disclosed). To give some context, here is what went down in goodbye round from my perspective: -13

Full text and comments »

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

11.
By djm03178, history, 7 years ago, In English
Codeforces Round #620 (Div. 2) **안녕하세요, 코드포스!** (Hello, Codeforces!) I'm glad to invite you to [contest:1304]. The contest will start at [contest_time:1304], and it is **rated** for all participants with ratings under 2100. You will be given **6 problems** and one of the problems has 2 subtasks. The contest duration is **2 hours**. The score distribution will be announced later. All problems are prepared by me, with huge help from the testers with developing great solutions. I'll be on the [community Discord server](https://codeforces.me/blog/entry/52778) after the contest to share my thoughts and get feedback about the problems. Thanks to [user:79brue,2020-02-13], [user:molamola.,2020-02-13], [user:FlowerOfSorrow,2020-02-13], [user:evenharder,2020-02-13], [user:cs71107,2020-02-13], [user:Justice_Hui,2020-02-13], [user:rkm0959,2020-02-13], [user:chpark1111,2020-02-13], [user:imeimi,2020-02-13], [user:alswhp,2020-02-13], [user:gaelim,2020-02-13], [user:jh05013,2020-02-13] ([Good tester](https://codefo...
Codeforces Round #620 (Div. 2), [user:ko_osaga,2020-02-13] for testing the round. I would also like to thank [user:300iq,2020-02-13, ], [user:surung9898,2020-02-13], and [user:ko_osaga,2020-02-13] for testing the round. I would also like to thank

Full text and comments »

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

12.
By MOUFLESS, 18 months ago, In English
Codeforces Round 1025 (Div. 2) ## Ready to Duel? If yes, [user:fzark, 2025-05-09], [user:Intellegent, 2025-05-09], and I are glad to invite you to [Codeforces Round 1025 (Div. 2)](https://codeforces.me/contests/2109), which will be held on [contest_time:2109]. This round will be **rated for participants with rating lower than 2100**. We will also be glad to see the participants with a higher rating to participate in our round unofficially! You will be given **6** problems (with at least one interactive problem and one problem that has 3 versions) and **2 hours and 15 minutes** to solve them. Also you can read about interactive problems [here](https://codeforces.me/blog/entry/45307). **Please take a look at the score distribution; it may help you during the contest. Additionally, make sure to read all the problems.** We would like to thank: - [user:satyam343,2025-05-09], our great beloved coordinator. - [user:Kaitokid,2025-05-09], [user:rui_er,2025-05-09], [user:TripleM5da,2025-05-09], [user:N...
Codeforces Round 1025 (Div. 2), ] and [user:SpyrosAliv,2025-05-13] for blue testing., ], [user:chromate00,2025-05-09] and [user:SpyrosAliv,2025-05-13] for blue testing

Full text and comments »

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

13.
By sum, history, 3 years ago, In English
Codeforces Round #919 (Div. 2) Hello Codeforces! ================= [user:omeganot,2024-01-10] and I are excited to invite you to participate in [contest:1920] which will start on [contest_time:1920]. You will be given 2 hours to solve 6 problems. One of the problems is divided into 2 subtasks. **This round will be rated for participants of Division 2 with a rating lower than 2100.** We would like to thank - [user:artyom123,2024-01-10] for his epic coordination and also for translating the problem statements! - [user:A_G,2024-01-10], [user:PurpleCrayon,2024-01-10], [user:juliany2,2024-01-10], [user:Andreasyan,2024-01-10], [user:oursaco,2024-01-10], [user:hyforces,2024-01-10], [user:Apple_Method,2024-01-10], [user:GusterGoose27,2024-01-13], [user:null_awe,2024-01-10], [user:awesomeguy856,2024-01-10], [user:lunchbox,2024-01-10], [user:jli505,2024-01-10], [user:Lemur95,2024-01-10], [user:ocasu,2024-01-10], [user:EmeraldBlock,2024-01-10], [user:EnDeRBeaT,2024-01-10], [user:cry,2024-01-10], [user:htetgm,2024...
Codeforces Round #919 (Div. 2), to solve 6 problems. One of the problems is divided into 2 subtasks. **This round will be rated, -01-10], [user:GusterGoose27,2024-01-13], [user:null_awe,2024-01-10], [user:awesomeguy856,2024-01-10

Full text and comments »

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

14.
By Intellegent, history, 21 month(s) ago, In English
Codeforces Round 1005 (Div. 2) <center> <img src="https://i.imgur.com/McpYICK.png" style="width: 125.0px;max-width: 100.0%;max-height: 100.0%;"></center> <center> <h1> Hello Codeforces! </h1> </center> I am very excited to offer you to participate in [contest:2064], starting at [contest_time:2064]. There will be **6** very epic tasks and you will have **2 hours** to solve them. All problems were authored and prepared by me. This round will be **rated for all participants with rating below 2100**. I would like to thank the following list of orzosities for making this round possible: - [user:flamestorm,2025-02-13] for coordinating and helping with problem preparation. - My army of testers: [user:N_z__,2025-02-13], [user:triple__a,2025-02-13], [user:sammyuri,2025-02-13], [user:_istil,2025-02-13], [user:Dominater069,2025-02-13], [user:nifeshe,2025-02-13], [user:awesomeguy856,2025-02-13], [user:Error_Yuan,2025-02-13], [user:anango,2025-02-13], [user:temporary1,2025-02-13], [user:efishel,2025-02-13], [u...
Codeforces Round 1005 (Div. 2), not testing. - [user:MikeMirzayanov,2025-02-13] for codeforces and polygon, ]. - [user:cry,2025-02-13] for not testing. - [user:MikeMirzayanov,2025-02-13] for codeforces and polygon

Full text and comments »

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

15.
By Vladithur, history, 4 years ago, In English
Codeforces Round #813 (Div. 2) #####Hi, Codeforces! [user:Igorfardoc,2022-08-07] and I are pleased to invite you to our [contest:1712], which will be held on [contest_time:1712]. **This round will be rated for participants with rating lower than 2100.** We would like to thank: - [user:DishonoredRighteous,2022-08-07] for coordinating the round. - [user:Um_nik,2022-08-11], [user:Ormlis,2022-08-07], [user:errorgorn,2022-08-07], [user:FairyWinx,2022-08-07], [user:golikovnik,2022-08-07], [user:74TrAkToR,2022-08-07], [user:thenymphsofdelphi,2022-08-08], [user:lox123,2022-08-07], [user:Kon567889,2022-08-07], [user:AlperenT,2022-08-07], [user:Alexdat2000,2022-08-07], [user:MagentaCobra,2022-08-07], [user:welleyth,2022-08-07], [user:_dlbm17,2022-08-08], [user:satyam_343,2022-08-07], [user:thanhchauns2,2022-08-07], [user:SlavicG,2022-08-07], [user:_Vanilla_,2022-08-07], [user:jampm,2022-08-07], [user:QuangBuiCP,2022-08-08], [user:LeCaToX,2022-08-08] for testing the round and providing useful feedback. - [user:MikeM...
Codeforces Round #813 (Div. 2), -08-08], [user:LeCaToX,2022-08-08] for testing the round and providing useful feedback

Full text and comments »

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

16.
By manish.17, 5 years ago, In English
Codeforces Round #766 (Div. 2) omg hi Codeforces! [user:ScarletS,2022-01-12], [user:flamestorm,2022-01-12], [user:fishy15,2022-01-13], [user:saarang,2022-01-12], <a class="rated-user user-orange" href="/profile/lookcook" title="Did no work and cried for name to be here">lookcook</a> and I are glad to invite you to our Codeforces round, [contest:1627], which will be held on [contest_time:1627]. **This round will be rated for participants with rating lower than 2100**. We would like to thank: - [user:Monogon,2022-01-12] senpai for excellent coordination of the contest. - [user:MikeMirzayanov,2022-01-12], for creating the amazing Codeforces and Polygon platforms! - [user:KAN,2022-01-15], for Russian translations! - [user:dorijanlendvaj,2022-01-12], [user:errorgorn,2022-01-12], [user:PurpleCrayon,2022-01-12], [user:generic_placeholder_name,2022-01-12], [user:blue,2022-01-12], [user:polarity-,2022-01-12], [user:atharv,2022-01-12], [user:epicxtroll,2022-01-12], [user:dbsic211,2022-01-12], [user:StArChAn...
Codeforces Round #766 (Div. 2), [user:bakekaga,2022-01-12] for testing the round, catching any mistakes and providing lots of, -12] and [user:bakekaga,2022-01-12] for testing the round, catching any mistakes and providing lots of

Full text and comments »

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

17.
By TheScrasse, 12 months ago, In English
Codeforces Round 1066 (Div. 1 + Div. 2) <img src="/predownloaded/13/18/131877f87a8429bb2b0f2038d88cfa74db11fafd.png" align="right" style="height: 250px;" alt="text"/> Ciao, Codeforces! We're glad to invite you to take part in [contest:2157], which will start on [contest_time:2157]. You will be given **9 problems** and **3 hours** to solve them in both divisions. The round will share some problems with [The 2025 ICPC Southwestern Europe Regional Contest (SWERC) 2025](http://www.swerc.eu/2025/). **Note the unusual starting time.** Some of the problems might be interactive, so please read the [guide for interactive problems](https://codeforces.me/blog/entry/45307) if you are not familiar with it. The problems were authored and prepared by [user:KLPP,2025-11-19] and me. We would like to thank - [user:Dominater069,2025-11-19] for his &#128173; &#128161; &#127880; coordination; - [user:Alexdat2000,2025-11-19] for Russian translation; - [user:dario2994,2025-11-19] for VIP testing; - [user:Geothermal,2025-11-19],...
Codeforces Round 1066 (Div. 1 + Div. 2), contest (13:30 UTC, 1 hour after the Codeforces round ends). Please also refrain from discussing the, end of the onsite contest (13:30 UTC, 1 hour after the Codeforces round ends). Please also refrain

Full text and comments »

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

18.
By satyam343, 4 years ago, In English
Codeforces Round #838 (Div. 2) Hello, Codeforces! [user:amurto,2022-12-13] and I are glad to invite everyone to participate in [contest:1762], which will be held on [contest_time:1762]. This Round will be rated for participants with rating strictly **lower than 2100**. Participants from the first division are also welcomed to take part in the competition but it will be unrated for them. You will be given **7 problems** and **2 hours and 30 minutes** to solve them. One of the problems will be **interactive**. Make sure to read [this blog](https://codeforces.me/blog/entry/45307) and familiarize yourself with these types of problems before the round! We would like to thank: - [user:errorgorn,2022-12-13] for amazing coordination and help with the problem preparation. - [user:KAN,2022-12-13] for translation of the statements into Russian - [user:TheScrasse,2022-12-13] for providing suggestions which helped us to improve one problem. - [user:GoatTamer,2022-12-13] for discussing problems with us whil...
Codeforces Round #838 (Div. 2), while our proposal was in review and testing the round. - [user:dorijanlendvaj,2022-12-13, ,2022-12-13], [user:Mo2men,2022-12-13] and [user:tibinyte,2022-12-14] for testing this round and

Full text and comments »

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

19.
By vovuh, history, 7 years ago, In English
Codeforces Round #634 (Div. 3) &lt;almost-copy-pasted-part&gt; Hello! [contest:1335] will start at [contest_time:1335]. You will be offered 6 or 7 problems (or 8) 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 rating 1600 or higher, can register for the round unofficially. The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests &mdash; just like you will be upset if many solutions fail after the contest is over. You will be given 6 or 7 (or 8) problems and 2 hours to solve them. Note that **the penalty** for the wrong submission in this round (and the following Div. 3 rounds) is **10 minutes**. [Remember] (/blog/entry/59228) that only the <i>trusted participants of the third division</i> will be included in the ...
Codeforces Round #634 (Div. 3), **UPD**: Also thanks to [user:ma_da_fa_ka,2020-04-13] and [user:infinitepro,2020-04-13] for testing, ] Mescheryakov and Ivan [user:BledDest,2019-12-27] Androsov for help in round preparation andtesting the round

Full text and comments »

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

20.
By matrix, 12 years ago, In English
Codeforces Round #282 Hi, Codeforces Round #282 will be held at [13th of December, 19:30 MSK](http://timeanddate.com/worldclock/fixedtime.html?day=13&month=12&year=2014&hour=19&min=30&sec=0&p1=166). Please don't note anything since the time is the usual time of contests. The round is prepared by [user:FarbodY,2014-12-12], [user:Haghani,2014-12-12] and Me([user:matrix,2014-12-12]). We'd like to thank [user:Zlobober,2014-12-12] who helped us a LOT for preparing the problems, [user:MikeMirzayanov,2014-12-12] for the Polygon and Codeforces platforms and [user:delinur,2014-12-13] for helping us in preparing statements and translating them. Our special thanks goes to [user:mruxim,2014-12-12] for testing the round. The problems will be sorted according to the estimated order of difficulty according to our opinion but we strongly recommend you to read all of the problems. As always the update regarding score distribution will be posted **just** before the round starts. :) **UPD**: It was writ...
Codeforces Round #282, **usual time** 19:30 MSK. **UPD2**: We also thank [user:niyaznigmatul,2014-12- 13] for testing our round, **UPD2**: We also thank [user:niyaznigmatul,2014-12-13] for testing our round.

Full text and comments »

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

21.
By KaiSuoShuTong, 20 months ago, In English
Codeforces Round #1010 (Div. 1, Div. 2, based on Zhili Cup 2025) <img src="/predownloaded/56/63/566383e7e7fa812dd2a088c602242a8719a18bea.png" style="width: 250.0px;float: right;margin: 0 1.0em 1.0em 1.0em;max-width: 100.0%;max-height: 100.0%;"> 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 [contest:2081] and [contest:2082], which will take place on [contest_time:2081]. **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 [user:Ecrade_, 2025-03-01], [user:newbiewzs, 2025-...
Codeforces Round #1010 (Div. 1, Div. 2, based on Zhili Cup 2025), -13] for testing and providing invaluable feedback. - Our fantastic organisers: [user: HeziCyan, ], [user:I_love_kirill22,2025-03-11], [user:RP-1,2025-03-11], [user:TeaTime,2025-03-11], [user:turmax,2025-03-13] for

Full text and comments »

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

22.
By Serval, 8 years ago, In English
Codeforces Round #551 (Div. 2) Hi Codeforces! We are glad to invite you to our first Codeforces Round [contest:1153] which will be held on [contest_time:1153]. This round will be rated for participants with rating less than 2100. We will be glad to see participants from the first division to join out of competition as well! In this round, as the best friend of Serval's, you are going to help him to solve the problems he meets. The problems are prepared by [user:bzh,2019-04-12] and me. We hope you will enjoy the round. :P Great thanks to [user:300iq,2019-04-12] for coordination of this round, [user:isaf27,2019-04-12], [user:gritukan,2019-04-12], [user:KAN,2019-04-12], [user:mohammedehab2002,2019-04-12], [user:learner99,2019-04-12], [user:aleks5d,2019-04-12] and [user:Um_nik,2019-04-13] for testing our rounds, and [user:MikeMirzayanov,2019-04-12] for the amazing Codeforces and Polygon platforms. You will be given 6 problems to solve in 2 hours. Scoring distribution will be announced later. Please ...
Codeforces Round #551 (Div. 2), ], [user:learner99,2019-04-12], [user:aleks5d,2019-04-12] and [user:Um_nik,2019-04-13] for testing our

Full text and comments »

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

23.
By IgorI, history, 6 years ago, translation, In English
Codeforces Round #694 (Div.1, Div.2) Hello Codeforces! Now the winter SIS (Summer Informatics School) is taking place, and parallel A+A0 and its teachers have prepared a complete Codeforces Round. You can check previous rounds, prepared by SIS students: [Codeforces Round #612](https://codeforces.me/contests/1286,1287), [Codeforces Round #530](https://codeforces.me/contests/1098,1099). [Codeforces Round #694](https://codeforces.me/contests/1470,1471) begins on [contest_time:1470]. In both redactions, there will be $6$ problems for $2$ hours. The round is rated for both divisions. Problems are authored and prepared by [user:AliceG,2019-03-03], [user:Pakhomovee,2020-05-01], [user:MadProgrammer,2020-07-30], [user:ArtNext,2019-12-14], [user:fastmath,2019-09-28], [user:IgorI,2017-12-28], [user:Kapt,2018-10-11], [user:KhB,2019-10-26], [user:Helloo_zk,2020-03-01], [user:ipamaro,2018-12-30], [user:Arbuzniy_kekich,2020-02-17], [user:Mangooste,2020-02-17], [user:pelmenner,2019-10-13], [user:Allvik06,2020-04-08] under the...
Codeforces Round #694 (Div.1, Div.2), ], [user:Vergara,2021-01-04] for testing the round and giving useful feedback. We recommend you to read

Full text and comments »

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

24.
By atodo, 5 years ago, In English
Codeforces Round #771 (Div. 2) Hello, Codeforces! I am happy to invite you to [contest:1638], which will take place on [contest_time:1638]. **The round will be rated for participants with rating lower than 2100.** You will have **2 hours** to solve **6 problems**. The problems were authored and prepared by me. I would like to thank the following people who made the round possible: - [user:Artyom123,2022-02-13] for coordination, help in problem preparation and translating the statements. - [user:KAN,2022-02-13] for helping with round preparation. - [user:geniucos,2022-02-13] and [user:spatarel,2022-02-13] for discussing problems with me way before the round was proposed. - [user:gamegame,2022-02-13], [user:Kirill22,2022-02-13], [user:AlexLuchianov,2022-02-13], [user:Monogon,2022-02-13], [user:wxhtzdy,2022-02-13], [user:generic_placeholder_name,2022-02-13], [user:BlueDiamond,2022-02-13], [user:Devil,2022-02-13], [user:Ziware,2022-02-13], [user:Utkarsh.25dec,2022-02-13], [user:TeaTime,2022-02-13], [user:...
Codeforces Round #771 (Div. 2), like to thank the following people who made the round possible: - [user:Artyom123,2022-02-13] for, statements. - [user:KAN,2022-02-13] for helping with round preparation. - [user:geniucos,2022-02-13

Full text and comments »

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

25.
By PrinceOfPersia, history, 11 years ago, In English
Codeforces Round #326 Hello Codeforces. I'm honored to announce you, that Codeforces round #326 is gonna take place [soon](http://timeanddate.com/worldclock/fixedtime.html?day=15&month=10&year=2015&hour=19&min=30&sec=0&p1=166) on Codeforces. Writers are AmirMohammad Dehghan([user:PrinceOfPersia,2015-10-01]) and Ali Haghani([user:Haghani,2015-10-08]). There will be 6 problems in each division(4 problems are common) and you'll have 2 and a half hour to solve them. I hope you enjoy the problems. I wanna thank Maxim Akhmedov([user:Zlobober,2015-10-01]) for his great helps in preparing this round, [user:MikeMirzayanov,2015-10-01] for wonderful platforms of Codeforce and Polygon, [user:Delinur,2015-10-08] for translating problem statements into Russian and MohammadReza Maleki([user:mruxim,2015-10-13]) and Ali Bahjati([user:AliB,2015-10-13]) for their great advices (and [user:AliB,2015-10-13] again for some graphics). This is my third round on Codeforces and not the last one, I hope. This is the las...
Codeforces Round #326, Hello Codeforces. I'm honored to announce you, that Codeforces round #326 is gonna take place

Full text and comments »

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

26.
By BledDest, 5 years ago, translation, In English
Codeforces Round #760 (Div. 3) Hello, Codeforces! On [contest_time:1618] the [contest:1618] will start. This is a usual round for the participants from the third division. The round will contain 8 problems, which are mostly suited for participants with rating below 1600 (or we hope so). Although, as usual, participants with rating of 1600 and greater can register for the round unofficially. The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks (we hope that our tests are strong enough, so there won't be too many solutions hacked during this phase). You will have to solve **8 problems** in **2 hours and 15 minutes**. The penalty for a wrong submission is equal to **10 minutes**. [We remind you](https://codeforces.me/blog/entry/59228) that only _the trusted participants of the third division_ will be included in the official standings table. As it is w...
Codeforces Round #760 (Div. 3), ], [user:Lankin,2021-12-13], [user:awoo,2021-12-13] and me. We would like to thank the testers of theround

Full text and comments »

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

27.
By Vladosiya, history, 2 years ago, translation, In English
Codeforces Round 966 (Div. 3) Hello! [contest:2000] will start at [contest_time:2000]. You will be offered 6-8 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 **6-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](https://codeforces.me/blog/entry/59228) 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 ...
Codeforces Round 966 (Div. 3), ,2024-08-13], [user:Bruteforceman,2024-08-13] for yellow testing., -08-13] for red testing. 3. [user:irkstepanov,2024-08-13], [user:Kirkon,2024-08- 13, 2. [user:FairyWinx,2024-08-13], [user:TheScrasse,2024-08-13], [user:Be_dos,2024-08-13] for red, 4. [user:Vitaly503,2024-08-13], [user:FBI,2024-08-13] for purple testing., 5. [user:satyam343,2024-08-13], [user:vikram108,2024-08-13] for blue testing., 6. [user:trgt26,2024-08-13] for green testing.

Full text and comments »

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

28.
By isaf27, history, 5 years ago, translation, In English
Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2) Hi all! This weekend, at [contest_time:1584] we will hold [contest:1588] and [contest:1589]. They are based on problems of Technocup 2022 Elimination Round 2 that will be held at the same time. Technocup is a major olympiad for Russian-speaking high-school students, so if you fall into this category, please register at <a href="https://technocup.mail.ru/">Technocup website</a> and take part in the Elimination Round. Div. 1 and Div.2 editions are open and rated for everyone. Register and enjoy the contests! - The round authors are: [user:Denisson,2021-11-13], [user:antonis.white,2021-11-13], [user:dimatimoshin23,2021-11-13], [user:__JustMe__,2021-11-13], [user:4qqqq,2021-11-13], [user:Aleks5d,2021-11-13] - Coordinator: [user:isaf27,2021-11-13] - Thanks [user:KAN,2021-11-13] for help with round preparation, also thanks [user:MikeMirzayanov,2021-11-13] for the great Codeforces and Polygon systems. - Thanks [user:221,2021-11-13], [user:Makcum888,2021-11-13], [user:Melonad...
Technocup 2022 — Elimination Round 2 and Codeforces Round #755 (Div. 1, Div. 2), and enjoy the contests! - The round authors are: [user:Denisson,2021-11-13], [user:antonis.white, - The round authors are: [user:Denisson,2021-11-13], [user:antonis.white,2021-11-13

Full text and comments »

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

29.
By kiwii, 5 years ago, In English
COMPFEST 13 Finals Mirror (Unrated, ICPC Rules, Teams Preferred) <img alt="logo" src="/predownloaded/31/e8/31e886f0ba055023282a2f68b4b254d98c02c727.png" style="float: right;height: 100.0px;margin: 10.0px;max-width: 100.0%;max-height: 100.0%;"> Hi <strong><span style="color:#bfac00;">Code</span><span style="color:#006fbf;">for</span><span style="color:#b00000;">ces</span></strong> ଘ(੭*ˊᵕˋ)੭* ੈ♡‧₊˚! We're delighted to invite you to [COMPFEST 13 &mdash; Finals Online Mirror (Unrated, ICPC Rules, Teams Preferred)](https://codeforces.me/contests/1575) on <a class="contest-time" contestid=1575></a>. All problems were written and prepared by [user:hocky,2021-09-18], [user:steven.novaryo,2021-09-18], [user:rama_pang,2021-09-18], [user:JulianFernando,2021-09-18], [user:Zap,2021-09-18], [user:Panji,2021-09-24], [user:richiesenlia,2021-09-24], [user:Sakamoto,2021-09-24], and [user:Markus_geger,2021-09-24]. I would also like to thank: - [user:KAN,2021-09-18] for helping to host the mirror round; - ([user:AVM.Martin,2021-09-30], [user:Ace_02,202...
COMPFEST 13 Finals Mirror (Unrated, ICPC Rules, Teams Preferred), [user:bukanyohandi,2021-09-24] for testing the round locally and improved the problems in early, -09-18], and [user:bukanyohandi,2021-09-24] for testing the round locally and improved the problems

Full text and comments »

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

30.
By Kuroni, history, 3 years ago, In English
Invitation to VNOI CUP 2023 Final — Online Mirror ![ ](/predownloaded/63/be/63bec60a0247493db5431f6a0ea15c7d4ed953c1.jpg) Hi everyone! On behalf of the VNOI CUP 2023 team, I would like to invite you to participate in [VNOI CUP 2023 Final &mdash; online mirror](https://oj.vnoi.info/contest/vnoicup23_final_mirror), which will be held in parallel with the [official onsite division](https://cup.vnoi.info/contest/vnoicup23_final) and the [open onsite division](https://cup.vnoi.info/contest/vnoicup23_final_open). Some important information about the round: - [Online mirror link](https://oj.vnoi.info/contest/vnoicup23_final_mirror). - Time: [Saturday, 22 July 2023, 03:00 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=VNOI+CUP+2023+Final&iso=20230722T10&p1=218&ah=5). - Duration: **5 hours**. - Problems: **7 to 10**, sorted by difficulty (hopefully!). Each problem contains multiple subtasks. - Penalty format: AtCoder style, i.e. timestamp of last submission that increased your score + 5 minutes per submission befor...
[user:dragonslayerintraining,2023-07-13] for subjecting themselves to the trauma that istesting these, - [user:Lomk,2023-07-13] for being our wonderful director. - [user:Kuroni,2023-07-13

Full text and comments »

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

31.
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 93 [Rated for Div. 2] Hello Codeforces! On [contest_time:1398] [contest:1398] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 Roman [user:Roms,2020-08-13] Glazov, Adilbek [user:adedalic,2020-08-13] Dalabaev, Vladimir [user:vovuh,2020-08-13] Petrov, Ivan [us...
Educational Codeforces Round 93 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

32.
By MikeMirzayanov, 8 years ago, translation, In English
Codeforces: Results of 2018 Hi Codeforces! February 2019 is already on the calendar, which means that I was late with the report for 2018. Better late than never! Let's remember last year. In 2018, [user:_kun_,2019-02-05], [user:300iq,2019-02-05] and [user:arsijo,2019-02-05] joined the team of coordinators. The work of the coordinators is headed (and is the coordinator of the coordinators) [user:KAN,2019-02-05]. I really hope that a more measured schedule of preparing rounds by a large team of coordinators will give a better insight into the contests. The main innovations in the platform are implemented by me and the developers [user:kuviman,2019-02-05], [user:fcspartakm,2019-02-05], [user:MaximShipko,2019-02-05]. Great work on the organization of events and prizes mailing was done by [user:gKseni,2019-02-05]. Special thanks to the writers of the problems and testers. It is your content that charges the community with life and unites all of us. Thank you for the problems! And now let's summarize...
contest) 1. Show test results for examples during a round 1. Better support of printers in groups 1

Full text and comments »

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

33.
By Xiaohuba, 13 months ago, In English
Codeforces Global Round 30 Hello, Codeforces! We are pleased to announce the resumption of the Global Rounds. Thanks to XTX Markets for supporting the initiative! In 2025, we will hold 3 such rounds. The series results will take into account the best 2 participations out of 3. On [contest_time:2164] we will host [contest:2164]. **<img src="/predownloaded/2e/e2/2ee2f0f95f05aae6ca6f47812dae2dc2aabf277b.png" style="width: 200.0px;float: right;margin: 0 1.0em 1.0em 1.0em;max-width: 100.0%;max-height: 100.0%;">** Codeforces Global Round 30 marks the second round in the 2025 series of Codeforces Global Rounds. These rounds are open and rated for everyone. The prizes for this round are as follows: - The top 30 participants will receive a t-shirt. - 20 t-shirts will be randomly distributed among participants ranked between 31 and 500, inclusive. The prizes for the 3-round series in 2025: - In each round, the top-100 participants get points according to the [table](https://pastebin.com/NMzrRc...
Codeforces Global Round 30

Full text and comments »

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

34.
By TheScrasse, history, 3 years ago, In English
Editorial of Pinely Round 3 (Div. 1 + Div. 2) The official implementations of all the problems are [here](https://drive.google.com/file/d/1q2PHS9nJt84FRwfMoiMslQULFE4dTMU4/view?usp=sharing). <spoiler summary="Timeline of the round proposal (may contain spoilers)"> (problems D', H', etc. were not used) - Feb 19, 2022: I proposed problem D' to [contest:1654], but it was not used. - Mar 13, 2023: I invented problem A. - May 16: I invented problem H'. - May 19: I realized problem G can be solved in $O(n)$ time and we used it in the Italian team selection test for IOI. - Jul 04: I opened a Div. 1 proposal containing A, D', G, H' and other problems which are not going to be used. - Aug 09: I invented problem I, with intended solution in $O(n^3)$. - Sep 27: I invented problem C. - Oct 14: [user:errorgorn,2023-12-23] replied to my contest proposal. - Nov 02: I invented problem D''. [user:errorgorn,2023-12-23] solved problem I in $O(n^2 \log n)$. - Nov 08: I invented problems E and F. I didn't propose problem F because I th...
Editorial of Pinely Round 3 (Div. 1 + Div. 2), - Feb 19, 2022: I proposed problem D' to [contest:1654], but it was not used. - Mar13, 2023: I, . - Nov 14: I finished preparing the problems, and the round was ready for testing

Full text and comments »

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

35.
By KAN, 6 years ago, translation, In English
Technocup 2021: Final Round and Codeforces Round #709 Hi everyone! <p><a style="float:right;margin:0 0 1em 1em;" href="http://codeforces.me/technocup2021"><img src="http://assets.codeforces.com/images/technocup-narrow-logo.png"/></a> The Final Round of Technocup 2021 starts this Sunday, March 21, 2021 at 13:00 MSK (10:00 UTC)! For those who want to compete on the same problems, we will hold two regular Codeforces Rounds in the evening: one for the first division, and another one for the second. The rounds are starting at [contest_time:1483]. **If you are a participant of the official Technocup Finals, you are not allowed to take part in the rounds in the evening. We ask participants of the official Finals not to discuss the problems in open media till evening.** The problems are prepared by: Alexander [user:Golovanov399,2021-03-20] Golovanov, Evgenii [user:amethyst0,2021-03-20] Belykh, Andrey [user:AndreySergunin,2021-03-20] Sergunin, Alexey [user:Aleks5d,2021-03-20] Upirvitskiy, Diego [user:Diegogrc,2021-03-20] Garcia a...
Technocup 2021: Final Round and Codeforces Round #709, Round of Technocup 2021 starts this Sunday, March 21, 2021 at 13:00 MSK (10:00 UTC)! For those who

Full text and comments »

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

36.
By KAN, 9 years ago, translation, In English
Codeforces Round #423: rated, based on VK Cup 2017 Finals Hi! [On Tuesday, July 11, 2017, at 16:35 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+%23423&iso=20170711T1935&p1=352&ah=2) Codeforces Round #423 will be held. Some of the problems will be from VK Cup 2017 Finals, some are prepared by Codeforces team to complete the problemset. **Note that there will be two rounds based on VK Cup Finals, so I want to ask finalists not to discuss problems until the end of the second round.** There will be *six* problems in each division, four of them shared. The problems of this round are proposed, prepared and tested by: [user:gritukan,2017-07-10], [user:demon1999,2017-07-10], [user:fcspartakm,2017-07-10], [user:Perforator,2017-07-10], [user:MikeMirzayanov,2017-07-10], [user:PavelKunyavskiy,2017-07-10], [user:qwerty787788,2017-07-10], [user:Belonogov,2017-07-10], [user:izban,2017-07-10], [user:tourist,2017-07-10], [user:vepifanov,2017-07-10], [user:AlexFetisov,2017-07-10], [user:winger,2017-07-10], [user:Erri...
Codeforces Round #423: rated, based on VK Cup 2017 Finals, /fixedtime.html?msg=Codeforces+Round+%23423&iso=20170711T1935&p1=352&ah=2) CodeforcesRound #423 will be held

Full text and comments »

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

37.
By Newtech66, 5 years ago, In English
Codeforces Round #782 (Div. 2) Hello, Codeforces! [user:TimeWarp101,2022-04-12] and I are excited to invite you to [contest:1659] which will take place on [contest_time:1659]. **This round will be rated for participants with rating lower than 2100.** Many thanks to all the people who made this round possible: - [user:Arpa,2022-04-12] and [user:KAN,2022-04-12] for coordinating the round! - [user:KAN,2022-04-17] for Russian translations. - [user:AwakeAnay,2022-04-12] for a lot of advice throughout the process + listening to my terrible problem ideas, and for proposing tasks that did not make it to the final problemset. - [user:TimeWarp101,2022-04-12] cause I love you uwu <3 - [user:i_am_completely_useless,2022-04-12] for being completely useless. - [user:antontrygubO_o,2022-04-12], [user:AmShz,2022-04-12], [user:AwakeAnay,2022-04-12], [user:generic_placeholder_name,2022-04-12], [user:TeaTime,2022-04-12], [user:fishy15,2022-04-12], [user:TheScrasse,2022-04-12], [user:kartikeyasri23,2022-04-12], [user:Mage...
Codeforces Round #782 (Div. 2), - [user:Arpa,2022-04-12] and [user:KAN,2022-04-12] for coordinating the round! - [user:KAN,2022-04, :1659] which will take place on [contest_time:1659]. **This round will be rated for participants with

Full text and comments »

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

38.
By Proof_by_QED, 22 months ago, In English
Codeforces Round 998 (Div. 3) Hellowo Codeforces o7 ====================================== <div style="float:right; margin:0 1em 1em 1em; text-align:center;"> <img src="/predownloaded/04/74/0474addd27ccbb4c93f5c8390645861706d295de.png" style="width:400px;"/> </div> [user:cry,2025-01-12], [user:larush,2025-01-12], [user:chromate00,2025-01-12], [user:LMeyling,2025-01-12], [user:Lilypad,2025-01-12], and I are [ebullient](https://www.merriam-webster.com/dictionary/ebullient) to welcome you to participate in [contest:2060] at [contest_time:2060]. We have cooked up $7$ problems to be solved in $2$ hours and $30$ 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. Note that the **penalty** for each wrong submission in this round is **10 minutes**. Also, **not...
Codeforces Round 998 (Div. 3), individuals for making the contest possible: - ~Vladosiya,2025-01-13 for coordinating ourround

Full text and comments »

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

39.
By sszcdjr, history, 2 years ago, In English
Refact.ai Match 1 (Codeforces Round 985, Div. 1 + Div. 2) Hello, Codeforces! We (KDOI Team) are glad to invite you to take part in [contest:2029], which is the 8th CP contest held by us! You can view the previous rounds by us [here](/blog/entry/135847). - Number of problems: $9$ ($0$ interactive); - Start time: [contest_time:2029]; - Contest duration: $180$ minutes; - Score distribution: $750-1250-1750-2250-2500-3000-3500-5000-5500$. The problems were authored and prepared by [user:Error_Yuan,2024-11-05], [user:wyrqwq,2024-11-05], [user:Otomachi_Una,2024-11-05] and me [user:sszcdjr,2024-11-05]. --- <img src="/predownloaded/73/e1/73e1593107761ee6b925164110aa7307488b2215.png" style="float:right; margin: 0 0 2em 2em; width:300px;"/> A few words from our sponsor: We’re [Refact.ai](https://refact.ai/?utm_source=codeforces&utm_medium=post&utm_campaign=round_09112024&utm_content=cf_short_09112024), an open-source AI Coding Assistant, and on November 9th, we’ll be hosting our first round on Codeforces! Winners will receive ...
Refact.ai Match 1 (Codeforces Round 985, Div. 1 + Div. 2), Assistant, and on November 9th, we’ll be hosting our first round on Codeforces! Winners will receive

Full text and comments »

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

40.
By ko_osaga, history, 14 months ago, In English
Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) Annyeonghaseyo, Codeforces! We invite you to participate in [contest:2152], which will be held on [contest_time:2152]. The round will be **rated for everyone**. You will be given **8 problems**, one of which is divided into two subtasks, and **3 hours** to solve them. One of the problems will be interactive, so make sure to read the [guide for interactive problems](https://codeforces.me/blog/entry/45307) before the contest. The problems are authored and prepared by [user:as_dfsdf,2025-09-29], [user:djm03178,2025-09-29], [user:ko_osaga,2025-09-29], and [user:qwerasdfzxcl,2025-09-29]. We would like to thank: - [user:errorgorn,2025-09-29] for great coordination. - [user:Alexdat2000,2025-09-29] for great Russian translation. - [user:Adam_GS,2025-09-29], [user:ainta,2025-09-29], [user:bangan,2025-09-29], [user:BuzzyBeez,2025-09-29], [user:cookiedoth,2025-09-29], [user:Dragos,2025-09-29], [user:gamegame,2025-09-29], [user:garam1732,2025-09-29], [user:Geothermal,2025-09-29],...
Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2), on [contest_time:2152]. The round will be **rated for everyone**. You will be given **8 problems

Full text and comments »

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

41.
By nik_exists, 10 months ago, In English
Codeforces Round 1074 (Div. 4) Hello <font color="#DBA800">C</font><font color="blue">o</font><font color="red">d</font><font color="#DBA800">e</font><font color="blue">f</font><font color="red">o</font><font color="#DBA800">r</font><font color="blue">c</font><font color="red">e</font><font color="#DBA800">s</font><font color="blue">!</font> ------------------ I am delighted to invite you to the first Div. 4 round of the year: [contest:2185]! The round is scheduled for [contest_time:2185]. You will be given 7 &mdash; 8 problems to solve (all authored by me), and 2 hours and 15 minutes to solve them. The format of the event will be identical to Div. 3 rounds: - ICPC rules with a penalty of 10 minutes for an incorrect submission. - 12-hour phase of open hacks after the end of the round (hacks do not give additional points). - After the end of the open hacking phase, all solutions will be tested on the updated set of tests, and the ratings will be recalculated. Only trusted participants of the fourth ...
Codeforces Round 1074 (Div. 4), ="blue">! ------------------ I am delighted to invite you to the first Div. 4 round of the

Full text and comments »

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

42.
By MrPaul_TUser, history, 5 years ago, In English
Codeforces Round #748 (Div. 3) Hello, Codeforces! I'm glad to invite you to amazing (we've tried to make it such) [contest:1593] which will start on [contest_time:1593]. This round is made by me ([user:MrPaul_TUser,2021-10-12]), a significant contribution to the round was also made by [user:MikeMirzayanov,2021-10-12] and [user:BledDest,2021-10-13]. The round contains 6-8 problems. The difficulties of 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 1600 or higher, can register for the round unofficially. The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round, it will be a 12-hour phase of open hacks. We tried to make really strong tests — just like you will be surprised if many solutions fail after the contest is over. You will be given **6-8 problems** and **2 hours 15 minutes*...
Codeforces Round #748 (Div. 3), ], [user:arjunsanjeev7,2021-10-13], and [user:UpS0lver,2021-10-13] for testing theround and improving tasks. Good, ], [user:mahade31,2021-10-13], [user:arjunsanjeev7,2021-10-13], and [user:UpS0lver,2021-10-13] for testing the round and

Full text and comments »

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

43.
By feecIe6418, history, 2 years ago, In English
Codeforces Round 958 (Div. 2) Hello Codeforces! I am glad to invite you to [contest:1988] which will start on [contest_time:1988]. The contest will last for 2 hours with 6 tasks for you to solve. The contest will only be rated for those with a rating not higher than 2099, but high-rated competitive programmers are also more than welcome to participate out of competition. The score distribution is: 500-1000-1000-2000-2500-3500 The contest will be impossible without the help from: - [user:244mhq,2024-07-13] for wonderful coordination. - [user:gyh20,2024-07-13], [user:Dominater069,2024-07-13], [user:Um_nik,2024-07-13], [user:A_G,2024-07-13], [user:omeganot,2024-07-13], [user:tkl2006,2024-07-13], [user:harsh__h,2024-07-13], [user:oursaco,2024-07-13], [user:Hori,2024-07-13], [user:kostia244,2024-07-13], [user:ishaandas1,2024-07-13], [user:maomao90,2024-07-13], [user:waidenf,2024-07-13], [user:Stefan2417,2024-07-13], [user:MisterReaper,2024-07-13] for testing. - [user:MikeMirzayanov,2024-07-13] for Code...
Codeforces Round 958 (Div. 2), ,2024-07-13], [user:Stefan2417,2024-07-13], [user:MisterReaper,2024-07-13] for testing, ], [user:Stefan2417,2024-07-13], [user:MisterReaper,2024-07-13] for testing. - [user:MikeMirzayanov,2024-07-13] for

Full text and comments »

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

44.
By qwexd, 2 months ago, In English
Codeforces Round 1121 (Div. 2) Editorial # Codeforces Round 1121 — Editorial Thanks for participating! ### [problem:2264A] Problem by [user:qwexd,2026-09-13]. <spoiler summary="Hint"> Look at the elements that are not in the right position. Which of them must be selected? Can selecting any other element help? </spoiler> <spoiler summary="Solution"> Every element that is not in the right position has to be selected; otherwise, it never moves. Selecting an element that is already in the right position cannot help. For it to stay correct after the reversal, it has to be paired with itself, because its value occurs nowhere else in the permutation. Thus it can only be the middle selected element, and removing it changes nothing. So, if the array is already sorted, choose any one element. Otherwise, select exactly the misplaced elements and reverse them. The answer is `YES` if this sorts the array, and `NO` otherwise. If the misplaced positions are listed from left to right, the reversal pairs the...
Codeforces Round 1121 (Div. 2) Editorial, Problem by [user:jeroenodb,2026-09-13]. Testing tool created by [user:turska,2026-09-13], ]. Testing tool created by [user:turska,2026-09-13] Try to make an

Full text and comments »

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

45.
By KAN, 9 years ago, translation, In English
Codeforces Round #424: rated, based on VK Cup 2017 Finals Hi! [On Thursday, July 13, 2017, at 15:05 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+%23424&iso=20170713T1805&p1=352&ah=2) Codeforces Round #424 will be held. Some of the problems will be from VK Cup 2017 Finals, some are prepared by Codeforces team to complete the problemset. There will be *six* problems in the second division, five as usual in the first, three of them shared. The problems of this round are proposed, prepared and tested by: [user:send_nodes,2017-07-10], [user:akvasha,2017-07-10], [user:ilya_the_lamer,2017-07-10], [user:fcspartakm,2017-07-10], [user:Perforator,2017-07-10], [user:MikeMirzayanov,2017-07-10], [user:PavelKunyavskiy,2017-07-10], [user:qwerty787788,2017-07-10], [user:Belonogov,2017-07-10], [user:izban,2017-07-10], [user:tourist,2017-07-10], [user:vepifanov,2017-07-10], [user:AlexFetisov,2017-07-10], [user:winger,2017-07-10], [user:Errichto,2017-07-10], [user:Gassa,2017-07-10], [user:naagi,2017-07-10], [user:ashmelev...
Codeforces Round #424: rated, based on VK Cup 2017 Finals, Hi! [On Thursday, July 13, 2017, at 15:05 UTC](https://www.timeanddate.com/worldclock

Full text and comments »

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

46.
By Tigutor, history, 11 years ago, translation, In English
Codeforces Round #339 (Div. 1 & Div. 2) Hi all! In two days, at 19:35 MSK Codeforces Round #339 (Div. 1 & Div. 2) will take place. This is an unusual round since we — the problemsetters — are highschool students who participate in the programming training group at high school #179. This round is our first effort and we did our best to make it interesting and bug-free. I invite you all to compete in this round since the problems will be **solvable**, but even [user:tourist,2016-01-13] will have to think over some of them. :) With supervision and control from Mikhail Tikhomirov ([user:endagorion,2016-01-13]), the problems were developed by: Egor Chunaev ([user:ch_egor,2016-01-13]), Vasily Alferov ([user:platypus179,2016-01-13]), Dmitry Sayutin ([user:cdkrot,2016-01-13]), Timofey Gutor ([user:Tigutor,2016-01-13]), Maria Fedorkina ([user:MF2000,2016-01-13]). Mikhail Sorokin ([user:themikemikovi4,2016-01-13]) and Sergey Aleikin ([user:Derrior,2016-01-13]) contributed their problem ideas. We thank Gleb Evstropov ([user:Gl...
Codeforces Round #339 (Div. 1 & Div. 2), -01-14] and [user:winger,2016-01-14] for testing, and, of course, [user:MikeMirzayanov,2016-01-13] for, ] for testing, and, of course, [user:MikeMirzayanov,2016-01-13] for unique CodeForces and Polygon

Full text and comments »

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

47.
By diskoteka, 3 years ago, translation, In English
Codeforces Round #878 (Div.3) **Hey Codeforces (ノ◕ヮ◕)ノ*:・゚✧** ---------------------------------- My team and I are happy to invite you to participate in [contest:1840]. The round will take place on [contest_time:1840]. You will be offered 8 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**. You will be given **8 problems** and **2 hours and 15 minutes** to solve them. One of the problems in this round is interactive. Don't forget to read the [guide on interactive problems](https://codeforces.me/blog/entry/45307). Note that the **penalty** for the wrong submission in this round is **10 minutes**. [Remember](http...
Codeforces Round #878 (Div.3), invite you to participate in [contest:1840]. The round will take place on [contest_time:1840]. You

Full text and comments »

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

48.
By cry, 2 years ago, In English
Codeforces Round 988 (Div. 3) Welcome to Natlan, Codeforces! ------------------ <div style="float:right; margin:0 1em 1em 1em; text-align:center;"> <img src="/predownloaded/b1/f4/b1f460f3b3dc0a21b417aece154d333df202f737.png" style="width:350px;"/> <div> <a href="https://genshin-impact.fandom.com/wiki/Toyac_Springs">Toyac Springs, Natlan</a> </div> </div> [user:sum,2024-10-25], [user:vgoofficial,2024-10-25] and I are [like a dog with two tails](https://dictionary.cambridge.org/us/dictionary/english/like-a-dog-with-two-tails) to welcome you to participate in [contest:2037] at [contest_time:2037]. We have cooked up $7$ problems to be solved in $2$ hours and $15$ 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. Note that the **penalty...
Codeforces Round 988 (Div. 3), [contest_time:2037]. We have cooked up $7$ problems to be solved in $2$ hours and $15$ minutes. Theround

Full text and comments »

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

49.
By awoo, history, 2 years ago, translation, In English
Educational Codeforces Round 170 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Neapolis University Pafos](https://www.nup.ac.cy/). They offer a BSc in Computer Science and AI with [JetBrains Scholarships] (https://lp.jetbrains.com/academy/csai-program/). Gain cutting-edge skills in AI and machine learning, preparing you for high-demand tech careers. Curious? Check out the [CSAI curriculum] (https://drive.google.com/file/d/19I776O8NG07ie2Q14wwBspuh3De4kbHc/view) now. Limited scholarships available &mdash; don't miss your chance to study in Europe for free! Are you looking to sharpen your skills and increase your chances of getting a scholarship? Join the free clubs for high school students from JetBrains: - [Math club](https://lp.jetbrains.com/youth-math-club/) - [AI club](https://lp.jetbra...
Educational Codeforces Round 170 [Rated for Div. 2], [contest_time:2025] [contest:2025] will start. This round will be **rated for the participants with

Full text and comments »

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

50.
By SecondThread, history, 7 years ago, In English
Why problem writers should stop saying “It is guaranteed that” Please Stop Guaranteeing Things ================== There are two common meanings for something being “guaranteed”, and often it is up to the reader to guess the author’s intended meaning. This is annoying and creates unnecessary barriers to entry. **Meaning #1:** The thing we are guaranteeing is provably true for the given input. The thing we are guaranteeing is simply true. We don’t want to provide a proof since it would be long, unnecessary, and annoying to read, and might spoil the solution, but you have our word that an answer always exists. Example: We give you two positive integers A and B (1 <= A, B <= 100). Find some positive integer C (1 <= C <= 200) such that C < A + B. **It is guaranteed that some C exists.** **Meaning #2:** The only input that is legal is input for which this is true. The thing we are guaranteeing might not always be true without this guarantee. Thankfully, we are providing this guarantee so that you only need to concern yourself with solving t...
that “It can be proven that for all inputs following the constraints, X” [Code Jam 2020Round 1A

Full text and comments »

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

51.
By jinlifu1999, history, 8 years ago, In English
Codeforces Round #536 (Div. 2) Hello, Codeforces! It's my honor to invite you to Codeforces Round #536 (Div. 2), which takes place at [12:35 UTC, January 31st, 2019](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+%23536+%28Div.+2%29&iso=20190131T1235&p1=1440&ah=2). The round will be **rated** for all division 2 participants **(with rating less than 2100)**. Also we warmly welcome those division 1 participants to join us out of competition. This is my second round on Codeforces platform, and my first round was on January 31st, **2018**, which is such a coincidence that I would like to say thanks to [user:KAN,2019-01-29] for his awesome coordination and great dedication to this round. Besides, much thanks to testers [user:Aleks5d,2019-01-29], [user:cyand1317,2019-01-29], [user:mohammedehab2002,2019-01-29], [user:osaaateiasavtnl.,2019-01-29] for their excellent testing work. Also, I would like to appreciate the Codeforces platform created and maintained by [user:MikeMirzayanov,2019-01-...
Codeforces Round #536 (Div. 2), Hello, Codeforces! It's my honor to invite you to Codeforces Round #536 (Div. 2), which takes

Full text and comments »

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

52.
By zscoder, 10 years ago, In English
Tinkoff Challenge — Final Round (Div. 1 + Div. 2 Combined) Hi all! On [May 13, 12:35 MSK](http://timeanddate.com/worldclock/fixedtime.html?day=13&month=5&year=2017&hour=12&min=35&sec=0&p1=166), Tinkoff Challenge &mdash; Final Round will be held. Standings of the official finalists are availiable <a href="http://codeforces.me/contest/794/standings?list=4e2b6a4beff28c1877652f834b79c7d9">here</a>. The authors of the round are me ([user:zscoder,2017-05-12], Zi Song Yeoh), [user:AnonymousBunny,2017-05-12] (Sreejato Kishor Bhattacharya), [user:hloya_ygrt,2017-05-12] (Yury Shilyaev). Special thanks to [user:KAN,2017-05-12] (Nikolay Kalinin) for coordinating the round, [user:winger,2017-05-12] (Vladislav Isenbaev) and [user:AlexFetisov,2017-05-12] (Alex Fetisov) for testing the problems. Also, thanks to [user:MikeMirzayanov,2017-05-12] (Mike Mirzayanov) for the Codeforces and Polygon system. There are seven problems and the duration is two hours. Scoring will be announced before the round. Top 20 participants of the Elimination Round w...
Tinkoff Challenge — Final Round (Div. 1 + Div. 2 Combined), Hi all! On [May 13, 12:35 MSK](http://timeanddate.com/worldclock/fixedtime.html?day=13&month=5

Full text and comments »

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

53.
By BiNARyBeastt, history, 2 years ago, In English
Codeforces Round 972 (Div. 2) Good Day Codeforces! Me and [user:Tsovak,2024-08-26] are happy to invite you to take part in [contest:2005], which starts on [contest_time:2005]. You will be given **5 problems** and **2 hours** to solve them. Two problems are divided into two subtasks. The round will be rated for all participants with a rating **lower than 2100**. The problems were authored by me with [user:Tsovak,2024-08-26]'s help to solve and alter them. We would like to thank: - [user:TheScrasse,2024-08-26], [user:Kaey,2024-08-31] for wonderful double coordination and chess skills. - [user:Alexdat2000,2024-09-13] for Russian translation. - [user:turmax,2024-08-26], [user:BurnedChicken,2024-08-26] for nutella testing. - [user:physics0523,2024-08-26], [user:Andreasyan,2024-08-26], [user:Arayi,2024-08-26], [user:zidder,2024-08-26] for red testing. - [user:FelixArg,2024-08-26], [user:_LeMur_,2024-08-26], [user:_RedWine_,2024-08-26], [user:Error_Yuan,2024-08-26] for orange testing. - [us...
Codeforces Round 972 (Div. 2), ** to solve them. Two problems are divided into two subtasks. The round will be rated for all

Full text and comments »

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

54.
By Edvard, history, 11 years ago, translation, In English
Educational Codeforces Round #1 Hi, Codeforces! Educational Codeforces Round #1 will take place on [13 ноября 2015 года в 18:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Educational+Codeforces+Round+%231&iso=20151113T1500) for the first and second divisions. You can read about educational rounds [here](http://codeforces.me/blog/entry/21496). The round will be unrated for all users and it will be held with extented ACM ICPC rules. You will have two hours to solve five problems. After that you will have one day to hack any solution you want. You will have access to copy any solution and test it locally. Educational rounds are (and would) be prepared by me, Edvard Davtyan from Saratov SU Daemons team. Problems was invented by me and [user:MikeMirzayanov,2015-11-13]. Thanks to my teammate [user:dans,2015-11-13] for testing problems and [user:MikeMirzayanov,2015-11-13] for Codeforces, Polygon and idea of the educational rounds. I hope you will enjoy the problems. If they will be too simple...
Educational Codeforces Round #1, ,2015-11-13] for testing problems and [user:MikeMirzayanov,2015-11-13] for Codeforces, Polygon and

Full text and comments »

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

55.
By Edvard, history, 10 years ago, translation, In English
Educational Codeforces Round 13 Hello, Codeforces! Educational Codeforces Round 13 will take place on [13 June 2016 at 19:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Educational+Codeforces+Round+13&iso=20160613T1600) for the first and the second divisions. Almost two months passed from the previous round. That is due the next reasons: 1) I coordinated regular CF-round at the end of April; 2) about whole CP community were busy with preparing and competing in ACM ICPC WF in May; 3) at the beginning of this month I start to work at AimTech (I hope that I'll have enough time to continue prepare ERs). <It's need to read at least once maybe you'll find something interesting> The round will be unrated for all users and it will be held with extented ACM ICPC rules. You will have two hours to solve six problems. After that you will have one day to hack any solution you want. You will have access to copy any solution and test it locally. If you have ideas for some problems or maybe already prep...
Educational Codeforces Round 13, was prepared by me (Edvard Davtyan). Thanks to Tatiana Semyonova [user:Tatiana_S,2016-06-13] for, The round will be unrated for all users and it will be held with extented ACM ICPC rules. You will

Full text and comments »

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

56.
By peltorator, 6 years ago, In English
Hack risujiroh for $50 There's a really weird situation with the last Educational Codeforces Round 107. [user:risujiroh,2021-04-13] is top 1 but his solution for problem G is $\mathcal{O}(n^2)$. A bunch of people tried to hack him but all these tests work like 4.6 seconds and TL is 5 seconds. So here goes my challenge. I'm really interested in how to hack it so the first person who will hack [user:risujiroh,2021-04-13]'s solution in the next 24 hours (until April 14th 2021 19:15 UTC) will get $50 from me if you'll share your test generator with me. Good luck if you're interested! **UPD.** I'm sad to announce that nobody accomplished it. I wasn't expecting this scenario so I decided to donate $50 to charity. I chose [this](https://nasiliu.net/). It's a Russian organization that helps people to overcome domestic violence problems.
There's a really weird situation with the last Educational Codeforces Round 107. [user:risujiroh

Full text and comments »

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

57.
By BledDest, 14 months ago, In English
Kotlin Heroes 13 Announcement Greetings Codeforces! <img src="/predownloaded/06/ac/06ac0ca161da9600c032502a8e61c4f216557657.png" style="width:350px;float:right;margin:0 1em 1em 1em;"/> Ready to put your Kotlin skills to the test? Kotlin Heroes is your playground: a chance to experiment with the language's features, tackle fun and challenging problems, and level up your programming abilities. Perfect for beginners and experts alike! A massive shout-out to all the amazing coders who have competed in past Kotlin Heroes events: [Episode 1](https://codeforces.me/contests/1170,1171), [Episode 2](https://codeforces.me/contests/1211,1212), [Episode 3](https://codeforces.me/contests/1297,1298), [Episode 4](https://codeforces.me/contests/1346,1347), [Episode 5: ICPC Round](https://codeforces.me/contests/1432,1431), [Episode 6](https://codeforces.me/contests/1488,1489), [Episode 7](https://codeforces.me/contests/1533,1532), [Episode 8](https://codeforces.me/contests/1571,1570), [Episode 9](https://codeforce...
Kotlin Heroes 13 Announcement, test? Kotlin Heroes is your playground: a chance to experiment with the language's features, tackle

Full text and comments »

Announcement of Kotlin Heroes: Episode 13
Announcement of Kotlin Heroes: Practice 13
  • Vote: I like it
  • +122
  • Vote: I do not like it

58.
By jinlifu1999, 9 years ago, In English
Codeforces Round #460 (Div. 2) Hello, Codeforces! It's my honor to invite you to Codeforces Round #460 (Div. 2), which takes place at [13:05 UTC, January 31st](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+%23460+%28Div.+2%29&iso=20180131T2105&p1=33&ah=2). The round will be **rated** for all division 2 participants. Also we warmly welcome those division 1 participants to join us out of competition. Note that round starts in the unusual time! :) ![ ](http://img.uoj.ac/utility/bear-thinking.gif) This round is prepared by me and my friend [user:wuminyan0607,2018-02-04]. Many thanks to my friend for helping me testing the round and generating testcases. Besides, many thanks to the Codeforces coordinator [user:KAN,2018-01-29] for giving me a chance to hold this round, testers [user:cdkrot,2018-01-29], [user:cyand1317,2018-01-29], [user:demon1999,2018-01-31], [user:glebodin,2018-01-29], [user:gritukan,2018-01-31], [user:neckbosov,2018-01-29] for testing this round and [user:MikeMirzay...
Codeforces Round #460 (Div. 2), friend for helping me testing the round and generating testcases. Besides, many thanks to the

Full text and comments »

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

59.
By Acko, history, 6 years ago, In English
Mirror of Bubble Cup 13 Finals on Codeforces Hello, Codeforces! Hope you're all safe and well. [Microsoft Development Center Serbia](https://www.microsoft.com/sr-latn-rs/mdcs) is thrilled to announce the finals of the **13th edition of Bubble Cup competition**! Bubble Cup is an international, **ACM-style team contest** aimed at university and high school students. ![ ](/predownloaded/a2/f1/a2f1a7104558c3ac1e556158b2c033281f915b5c.png) Contest will take place on [Sunday, 4th of October at 11AM CEST](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Bubble+Cup+13+Finals&iso=20201004T11&p1=35&ah=3), virtually. Live results will be available on the official Bubble Cup website (results will be frozen during the last 45 minutes of the competition). Winners will be announced at the closing ceremony. You can find more info on the [BubbleCup website](https://www.bubblecup.org/). Just like the previous editions, this final will be followed by an online mirror competition on Codeforces. Mirror will take place on [Mon...
Mirror of Bubble Cup 13 Finals on Codeforces, /worldclock/fixedtime.html?msg=Bubble+Cup+13 +Finals&iso=20201004T11&p1=35&ah=3), virtually. Live, ]) for the round coordination, Mike Mirzayanov ([user:MikeMirzayanov,2020-10-01]) and the team behind

Full text and comments »

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

60.
By Edvard, history, 10 years ago, translation, In English
Educational Codeforces Round 14 Hello, Codeforces! Educational Codeforces Round 14 will take place on [13 July 2016 at 19:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Educational+Codeforces+Round+14&iso=20160614T1600) for the first and the second divisions. <I already have a long list of problems, so don't be upset if your problems wasn't used yet> The round will be unrated for all users and it will be held with extented ACM ICPC rules. You will have two hours to solve six problems. After that you will have one day to hack any solution you want. You will have access to copy any solution and test it locally. If you have ideas for some problems or maybe already prepared problems that you can't use in rounds or official competitions, you can write to me. It seems that it is harder to invent interesting simple problems (like A and B) than difficult ones. So don't be afraid to suggest interesting simple or very simple tasks (of course the difficult tasks are also needed). Please send onl...
Educational Codeforces Round 14, As I said the problem A is prepared by Arthur Jaworski [user:KingArthur,2016-07- 13]. All other

Full text and comments »

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

61.
By isaf27, 8 years ago, translation, In English
Mail.Ru Cup 2018 Round 1 ![ ](/predownloaded/13/b3/13b34cb749c0c7afb06d55eceae891af075a93fd.png) Hi all! I'm happy to welcome you at the Div.1 and Div.2 shared rated round [contest:1054], it will start at [contest_time:1054]. The problems were prepared by me — Ivan Safonov. I'd like to thank Dmitry [user:_kun_,2018-10-16] Sayutin for an idea and preparation of one of the problems and Egor [user:I_love_isaf27,2018-10-16] Gorbachev for an idea for another one. This round is the first round if the new championship called [Mail.Ru Cup](https://codeforces.me/blog/entry/62355), you can learn more about it following the link. The round will be rated for everybody! The championship feature the following prizes: - First place &mdash; **Apple MacBook Air** - Second and third place &mdash; **Apple iPad** - Fourth, fifth, sixth places &mdash; **Samsung Gear S3** - Traditionally, the top **100** championship participants will get cool **T-shirts**! In each round, top 100 participants get prize points ...
Mail.Ru Cup 2018 Round 1, ![ ](/predownloaded/13/b3/13b34cb749c0c7afb06d55eceae891af075a93fd.png) Hi all! I'm happy to

Full text and comments »

Announcement of Mail.Ru Cup 2018 Round 1
  • Vote: I like it
  • +241
  • Vote: I do not like it

62.
By nifeshe, 22 months ago, In English
Codeforces Round 997 (Div. 2) Hi, Codeforces! I'm delighted to invite you to the best/second best/third best round of 2025 so far! [contest:2056] will be held on [contest_time:2056]. You will be presented with **at least** $6$ and **at most** $6$ problems, one of which might be divided into two subtasks, and $2$ hours to solve them. Many of you may not believe it, but the problems were authored and written by [user:nifeshe,2025-01-14] with a great help from [user:maomao90,2025-01-14]. Moreover, I would like to thank: - [user:maomao90,2025-01-14] for coordinating the round and helping with tasks ideas/preparation. - [user:Alexdat2000,2025-01-14] for translating the problems to Russian. - All of our testers: [user:errorgorn,2025-01-14], [user:A_G,2025-01-14], [user:LipArcanjo,2025-01-14], [user:_istil,2025-01-14], [user:Markadiusz,2025-01-14], [user:Error_Yuan,2025-01-14], [user:Intellegent,2025-01-14], [user:mwen,2025-01-14], [user:LMeyling,2025-01-14], [user:hazzlek,2025-01-14], [user:iLoveIOI,2025-0...
Codeforces Round 997 (Div. 2), Hi, Codeforces! I'm delighted to invite you to the best/second best/third best round of 2025 so

Full text and comments »

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

63.
By MathModel, history, 8 months ago, In English
Invitation to Eolymp Weekend Practice #20 ### **Hello Codeforces!** ------------------ We're excited to invite you to [Weekend Practice round #20](https://basecamp.eolymp.com/contests/4pe1cne4r571j089budf65juq4) , taking place on [**15th March, at 15:00 UTC**](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20260315T1500&ah=2&am=0&msg=Weekend%20Practice%20%2320). This is a **rated** contest at Eolymp. ## Format and Difficulty Same as in previous rounds, the competition is primarily aimed at improving practical skills. **There will be $\LARGE \color{red}{\textbf{2}}$ hours for $5$ tasks** of varying difficulty, the easiest of which can even be solved by beginners. The scoring for each task being block-based (meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block). If there is a tie between two participants, the one whose last productive submission (i.e., a submission that added at least one point) was made earlier will be ranked higher...
;. - [user:Connectus,2025-12-29] For Coordinating The Round and authoring problems. - [user:Denisov,2026-03-13, ] For Coordinating The Round and authoring problems. - [user:Denisov,2026-03-13 ] , [user:Connectus

Full text and comments »

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

64.
By BigBag, 6 years ago, In English
Weak test cases for problem G from Grakn Forces, or how did I hack tourist Today I was upsolving a problem [problem:1408G] from the recent Grakn Forces 2020 contest. I've solved it, however I didn't really like my solution. So I decided to view how other participants solved this problem. Of course, I first opened the [user:tourist,2020-10-02]'s submission ([submission:94320762]), because his codes are always written in a good style and are easy to understand. But when I carefully looked through his solution, I was a little bit confused, because he used the idea, which I supposed to be wrong. The idea is the following: computers with indices $x_1$, $x_2$, $\ldots$, $x_k$ form a valid set, iff for each $i \in$ {$x_1, x_2, \ldots, x_k$}, values $a[i][x_1]$, $a[i][x_2]$, $\ldots$, $a[i][x_k]$ are smaller then all $a[i][j]$, where $j \notin$ {$x_1, x_2, \ldots, x_k$}. It's obvious that it's a necessary condition for being a valid set, and while solving this problem I first thought, that it can be also a sufficient condition. But after thinking a little bit...
Weak test cases for problem G from Grakn Forces, or how did I hack tourist, the contest on that test case, and 13 of them turned out to be [wrong](https://codeforces.me/contest

Full text and comments »

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

65.
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 76 [Rated for Div. 2] Hello Codeforces! On [contest_time:1257] [contest:1257] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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. The problems were invented and prepared by Roman [user:Roms,2019-10-23] Glazov, Adilbek [user:adedalic,2019-10-23] Dalabaev, Vladimir [user:Vovuh,2019-10-23] Petrov, Ivan [user:Bl...
Educational Codeforces Round 76 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

66.
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 111 [Rated for Div. 2] Hello Codeforces! On [contest_time:1550] [contest:1550] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 [user:adedalic,2021-07-13] Dalabaev, Vladimir [user:vovuh,2021-07-13] Petrov, Ivan [user:BledDest,2021-07-13] Androsov, Mak...
Educational Codeforces Round 111 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

67.
By scott_wu, 11 years ago, In English
8VC Venture Cup 2016 — Elimination Round Hello everyone! The first round of the 8VC Venture Cup will be held on [Saturday, February 13th at 12:35PM EST](http://www.timeanddate.com/worldclock/fixedtime.html?day=13&month=2&year=2016&hour=20&min=35&sec=0&p1=166). [user:ecnerwal,2016-02-13] and I are the problem setters. We want to thank [user:GlebsHP,2016-02-13] for his help in preparing the contest, [user:Delinur,2016-02-13] for translating the problems, and [user:MikeMirzayanov,2016-02-13] for creating the Codeforces platform The contest is for competitors in both divisions and contains seven problems. The scoring distribution is as follows: 500 &mdash; 750 &mdash; 1000 &mdash; 1500 &mdash; 2000 &mdash; 2500 &mdash; 3000 The contest will be slightly longer than usual &mdash; two and a half hours. The top 200 contestants will advance to the final round, and the top 20 local finishers will be invited to Woodside, CA to compete onsite. Good luck! **UPD:** System testing is now over. Congratulations to the top contest...
8VC Venture Cup 2016 — Elimination Round, Hello everyone! The first round of the 8VC Venture Cup will be held on [Saturday, February 13th at

Full text and comments »

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

68.
By BledDest, history, 6 years ago, translation, In English
Educational Codeforces Round 96 [Rated for Div. 2] Hello Codeforces! On [contest_time:1430] [contest:1430] will start. **Note that the start time is unusual**. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 [user:adedalic,2020-10-10] Dalabaev, Alex [user:fcspartakm,2020-10-10] Frolov an...
Educational Codeforces Round 96 [Rated for Div. 2], /entry/51208">blog post. This round will be **rated for the participants with rating lower than

Full text and comments »

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

69.
By Ecrade_, 20 months ago, In English
Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial Sorry for the late editorial. Our problem setters were so exhausted with the offline competition yesterday that they really need some good rest. Despite the unexpected and unpleasant incidents that occurred, we are truly surprised and grateful that so many of you still participated in this competition! We sincerely hope you enjoyed it! (Gratitude for all you guys from [user:Ecrade_,2025-03-16]: I felt so heartbroken when I heard about the unexpected issues, but seeing so many people in the comments comforting us, sharing thoughtful and positive messages that showed genuine empathy, and continuing to fully support our competition even after the wasted time, I was deeply moved. Thank you all! Codeforces truly embodies such a positive and uplifting community spirit!) [problem:2082A] <br> Idea: [user:Ecrade_,2025-03-16] <spoiler summary="Hint"> Do we really have to consider the problem on the whole matrix? </spoiler> <spoiler summary="Solution"> Let $r$ be the num...
Codeforces Round 1010 (Div. 1, Div. 2, based on Zhili Cup 2025) Editorial, $\mathcal O\left(\frac{n^{0.75}}{\log n}\right)$, it could pass the test cases of $N\le 10^{11, | 0.085s | | $10^{13

Full text and comments »

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

70.
By SlavicG, 4 years ago, In English
Codeforces Round #827 (Div. 4) Hello Codeforces! [user:mesanu,2022-06-12], [user:flamestorm,2022-10-11], [user:MikeMirzayanov,2022-06-12] and I are glad to invite you to [contest:1742]! It starts on [contest_time:1742]. The format of the event will be identical to Div. 3 rounds: - 5-8 tasks; - ICPC rules with a penalty of 10 minutes for an incorrect submission; - 12-hour phase of open hacks after the end of the round (hacks do not give additional points) - after the end of the open hacking phase, all solutions will be tested on the updated set of tests, and the ratings recalculated - by default, only "trusted" participants are shown in the results table (but the rating will be recalculated for all with initial ratings less than 1400 or you are an unrated participant/newcomer). We urge participants whose rating is 1400+ not to register new accounts for the purpose of narcissism but to take part unofficially. Please do not spoil the contest for the official participants. Only _trusted participants o...
Codeforces Round #827 (Div. 4), - [user:pashka,2022-10-13], [user:keta_tsimakuridze,2022-10-11], [user:Gheal,2022-10-11, round (hacks do not give additional points) - after the end of the open hacking phase, all solutions

Full text and comments »

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

71.
By Arpa, history, 10 years ago, In English
Codeforces Round #383 editorial Hello again, and hope you have been Joon-Joon of the round :P **I’m preparing harder version of some of the problems (Div.2 A, B, and Div.1 A, D) and I’ll put them on some gym, so if you are interested in harder version of problems please wait for about one week.** You can see and download the problem archives (pretests, **tests**, statements, validator, checker, **solutions**) [here](https://mega.nz/#F!GoB1gCjK!fE_6d5qSSiqt_HMxAmV9GQ). You can see solutions in solutions folder, note that there are several codes there, there is a descriptor for each code (.desc) that shows the verdict of that code. Preparation details: -------------------- On 25 May [user:Sa1378,2016-12-06] came up with problem Div.1 D and other problems authored inchmeal. 9/25/16: Proposal sent to Gleb. 11/12/16: Answer from Gleb: Your proposal has been redirected to Nikolay [user:KAN,2017-06-02]. 11/15/16: Nikolay has replied, and commented about problems, saying some problems are easy, s...
Codeforces Round #383 editorial, Hello again, and hope you have been Joon-Joon of the round :P **I’m preparing harder version of

Full text and comments »

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

72.
By antontrygubO_o, 4 years ago, In English
Problems that I authored so far **UPD 1 [May 17 2025]:** I added my problems from Ukrainian Olympiad in Informatics (among others). They are available here: [contest:105820] Hi everyone! I wanted to write such a blog for a long time, motivated by similar blogs [by](https://codeforces.me/blog/entry/108940) [user:adamant,2023-02-20] and [by](https://codeforces.me/blog/entry/108595) [user:tibinyte,2023-02-20]; I finally decided to do it after my Universal Cup contest. This is not a super-comprehensive list, I also set some problems for some local contests, but that's most of it. I want to encourage other setters to write such blogs. For me, it's very interesting to read about the backstories of some problems and also to see all the problems by some author gathered in one place (as most authors give problems to several platforms). One important point. As you will see from the comments, many of my problems were improved by other people, and I myself improved some problems by other people. I think that it's cruc...
/problem/B) | Codeforces Round #580 (Div. 2) | | | 13 | August 2019 | [Almost Equal](https

Full text and comments »

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

73.
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 102 [Rated for Div. 2] Hello Codeforces! On [contest_time:1473] [contest:1473] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 Roman [user:Roms,2021-01-13] Glazov, Adilbek [user:adedalic,2021-01-13] Dalabaev, Vladimir [user:vovuh,2021-01-13] Petrov, Ivan [us...
Educational Codeforces Round 102 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

74.
By awoo, history, 9 years ago, translation, In English
Educational Codeforces Round 30 Hello Codeforces! On [October 12, 17:05 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?day=12&month=10&year=2017&hour=17&min=5&sec=0&p1=166) Educational Codeforces Round 30 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the [blog post](http://codeforces.me/blog/entry/51208). The round will be **unrated** for all users and will be held on extented ACM ICPC rules. After the end of the contest you will have one day 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 prepared by Ivan [user:BledDest,2017-10-11] Androsov, Vladimir [user:0n25,2017-10-11] Petrov, Mike [user:MikeMirzayanov,2017-10-11] Mirzayanov and me. Good luck to all partic...
Educational Codeforces Round 30, /fixedtime.html?day=12&month=10&year=2017&hour=17&min=5&sec=0&p1=166) Educational CodeforcesRound 30 will start

Full text and comments »

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

75.
By TheEvilBird, 9 months ago, translation, In English
Codeforces Round #1078 (Div.2, based on Moscow Olympiad for Young Students, rated) 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 [contest:2194] based on the problems of this olympiad, which will take place on [contest_time:2194]. **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 [user:silvvasil,2026-02-06], [user:Semen07,2026-02-06], [user:allvik66,2026-02-06], [user:dope,2026-02-06], [user:teraqqq,2026-02-06] guided by [user:TheEvilBird,2026-02-06], [user:grphil,2026-02-06] and Helen Andreeva. Thanks to [user:FairyWinx,2026-02-06] for the round coordination, and also thanks for [user:MikeMirzayanov,2026-02-06] и [user:KAN,2026-02-06] for C...
Codeforces Round #1078 (Div.2, based on Moscow Olympiad for Young Students, rated), ], [user:FelixArg,2026-02-07] for testing the round; - [user:RP-1,2026-02-06], [user:stepanov.aa,2026-02

Full text and comments »

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

76.
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 100 [Rated for Div. 2] Hello Codeforces! On [contest_time:1463] [contest:1463] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 Roman [user:Roms,2020-12-16] Glazov, Adilbek [user:adedalic,2020-12-16] Dalabaev, Vladimir [user:vovuh,2020-12-16] Petrov, Ivan [us...
Educational Codeforces Round 100 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

77.
By wakanda-forever, 13 months ago, In English
Codeforces Round 1059 (Div. 3) ### Hello, Codeforces! I am very excited to invite you to our contest [Codeforces Round 1059 (Div. 3)](https://codeforces.me/contest/2162), which starts on [contest_time:2162]. You will be given $2$ hours and $15$ minutes to solve $8$ problems. The problems were authored and prepared by [user:wakanda-forever,2025-10-10], [user:wuhudsm,2025-10-10], [user:tridipta2806,2025-10-10] and [user:tamzid1,2025-10-10]. Note that at least one of the problems will be interactive. So if you are unfamiliar with them, please read the [guide for interactive problems](https://codeforces.me/blog/entry/45307) before the contest. The round will be hosted by the rules of educational rounds (extended <b>ICPC</b>). Thus, all solutions will be judged on preliminary tests during the round, and after the round, there will be a <b>12-hour phase</b> 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 —...
Codeforces Round 1059 (Div. 3), included in the final set. - [user:Dominater069,2025-10-10] for LGM testing. - [user:__baozii__,2025, ### Hello, Codeforces! I am very excited to invite you to our contest [CodeforcesRound 1059

Full text and comments »

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

78.
By awoo, 6 years ago, translation, In English
Educational Codeforces Round 97 [Rated for Div. 2] Hello Codeforces! On [contest_time:1437] [contest:1437] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 Roman [user:Roms,2020-10-26] Glazov, Adilbek [user:adedalic,2020-10-26] Dalabaev, Vladimir [user:vovuh,2020-10-26] Petrov, Ivan [us...
Educational Codeforces Round 97 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

79.
By Proof_by_QED, 8 months ago, In English
Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2) # Hello Codeforces _After countless nights of yapping, bedfight duels, and failed zero cycles_ The authors of the [three](https://codeforces.me/contest/2124) [best](https://codeforces.me/contest/2190) [Div. 1](https://codeforces.me/contest/2201) of all time, [user:nifeshe,2026-03-18], [user:chromate00,2026-03-18], and I, have joined forces to create the Division $1+2$ round that will break the internet: [contest:2211], which will be held on [contest_time:2211]. This round will be combined for Division $1$ and Division $2$ and will be rated for everyone. You will have $2.5$ hours to solve $8$ problems. Between $6$ and $7$ problems will not be split into subtasks. Also, between $6$ and $7$ problems will not be interactive, so you are recommended to read the [guide](https://codeforces.me/blog/entry/45307) to interactive problems if you have not encountered them before. We would like to thank the following people for making the contest possible: - [user:Um_Nik,2026-03-2...
Nebius Round 2 (Codeforces Round 1088, Div. 1 + Div. 2), ], [user:chromate00,2026-03-18], and I, have joined forces to create the Division $1+2$round that will

Full text and comments »

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

80.
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 68 [Rated for Div. 2] Hello Codeforces! On [contest_time:1194] [contest:1194] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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. The problems were invented and prepared by Roman [user:Roms,2019-07-13] Glazov, Adilbek [user:adedalic,2019-07-13] Dalabaev, Vladimir [user:Vovuh,2019-07-13] Petrov, Ivan [user:Bl...
Educational Codeforces Round 68 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

81.
By Ari, history, 6 years ago, In English
Codeforces Round #715 Editorial <strike>Note: I can't figure out how to place the tutorials inside spoilers. If someone is familiar with how CF spoilers work and can help I would really appreciate it. For now, be warned that the tutorials are visible by default (but everything else isn't)</strike> **UPD:** I figured out how to use spoilers! Also added implementations for all problems. Thanks for participating in our contest! [problem:1509A] Author: [user:Kuroni,2021-04-13] <br> First solve: [user:cfg0d,2021-04-16] at 00:01:02 <spoiler summary = "Hint"> How can you write the condition that $\frac{a_u + a_v}{2}$ is an integer in a more useful way? Think of the parities. </spoiler> <spoiler summary = "Tutorial"> [tutorial:1509A] </spoiler> <spoiler summary = "Comments from the authors"> ![ ](https://i.imgur.com/voR4hTu.png) </spoiler> [Implementation](https://codeforces.me/contest/1509/submission/113263196) [problem:1509B] Author: [user:Ari,2021-04-13] <br> First solve: [user:bl...
Codeforces Round #715 Editorial, contest! [problem:1509A] Author: [user:Kuroni,2021-04-13] First solve: [user:cfg0d,2021-04

Full text and comments »

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

82.
By vovuh, history, 8 years ago, translation, In English
Codeforces Round #515 (Div. 3) After the long delay (disease, conference and many other things) the new Div.3 round is coming! &lt;copy-pasted-part&gt; Hello! [contest:1066] will start at [contest_time:1066]. You will be offered 6 or 7 problems with expected difficulties to compose an interesting competition for participants with ratings up to 1600. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially. The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests &mdash; just like you will be upset if many solutions fail after the contest is over. [cut] You will be given 6 or 7 problems and 2 hours to solve them. Note th...
Codeforces Round #515 (Div. 3), [user:BledDest,2018-10-11] Androsov for help in round preparation and testing theround. Good luck

Full text and comments »

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

83.
By AlexSkidanov, history, 8 years ago, In English
Codeforces Round #488 by NEAR **UPD** note that the score distribution has changed **UPD2:** [user:LHiC,2018-06-17] found a bug in the author solution of div1-F. We are working on the situation. **UPD3:** we found a correct solution for div1-F and both submissions made during the contest pass all the tests against the correct solution. The round remains rated. Hi, everybody, Codeforces round 488 for both divisions will take place on [contest_time:993]. The round will be 2.5 hours long (which is 30 minutes longer than usual). The contest is created by [NEAR](http://near.ai/blog) and its friends. NEAR is working on teaching machines to compete in programming competitions. Read [our blog post](http://codeforces.me/blog/entry/59746) to learn more about the state of the art in the program synthesis today, our vision, and how you can help us bring this vision to reality. The contest will feature 6 problems for each division, with 4 problems shared across them. The problems for the contest are from t...
Codeforces Round #488 by NEAR, correct solution. The round remains rated. Hi, everybody, Codeforces round 488 for both divisions

Full text and comments »

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

84.
By kuviman, 10 years ago, translation, In English
Russian AI Cup 2016 — CodeWizards Hey everyone! Good news &mdash; Russian AI Cup 2016 has started! This competition is being held for the fifth time, and this time, hopefully, we will make happy all the fans of the MOBA game genre &mdash; you will be controlling a wizard, and together with 4 teammates you will try to destroy enemy base with magic and help of minions. Try yourself in creating an artificial intelligence, it's simple and fun. Go to [Russian AI Cup site](http://russianaicup.ru) and enter the battle. Good luck! ### What is it? **Russian AI Cup** &mdash; largest annual artificial intelligence programming contest in Russia, and third open competition for talented IT-specialists that is part of Mail.Ru Group strategy of forming and developing competitive Russian IT-industry on a global scale. Following programming languages are supported: C++, C#, Java, Pascal, Python 2, Python 3 и Ruby. Anyway, as previously, we are ready to support language packages, realized by the community. We welcome bo...
on November 13 at 21:00; - **Round 1**: November 25, 21:00 UTC — November 27, 21:00 UTC, . Rating in the Sandbox will be reset on November 13 at 21:00; - **Round 1**: November 25, 21:00

Full text and comments »

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

85.
By GlebsHP, history, 11 years ago, In English
Yandex Algorithm Round 2.2 problems analysis Good evening Codeforces, let me briefly describe solutions for all problems of today's morning yandex algorithm round. Thanks everyone who participated, I apologize for making problems a bit too tough and viscous for a 100 minutes contest. Anyway, I hope everyone found something interesting. I would like to thank [user:lperovskaya,2015-06-13] for organising this competition and managing Yandex.contest, [user:snarknews,2015-06-13] and [user:sergeifedorov,2015-06-13] for their help with the problemset, [user:endagorion,2015-06-13], [user:PavelKunyavskiy,2015-06-13], [user:AleX,2015-06-13], [user:glebushka98,2015-06-13], [user:gustokashin,2015-06-13], [user:map,2015-06-13] and [user:boris,2015-06-13] for testing. Special thanks to [user:gassa,2015-06-13] and my girlfriend Marina Kruglikova for fixing mistakes and disambiguations in English and Russian statements. Let's get it started. ### Problem A. Odysseus Sails Home. There is no tricky idea behind this problem: one just need...
Yandex Algorithm Round 2.2 problems analysis, [user:boris,2015-06-13] for testing. Special thanks to [user:gassa,2015-06-13] and my girlfriend Marina, ,2015-06-13] for testing. Special thanks to [user:gassa,2015-06-13] and my girlfriend Marina

Full text and comments »

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

86.
By vovuh, history, 8 years ago, In English
Codeforces Round #560 (Div. 3) I have nothing to say this time, so meet yet another Div. 3 round :) &lt;almost-copy-pasted-part&gt; Hello! [contest:1165] will start at [contest_time:1165]. You will be offered 6 or 7 problems (or 8) with expected difficulties to compose an interesting competition for participants with ratings up to 1600. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially. The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests &mdash; just like you will be upset if many solutions fail after the contest is over. You will be given 6 or 7 (or 8) problems and 2 hours to solve them. Note that **the penalty*...
Codeforces Round #560 (Div. 3), -10-11] Androsov for help in round preparation and testing the round. Good luck! I also would

Full text and comments »

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

87.
By Dormi, history, 5 years ago, In English
Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial [problem:1534A] Author: [user:Crackersamdjam,2021-06-13] <spoiler summary="Hint 1"> Let's say you know the colour of the first square, what colours can you figure out next? </spoiler> <spoiler summary="Hint 2"> Colour it like a chessboard, but there's more than one possible chessboard! </spoiler> <spoiler summary="Hint 3"> Brute force the color of the first square! </spoiler> <spoiler summary="Tutorial"> [tutorial:1534A] </spoiler> <spoiler summary="Solution"> [submission:119400830] </spoiler> [problem:1534B] Author: [user:Dormi,2021-06-13] <spoiler summary="Hint 1"> Consider the contribution of each pillar to the answer. </spoiler> <spoiler summary="Hint 2"> How does doing the operation on a pillar change the contribution to the answer? </spoiler> <spoiler summary="Hint 3"> You only want to do an operation on a pillar if the top cell contributes 2 to the answer. </spoiler> <spoiler summary="Tutorial"> [tutorial:1534B] </spoiler> ...
Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) Editorial, [problem:1534A] Author: [user:Crackersamdjam,2021-06-13] Let's

Full text and comments »

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

88.
By BledDest, 5 years ago, In English
Educational Codeforces Round 115 [Rated for Div.2] Hello Codeforces! On [contest_time:1598] [contest:1598] will start. **Note that the start time is unusual**. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 Alex [user:fcspartakm,2021-10-09] Frolov, Mikhail [user:awoo,2021-10-09] Piklyaev, Max [...
Educational Codeforces Round 115 [Rated for Div.2], /entry/51208">blog post. This round will be **rated for the participants with rating lower than

Full text and comments »

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

89.
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 88 [Rated for Div. 2] Hello Codeforces! On [contest_time:1359] [contest:1359] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 Roman [user:Roms,2020-05-27] Glazov, Adilbek [user:adedalic,2020-05-27] Dalabaev, Vladimir [user:vovuh,2020-05-27] Petrov, Ivan [us...
Educational Codeforces Round 88 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

90.
By HolkinPV, 13 years ago, translation, In English
Codeforces Round #246 (Div. 2) Editorial ###[problem:432A] In this problem you should count number of students who can participate in ACM, divide it by 3 and round down. It could be done like this: int cnt = 0; for(int i = 0; i < n; i++) if (5 - a[i] >= k) cnt++; int ans = cnt / 3; ###[problem:432B] Count for every team number of games in home kit. For team $i$ it equals to sum of $n - 1$ games at home and some away games with such teams which home kit color equals away kit color of team $i$. To count number of such away games you could calc array $cnt[j]$ &mdash; number of teams with home color kit $j$. The solution could be implemented in this wasy: for(int i = 0; i < n; i++) cnt[ x[i] ]++; for(int i = 0; i < n; i++) { ans_home[i] = n - 1; ans_home[i] += cnt[ y[i] ]; ans_away[i] = 2 * (n - 1) - ans_home[i]; } ###[problem:432C] The solution can be described by pseudo-code: 1. Consider elements...
Codeforces Round #246 (Div. 2) Editorial, $sum[L] + 1$. ###[problem:432E] This is popular test 6 :) 13 5 AAAAA, Choose the best case from these cases. Try to get the answer on test $n=13$ $m=5$ to understand the

Full text and comments »

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

91.
By MidnightCodeCup, 17 months ago, In English
Midnight Code Cup Finals 2025 This weekend concluded the first season of the Midnight Code Cup with a long-awaited 24-hour contest. 29 teams – the best from the qualification round, including the qualification winners **Omogen Heap** – competed on-site in Belgrade, Serbia, on June 7-8. Team **Omogen Heap** jumped into first place around the midpoint of the contest and held the title until the very end. Congratulations to our first Midnight Code Cup champions on their dominant performance! Second place went to team **GoodBye2023**, and **Jinotega** finished in third. <img src="/predownloaded/e9/4e/e94e30de980b4d744d2ab445f30b58727f6a5871.jpg" align="left" style="width: 100%;" alt="Omogen Heap"/> <img src="/predownloaded/29/50/2950dfc71ef7a653721f8eb8830c0d79e3cc43b1.jpg" align="left" style="width: 50%;" alt="GoodBye2023"/><img src="/predownloaded/ab/d2/abd21f99c60852c6891a0ef545fbf8dd30370a93.jpg" align="left" style="width: 50%;" alt="Jinotega"/> <spoiler summary="Finalists"> 1 Omogen Heap: 23125.99 ...
contest. 29 teams – the best from the qualification round, including the qualification winners **Omogen

Full text and comments »

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

92.
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 101 [Rated for Div. 2] Hello Codeforces! On [contest_time:1469] [contest:1469] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 Roman [user:Roms,2020-12-27] Glazov, Adilbek [user:adedalic,2020-12-27] Dalabaev, Vladimir [user:vovuh,2020-12-27] Petrov, Ivan [us...
Educational Codeforces Round 101 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

93.
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 80 [Rated for Div. 2] Hello Codeforces! On [contest_time:1288] [contest:1288] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 invented and prepared by Roman [user:Roms,2020-01-13] Glazov, Adilbek [user:adedalic,2020-01-13] Dalabaev, Vladimir [user:Vovuh,2020-01-13] Petrov, Ivan [user:Bl...
Educational Codeforces Round 80 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

94.
By MathModel, history, 9 months ago, In English
Invitation to Eolymp Blitz 13 ### Hello Codeforces! We're glad to invite you to the [**Eolymp Blitz Round #13**](https://basecamp.eolymp.com/contests/8s2s6873uh0dhfjutk9piccj5o) on [**22nd February 2026, at 11:30 UTC**](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20260222T1130&ah=1&am=30&msg=Blitz%20Round%20%2313), a regular programming contest for beginners! This is rated competition for members with rating $\le 1750$. ## Format and Difficulty The competition is meant help you get started with competitive programming and improve your problem solving skills. You will be given **1.5 hours** to solve **5 problems** of easy difficulty. The scoring for each task being block-based, meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block. If there is a tie between two participants, the one whose last productive submission (i.e., a submission that added at least one point) was made *earlier* will be ranked higher in the leaderboar...
Invitation to Eolymp Blitz 13, ### Hello Codeforces! We're glad to invite you to the [**Eolymp Blitz Round #13 **](https, - [user:mathmodel,2025-12-20] for coordinating the round. - [user:Mohammed_Nasserr,2026-01-18] and

Full text and comments »

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

95.
By awoo, history, 9 months ago, translation, In English
Educational Codeforces Round 187 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Computer Science and Artificial Intelligence (CSAI)] (https://lp.jetbrains.com/academy/csai-program/) program at [Neapolis University Pafos](https://www.nup.ac.cy/), with scholarships provided by JetBrains. [contest:2203] will start on [contest_time:2203]. 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-7 problems** and **2 hours** to solve them. The problems were invent...
Educational Codeforces Round 187 [Rated for Div. 2], ] will start on [contest_time:2203]. This round will be **rated for the participants with rating

Full text and comments »

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

96.
By kostka, 12 years ago, In English
Hack me! (CF Round #263, Div. 2) Welcome again! I decided to split statistics for both division. Post for first division <strike>will be added later</strike> is <a href="http://codeforces.me/blog/entry/13572">here</a>. So, let's look at hacks in [contest:462]. <small><strike>Some statistics are missing &mdash; I have some problems with downloading all data (Codeforces seems little crowded today). They will be also added later.</strike></small> **Update**: Europe went asleep, so I added missing stats. [cut] <h3>Stats</h3> Problem | Successful hacks | Unsuccessful hacks | Other | Sum | :---:|:---:|:---:|:---:|:---:| [problem:462A] | 5 (17%) | 25 (83%) | 0 (0%) | 30 | [problem:462B] | 1193 (71%) | 188 (11%) | 306 (18%) | 1687 | [problem:462C] | 0 (0%) | 55 (36%) | 98 (64%) | 153 | ### Fastest hackers Problem | Time | Hacker | Defender | Hack :---:|:---:|:---:|:---:|:---:| [problem:462A] | 00:50:08 | [user:ak.bewildered,2014-08-26] | [user:abdohammam95,2014-08-26] | <a href="http://codefo...
Hack me! (CF Round #263, Div. 2), didn't pass test #13. Unfortunately, we cannot look at it, because it is too big., test #13. Unfortunately, we cannot look at it, because it is too big. Most of these solutions

Full text and comments »

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

97.
By MathModel, history, 13 months ago, In English
Invitation to Eolymp Weekend Practice #13 ### **Hello Codeforces!** ------------------ I'm excited to invite you to [Weekend Practice round #13](https://eolymp.com/en/contests/4usu8j57353kj76bh7mj7dv4jk) , taking place on [**9th November, at 14:00 UTC**](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20251109T1500&ah=2&am=30&msg=Weekend%20Practice%20%2313). This is a **rated** contest at Eolymp. ## Format and Difficulty Same as in previous rounds, the competition is primarily aimed at improving practical skills. There will be $2$ hours for $5$ tasks of varying difficulty, the easiest of which can even be solved by beginners. The scoring for each task being block-based (meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block). If there is a tie between two participants, the one whose last productive submission (i.e., a submission that added at least one point) was made earlier will be ranked higher in the leaderboard. The statements...
Invitation to Eolymp Weekend Practice #13, Practice round #13](https://eolymp.com/en/contests/4usu8j57353kj76bh7mj7dv4jk) , taking place on [**9th, ## Credits - [user:MathModel,2025-10-16] For Coordinating The Round 😎. - [user:De3b0o

Full text and comments »

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

98.
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 47 [Rated for Div. 2] Hello Codeforces! On [contest_time:1009] Educational Codeforces Round 47 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM ICPC rules. 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. The problems were invented and prepared by Ivan [user:BledDest,2018-07-13] Androsov, Vladimir [user:Vovuh,2018-07-13] Petrov, Maksim [user:Ne0n25,2018-07-13] Mescheryakov, Aslan [user:ag2cidk,2018-07-13] Tamaev and me. Good luck to all participants! ...
Educational Codeforces Round 47 [Rated for Div. 2], Hello Codeforces! On [contest_time:1009] Educational Codeforces Round 47 will start. Series

Full text and comments »

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

99.
By Sammarize, 12 years ago, translation, In English
Way of problemsetter *The mystery of creating rounds unveiled by author of the 4 of them! The guide for preparing the round without horror-fiction and pastorals!* Thanks for [user:RodionGork,2014-06-13], who push me to writing this post and thanks for [user:lucAbalo,2014-06-13], who push [user:RodionGork,2014-06-13] to pushing me to writing this post. Also, many thanks to [user:RodionGork,2014-06-13] for the translation of this post to English. ##1. Inventing problems It's hard to advise anything on this point. There's no some standard way of creating problems &mdash; and if one have existed we'll have only "complicated algorithmic exercises" instead of "problems". People who participated in Russian Code Cup do know well the tasks of that sort. To cook good and interesting problem there should be some **idea!** which came to your mind (and later to minds of participants of the contest). Even the simplest problems of `A` level for the `Div2` should have some **idea**. So here is the war...
round without horror-fiction and pastorals!* Thanks for [user:RodionGork,2014-06-13], who push

Full text and comments »

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

100.
By vepifanov, 10 years ago, translation, In English
Intel Code Challenge Final Round (div.1 + div.2 combined) + Photos Intel Code Challenge Final Round will take place on [Saturday, 8 October 15:05 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Intel+Code+Challenge+Final+Round+%28div.1+%2B+div.2+combined%29&iso=20161008T1505&p1=166). **All users of the Codeforces can participate in it as in an usual round. The round will be rated and both divisions can participate. Pay attention to the time of the beginning of the round.** There will be 7 problems with statements in english and russian languages and 3 hours to solve them. Scoring distribution will be announced closer to the start of the round. The problems were prepared by me — Vladislav Epifanov ([user:vepifanov,2016-10-07]). I want to say thanks to Alexey Shmelev ([user:ashmelev,2016-10-07]), Alexander Fetisov ([user:alexfetisov,2016-10-07]) and Vladislav Isenbaev ([user:winger,2016-10-07]) for testing the problems, coordinator of the Codeforces Gleb Evstropov ([user:GlebsHP,2016-10-07]) for his help with the contest preparat...
Intel Code Challenge Final Round (div.1 + div.2 combined) + Photos, Intel Code Challenge Final Round will take place on [Saturday, 8 October 15:05 MSK](http

Full text and comments »

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

101.
By thematdev, history, 6 years ago, In English
Educational 106 problem D time limit and hacks Hi, Codeforces! I have 13 successful hacks of problem D on last round, and also my solution is TLed(probably on one of my tests :)), and i am going to show you, how it works. So we have two parts of solution. The first is to precalculate lowest divisor of each number. It can be done with simple Eratosthenes sieve, which has time complexity $O(N \log N)$ if you do sieve loop for all numbers, and $O(N \log \log N)$ if you do loop only when number is prime. It can also be done with $O(N)$ time and memory using linear sieve. Second part is the answer calculation, you need to add $2^k$, where $k$ -- number of different prime divisors. So if you haven't precalucated it on sieve step, it will be $O(\log x)$ per divisor, otherwise it will be $O(1)$. Now we will try to adjust numbers $c, d, x$ to hack $O(t\sqrt{x} \log x + N \log \log N)$ solution. Because we are counting distinct prime factors of numbers like $\frac{\frac{x}{d_x} + d}{c}$, we will use $c = 1$. And we are facto...
Hi, Codeforces! I have 13 successful hacks of problem D on last round, and also my solution is

Full text and comments »

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

102.
By unstoppable_N, history, 5 years ago, In English
CoDeft 2.0, organised by CP Club, AIT Pune Hello Codeforces,<br> **Competitive Programming Club, AIT Pune** is excited to invite you to [**CoDeft 2.0**](https://www.codechef.com/CDFT2022) which will take place on [Monday, April 18, 2022 at 21:00 IST](https://www.timeanddate.com/worldclock/fixedtime.html?msg=CoDeft+2.0&iso=20220418T21&p1=176&ah=2). This contest will be an **ICPC styled** contest to provide an exciting learning platform to showcase your CP skills. Many thanks to all the people who made this contest possible: - Problem Setters: [user:RohitRKS,2022-04-13], [user:marksman_,2022-04-13], [user:_AbRn_,2022-04-13] and [user:Free_Electron_,2022-04-13]. - [user:unstoppable_N,2022-04-13], [user:codeict,2022-04-13], [user:fake_name,2022-04-13] and [user:_hecxoc,2022-04-13] for testing and providing detailed feedback that improved the quality and balance of the round significantly. - [user:CodeSlayer007,2022-04-13] for coordinating the event! This event will be held in 2 stages: **Qualifiers** - Date & Time...
], [user:fake_name,2022-04-13] and [user:_hecxoc,2022-04-13] for testing and providing detailed

Full text and comments »

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

103.
By glebustim, 4 years ago, translation, In English
Codeforces Round #814 ### Hello, Codeforces! [user:SomethingNew,2022-08-13] and I are glad to invite you to [contest:1718] and [contest:1719], which will take place on [contest_time:1718]. Each division will have 6 problems and 2 hours to solve them. We would like to thank: - [user:74TrAkToR,2022-08-14] for excellent coordination and for the idea of a problem for Div. 2. - [user:pakhomovee,2022-08-14] for idea and preparation of one of the problems for Div. 1, and for testing other problems of the contest. - [user:Um_nik,2022-08-14], [user:mhq,2022-08-14], [user:turmax,2022-08-14], [user:fedoseev.timofey,2022-08-14], [user:errorgorn,2022-08-14], [user:FairyWinx,2022-08-14], [user:Allvik06,2022-08-14], [user:arbuzick,2022-08-14], [user:AlesyaIvanova,2022-08-14], [user:Dart-Xeyter,2022-08-14], [user:Alexdat2000,2022-08-14], [user:Vladithur,2022-08-14], [user:rafaelka,2022-08-14], [user:lox123,2022-08-14], [user:LeoRiether,2022-08-14], [user:satyam_343,2022-08-14], [user:ilya.kligunov,2022-08-14], [us...
Codeforces Round #814, ], [user:bpaT_Kapaca,2022-08-14], [user:RomkaRomantic,2022-08-14] for testing theround and providing useful

Full text and comments »

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

104.
By KAN, 9 years ago, translation, In English
Codeforces Round #464 (Div. 2) Hi! The [contest:939] is going to be held on [Saturday, 17 February 2018 at 10:05 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+%23464+%28Div.+2%29&iso=20180217T1305&p1=1908&ah=2) for participants from division 2. The round is based on XIV Nizhny Novgorod Olympiad in Informatics named after V. D. Lelyukh for high school students, which will take place on Saturday in Nizhny Novgorod. However, the problems for the Olympiad and for the round are not completely identical. The problems were prepared by [user:KAP,2018-02-16], [user:ashmelev,2018-02-16], [user:ZhNV,2018-02-16], [user:kuzmichev_dima,2018-02-16], [user:demon1999,2018-02-16], [user:SYury,2018-02-16], [user:mmatrosov,2018-02-16] and me. Thanks to [user:mike_live,2018-02-16] and [user:vepifanov,2018-02-16] for testing the problems, and [user:gritukan,2018-02-16] and [user:MikeMirzayanov,2018-02-16] for helping us to host the round on Codeforces! As usual, participants from division 1 c...
Codeforces Round #464 (Div. 2), around 13:30 UTC., ://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round +%23464+%28Div.+2%29&iso

Full text and comments »

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

105.
By arsijo, 10 years ago, translation, In English
Codeforces Round #371 Hi everybody! Codeforces Round #371 takes place on [13 September at 19:35 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?day=13&month=9&year=2016&hour=19&min=35&sec=0&p1=166) for the both divisions. This is our first round and we hope it won't the last one. This round is prepared by me (Anton Tsypko) and [user:Sonechko,2016-09-10] (Sofia Melnyk). We want to say thanks to [user:GlebsHP,2016-09-10] (Gleb Evstropov) and [user:Sereja,2016-09-10] (Sergey Nagin) for help with preparation of this round, [user:MikeMirzayanov,2016-09-10] (Mike Mirzayanov) for Codeforces and Polygon systems, [user:iSlava,2016-09-10] (Viacheslav Ocheretnyi), [user:otoshol,2016-09-10] (Mark Mikhno), [user:BigBag,2016-09-10] (Matvey Aslandukov), [user:winger,2016-09-13] (Vladislav Isenbaev) and [user:AlexFetisov,2016-09-13] (Alex Fetisov) for testing problems. It's recommended for both divisions to read the [Interactive Problems Guide](http://codeforces.me/blog/entry/45307) before the round. Sc...
Codeforces Round #371, ] (Vladislav Isenbaev) and [user:AlexFetisov,2016-09-13] (Alex Fetisov) for testing problems.

Full text and comments »

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

106.
By csacademy, 10 years ago, In English
Round #13 — Contest with prizes + Platform changes Hello, Codeforces! We are happy to announce that we're going to host a new contest at [csacademy.com](http://csacademy.com). [Round #13](https://csacademy.com/contest/round-13/) will take place on [Thursday, 27/Oct/2016 16:00 (UTC)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=CS+Academy+Round+%2313&iso=20161027T16&p1=1440&ah=2&am=30). If you want to take part in this round you need to [register](https://csacademy.com/contest/round-13/) before the contest begins. Just like the [previous rounds](https://csacademy.com/contests/), this will be a Div1 + Div2, with **7** tasks of varied difficulty that need to be solved in **2** hours and **30** minutes. We are honoured to have [user:josdas,2016-10-25], [user:reality,2016-10-25] and [user:atatomir,2016-10-25] as problem setters. We'd also like to thank [user:Yury_Bandarchuk,2016-10-25] for translating the statements in Russian. This round is going to have some money prizes, as follows: - First place: 125$ - Second ...
Round #13 — Contest with prizes + Platform changes, [csacademy.com](http://csacademy.com). [Round #13 ](https://csacademy.com/contest/round-13/) will take place on, . - Solutions that don't compile or don't pass the example test cases are ignored. - Once you solve a task, test cases for a solution to count (ACM-ICPC-style). - Tasks will have dynamic scores. According to

Full text and comments »

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

107.
By yash_daga, 3 years ago, In English
Codeforces Round 921 (Div. 1 , Div. 2) Hi Everyone :) I would like to invite you to my first Codeforces Round, which I set with my friends [user:jaysharma1048576,2024-01-26] and [user:mexomerf,2024-01-26] &mdash; [contest:1924] and [contest:1925] which will be held on [contest_time:1924]. This round will be rated for both divisions. Both divisions will be given **6 problems** and **2 hours** to solve them. One of the problems may be interactive. So, you are advised to refer to the guide on [interactive problems](https://codeforces.me/blog/entry/45307) in case you are not familiar with them. We would really like to thank: - [user:Aleks5d,2024-01-26] for coordinating our round. - [user:jtnydv25,2024-01-26], [user:dario2994,2024-01-26], [user:IceKnight1093,2024-01-26], [user:oursaco,2024-01-26], [user:satyam343,2024-01-26], [user:Riladavin,2024-01-26], [user:magga,2024-01-26], [user:peltorator,2024-01-26], [user:_Enigma__,2024-01-26], [user:Makcum888,2024-01-26], [user:MisterReaper,2024-01-26], [user:htetg...
Codeforces Round 921 (Div. 1 , Div. 2), Hi Everyone :) I would like to invite you to my first Codeforces Round, which I set with my

Full text and comments »

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

108.
By awoo, history, 14 months ago, translation, In English
Educational Codeforces Round 182 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Neapolis University Pafos](https://www.nup.ac.cy/). They offer a BSc in Computer Science and AI with [JetBrains Scholarships] (https://lp.jetbrains.com/academy/csai-program/). Gain cutting-edge skills in AI and machine learning, preparing you for high-demand tech careers. Limited scholarships available &mdash; don't miss your chance to study in Europe for free! On [contest_time:2144] [contest:2144] 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 w...
Educational Codeforces Round 182 [Rated for Div. 2], round will be **rated for the participants with rating lower than 2100**. It will be held on extended

Full text and comments »

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

109.
By cjquines, history, 7 years ago, In English
Helping out in our NOI: Part 1 Now that the Philippine IOI team has been selected and this year's competition cycle is ending, I'd like to post a series detailing my participation in our national olympiad's organizing team this year. (I'm also doing this because my contribution is dropping! That's why it's a series, so I get even more contribution. I will do anything for imaginary internet points.) This year, I helped write, make data for, and test problems for our national olympiad. I hope that you'll learn something about problemsetting or testing from this series. And if not, then I hope to introduce you to our olympiad's excellent problems. And if you don't find our problems interesting, then this post isn't for you and I'm sorry for wasting your time. In this first part, I'll talk introduce our olympiad, the NOI.PH, and how I contributed to our elimination round. Here's a picture I made for the elimination round that will maybe convince you to read more: ![ ](https://i.imgur.com/ZSrPWoF.jpg) Note th...
been tested. Then [user:verngutz,2019-06-13] has made assignments for who will test which problems. I, , [user:verngutz,2019-06-13], couldn't figure out how to make test data that separated them. So on January 16, /tsunderefs), for all of you *tsunderes* out there. For the eliminations round, I volunteered totest, For the eliminations round, I volunteered to test problems and write stories. Later that November I, The eliminations round was originally scheduled from January 4 to 13. But it was already January 3, The original schedule for the elimination round would be from January 4 to 13. The NOI president

Full text and comments »

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

110.
By Agnimandur, history, 6 years ago, In English
Paying for College with Codeforces ![Go to College with Codeforces ](/predownloaded/0a/97/0a977cc3bf1e7b07b76839aee28eb6e64f30d890.png) ### Do You Want to Go to College? Are You Good At Writing Codeforces Rounds? If so, then read on ahead! You will learn how quick and easy it is to go to college with the help of Codeforces! <br/> <br/> ### College is Expensive. The cost of MIT, a prestigious American university, is 53,790 USD per year. Even though scholarship is usually available, the average American student ends college with 37,000 USD in student debt! [[Source](https://www.cnbc.com/2017/07/13/heres-how-much-it-costs-to-go-to-college-in-the-us-compared-to-other-countries.html)] Student loan is also very pricey, with the average loan charging 5.8% interest per year. [[Source](https://www.nerdwallet.com/article/loans/student-loans/student-loan-interest-rates)] However, Codeforces pays its problem setters big money! For a combined, Div 1+2 round, you can earn an average of approximately 400 USD. [[Source...
college with 37,000 USD in student debt! [[Source](https://www.cnbc.com/2017/07/13/heres-how-much-it

Full text and comments »

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

111.
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 69 [Rated for Div. 2] Hello Codeforces! On [contest_time:1197] [contest:1197] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 invented and prepared by Roman [user:Roms,2019-07-13] Glazov, Adilbek [user:adedalic,2019-07-13] Dalabaev, Vladimir [user:Vovuh,2019-07-13] Petrov, Ivan [user:Bl...
Educational Codeforces Round 69 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

112.
By AntiBsayer, 7 years ago, In English
Codeforces Round #619 (Div. 2) Hello Codeforces. I would like to invite you to participate in [contest:1301] which will take place on [contest_time:1301]. The contest will be rated for **Div. 2** participants. It will include **6** problems, and you have **2** hours to solve them. The problems were created and prepared by me. I would like to thank [user:KAN,2020-02-12], [user:isaf27,2020-02-12] for coordinating this round. And [user:300iq,2020-02-12], [user:-is-this-fft-,2020-02-12], [user:AdvancerMan,2020-02-12], [user:Dup4,2020-02-12], [user:Agnimandur,2020-02-12], [user:Tzak,2020-02-12], [user:DomiKo,2020-02-12], [user:Aleks5d,2020-02-12], [user:Supermagzzz,2020-02-12], [user:manta1130,2020-02-12] for testing the round. I also would like to thank [user:MikeMirzayanov,2020-02-12] for great and perfect Codeforces and Polygon systems. hope you enjoy the contest and find some interesting problems. **UPD**: Score distribution: 500-1000-1250-1750-2500-2500. The round has ended. Thanks for participatin...
Codeforces Round #619 (Div. 2), round. And [user:300iq,2020-02-12], [user:-is-this-fft-,2020-02-12], [user:AdvancerMan,2020-02-12

Full text and comments »

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

113.
By vovuh, history, 7 years ago, In English
Codeforces Round #570 (Div. 3) &lt;almost-copy-pasted-part&gt; Hello! [contest:1183] will start at [contest_time:1183]. You will be offered 6 or 7 problems (or 8) 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 rating 1600 or higher, can register for the round unofficially. The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests &mdash; just like you will be upset if many solutions fail after the contest is over. You will be given 6 or 7 (or 8) problems and 2 hours to solve them. Note that **the penalty** for the wrong submission in this round (and the following Div. 3 rounds) is **10 minutes**. [Remember] (/blog/entry/59228) that only the <i>trusted participants of the third division</i> will be included in the ...
Codeforces Round #570 (Div. 3), for help in round preparation and testing the round. Good luck! I also would like to say that

Full text and comments »

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

114.
By Egor, 12 years ago, In English
Bayan 2015: Finals [Final scoreboard](http://contest.bayan.ir/en/contest/final_2014/scoreboard/) [Introduction](/blog/entry/17541) [Arrival](/blog/entry/17631) [History](/blog/entry/17633) [Some photos from contest and closing ceremony](/blog/entry/17733) Interview with Bayan CEO Ali Ghadiri and some photos from the event will be published tomorrow Places 10-15 received bronze medals Top 3 receive gold medals. Silver medals for next several places: 4. Adrian Budau 5. Peyman Jabbarzade 6. Pooya Zafar. Places 7-9 also received silver medals, unfortunately I could not keep up with announcers Nikola Djokic is third! Ali Haghani is second. Congratulations! And the winner is Evgenii Kapun aka ~eatmore,2015-05-02 Winners will be announced shortly! Speeches, videos and performances &mdash; all the usual things for closing ceremony. Closing ceremony is underway. We'll know winners shortly Scoreboard is frozen |Place|Name|Country |A |B |C|D |E|F|G |H |Score| |-...
,2015-05-01] debugging samples on E. This is also the problem I had not solved duringtest round (and

Full text and comments »

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

115.
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 123 [Rated for Div. 2] Hello Codeforces! On [contest_time:1644] [contest:1644] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 [user:adedalic,2022-02-21] Dalabaev, Vladimir [user:vovuh,2022-02-21] Petrov, Ivan [user:BledDest,2022-02-21] Androsov, Mak...
Educational Codeforces Round 123 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

116.
By platypus179, history, 10 years ago, translation, In English
Codeforces Round #395 (Div. 1 + Div. 2) Ladies and gentlemen! Codeforces Round #395 for both divisions will happen tomorrow, on [Thursday, 2 February 2017 at 13:35 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+%23395&iso=20170202T1335&p1=1440). Problems were prepared by me (Vasiliy Alferov) and students of Moscow school #179: [user:s17b2_voroneckij,2017-02-01] (Dima Voronetsky), [user:ilya_the_lamer,2017-02-01] (Ilya Pauzner) and [user:akvasha,2017-02-01] (Anton Kvasha). Also, [user:KAN,2017-02-01] (Nikolay Kalinin) is author of one of the problems. Invaluable help was given to us by Codeforces coordinator [user:KAN,2017-02-01] (Nikolay Kalinin). Thanks to [user:MikeMirzayanov,2017-02-01] (Mike Mirzayanov) for wonderful platforms Codeforces and Polygon. Also thanks to [user:Endagorion,2017-02-01] (Mikhail Tikhomirov), [user:winger,2017-02-01] (Vladislav Isenbaev), [user:AlexFetisov,2017-02-01] (Alex Fetisov) and [user:cdkrot,2017-02-01] (Dmitry Sayutin) for reading out our statement...
Codeforces Round #395 (Div. 1 + Div. 2), statements and testing the round. Participants will be given five problems in both divisions. Some of the

Full text and comments »

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

117.
By awoo, history, 12 months ago, translation, In English
Educational Codeforces Round 184 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Neapolis University Pafos](https://www.nup.ac.cy/). On [contest_time:2169] [contest:2169] 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 [user:adedalic,2025-11-13] Dalabaev, Ivan [user:BledDest,2025-11-13] Androsov, Maksim [user:Neon,2025-11-13] Mescheryakov, Ro...
Educational Codeforces Round 184 [Rated for Div. 2], ](https://www.nup.ac.cy/). On [contest_time:2169] [contest:2169] will start. Thisround will

Full text and comments »

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

118.
By yaro, 13 years ago, translation, In English
Codeforces Round #188 Hello, friends! <s> Winter </s> **188th Codeforces Round** is coming! We wished to prepare for you some enjoyable problems (as we believe, not very difficult) with nice ideas and clear statements. "We" includes authors of the problems [user:yaro,2013-06-13] and [user:Rei,2013-06-13], Codeforces Rounds supervisor [user:Gerald,2013-06-13] and the platform founder [user:mikemirzayanov,2013-06-13]. Special thanks to Pasha ([user:pavelkunyavskiy,2013-06-13]) and Artem ([user:RAD,2013-06-14]) for the testing and helpful comments. Last time I was preparing a competition here on Codeforces, Rounds were still "beta". Well, with less "beta" comes greater responsibility. So I wish the authors and the organizers a successfully held Round. As for the participants, I wish you the unconventional ideas, the clean code (and a clean keyboard, of course), and satisfaction from five (well, possibly the less number will also do...) correct and accepted solutions! It seems to us that it i...
Codeforces Round #188, the problems with the Codeforces testing queue during the round. We will still be happy if you rate, "We" includes authors of the problems [user:yaro,2013-06-13] and [user:Rei,2013-06-13], Codeforces

Full text and comments »

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

119.
By kshitij_sodani, history, 5 years ago, In English
India ICPC — Amritapuri 2020 Regionals Hi Codeforces! <b>ICPC Amritapuri 2020 Regional Round<b> will be held on [Codedrills](https://codedrills.io/contests/icpc-amritapuri-2020-regional-round) tomorrow. ![ ](https://i.imgur.com/AwOXmHA.png) <b>Contest Details<b> - Contest Link — [ICPC Amritapuri 2020 Regional Round](https://codedrills.io/contests/icpc-amritapuri-2020-regional-round) - Date & Time — 14 August 2021, Saturday, 18:00 IST - Duration — <b>4<b> Hours - There is a ranklist freeze of 60 minutes. Ranklist will freeze at 21:00 IST. - There will be 10-13 problems to solve - Will follow standard ICPC scoring system (20 minutes penalty and 1 point per problem) - The problems may not be sorted by difficulty <b> Selection Criteria - Top few teams will advance to World Finals <b>Clarifications<b> - Only ask the clarifications about the problems by messaging the [private clarification group via discuss](https://discuss.codedrills.io/g/clarifications). - Do not ask any doubts about the problem...
Hi Codeforces! ICPC Amritapuri 2020 Regional Round will be held on [Codedrills](https

Full text and comments »

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

120.
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 84 [Rated for Div. 2] Hello Codeforces! On [contest_time:1327] [contest:1327] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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. The problems were invented and prepared by Roman [user:Roms,2020-03-22] Glazov, Adilbek [user:adedalic,2020-03-22] Dalabaev, Vladimir [user:vovuh,2020-03-22] Petrov, Ivan [user:Bl...
Educational Codeforces Round 84 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

121.
By vovuh, history, 8 years ago, translation, In English
Codeforces Round #529 (Div. 3) My session is almost done and holidays are just around the corner. It means that it's time for another one contest! Happy New Year to all of you! &lt;copy-pasted-part&gt; Hello! [contest:1095] will start at [contest_time:1095]. You will be offered 6 or 7 problems with expected difficulties to compose an interesting competition for participants with ratings up to 1600. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially. The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests &mdash; just like you will be upset if many solutions fail after the contest is over. You will be given 6 or 7 probl...
Codeforces Round #529 (Div. 3), preparation and testing the round. Good luck! I also would like to say that participants who will

Full text and comments »

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

122.
By vovuh, history, 8 years ago, translation, In English
Codeforces Round #490 (Div. 3) Hello! [contest:999] will start on [June 21 (Thursday) at 14:35 (UTC)] (https://www.timeanddate.com/worldclock/fixedtime.html?day=21&month=6&year=2018&hour=17&min=35&sec=0&p1=166). You will be offered 6 problems with expected difficulties to compose an interesting competition for participants with ratings up to 1600. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially. The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests &mdash; just like you will be upset if many solutions fail after the contest is over. You will be given 6 problems and 2 hours to solve them. [Remember] (/blog/entry/59228...
Codeforces Round #490 (Div. 3), preparation and testing the round. Good luck! **UPD**: Also great thanks to [user:step_by_step,2018

Full text and comments »

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

123.
By GlebsHP, history, 10 years ago, translation, In English
Round 1 of Yandex.Algorithm 2017 Hello everybody! Tomorrow, at [10:00 Moscow time](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Yandex.Algorithm+2017+Round+1&iso=20170514T10&p1=166&ah=1&am=40) will be held Round 1 of Yandex.Algorithm competition, authored by me. I would like to thank [user:Zlobober,2017-05-13] for all the job he does to make this competition interesting, [user:MikeMirzayanov,2017-05-13] for the great [polygon](https://polygon.codeforces.com/) that ease the preparation process a lot, and everyone, who tested the round and made useful comments. Of course, we did our best to make the problem diverse by topics and difficulty. See you in the competition dashboard! **UPD** Thanks to everyone who participated, hope each of you found at least one interesting problem. We apologize for the situation with problem F, we have googled for all the problems and asked all testers whether they have seen such problems or not, but that didn't helped. The [editorial](http://codeforces.me/blog/entry/...
Round 1 of Yandex.Algorithm 2017, /fixedtime.html?msg=Yandex.Algorithm+2017+Round +1&iso=20170514T10&p1=166&ah=1&am=40) will be heldRound 1 of, =Yandex.Algorithm+2017+Round+1&iso=20170514T10&p1=166&ah=1&am=40) will be held Round 1 of Yandex.Algorithm

Full text and comments »

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

124.
By scott_wu, 11 years ago, In English
8VC Venture Cup Announcement <img src="http://assets.codeforces.com/images/8vc/8vc-venturecup-logo.png" style="float:right;margin:0 1em 1em 1em"/> Hey Codeforces! I’ve worked with Addepar and the broader 8 | family of companies in Silicon Valley throughout 2014 and 2015, and it’s been an excellent experience. I would encourage everyone in the community to learn more about the great work that these companies are doing and I’m happy to announce that 8 | Partners will be hosting the 8 | VC VentureCup on Codeforces! It’ll be a fun contest and I’ve worked on the problems along with a few competitive programmers in our network. The contest will begin on February 13 and consist of two rounds. ##### ABOUT 8 | PARTNERS <a href="http://eight.vc/">8 | Partners</a>, which consists of Joe Lonsdale (co-founder of Palantir) and his core team from Formation | 8, is a Silicon Valley venture capital firm that invests in industry-transforming technology companies. The team's investment portfolio includes companies suc...
February 13. Round 1 follows regular Codeforces rules and consists of 7 problems. For thisround, the

Full text and comments »

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

125.
By ajxu2, history, 4 years ago, In English
Java Pitfalls Recently, I participated in [contest:1828]. I was doing well, and in the last 5 minutes of the contest I solved problem D1, putting me at rank 200 and with CM performance. I was happy with myself until this happened: ![FST :(](/predownloaded/51/96/5196ba9179412af6f621833a2c984aed2bef4293.png) I saw that I got TLE on test case 13 and quickly realized what happened. I chose to use Java in this round, and I had somehow fallen in another one of Java's traps. Now, I've decided to compile a comprehensive list of these pitfalls so no one can FST to them again. (Hopefully after you see this you'll be convinced to just use C++.) **1. Array sorting** <spoiler summary="Problem"> `Arrays.sort` on an array of primitive types (`int`, `long`, `double`, etc.) can degrade to $O(N^2)$ on adversarial test cases. Note that this does not apply to `Collections.sort` or non-primitive types. </spoiler> <spoiler summary="Solution 1"> Apparently, this bug was fixed in Java 14. So on Codeforces...
I saw that I got TLE on test case 13 and quickly realized what happened. I chose to use Java in

Full text and comments »

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

126.
By vovuh, history, 9 years ago, translation, In English
Educational Codeforces Round 36 [Rated for Div. 2] Hello Codeforces! On [January 13, 16:05 MSK](https://www.timeanddate.com/worldclock/fixedtime.html?day=13&month=1&year=2018&hour=16&min=5&sec=0&p1=166) Educational Codeforces Round 36 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be (traditionally now) **rated for Div. 2**. It will be held on extented ACM ICPC rules. After the end of the contest you will have one day 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. The problems were prepared by Mikhail [user:PikMike,2018-01-12] Piklyaev, Ivan [user:BledDest,2018-01-12] Androsov, Sergey [user:sslotin,2018-01-13] Slotin and me....
Educational Codeforces Round 36 [Rated for Div. 2], /fixedtime.html?day=13&month=1&year=2018&hour=16&min=5&sec=0&p1=166) Educational CodeforcesRound 36 will start

Full text and comments »

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

127.
By darkkcyan, history, 6 months ago, In English
[UNOFFICIAL] VNOI CUP 2026 — Round 2 Hello Codeforces! <img src="/predownloaded/bf/d6/bfd66e8992d7201f578ddb5c83d5ff7504fe4b47.png" style="float: right; margin-left: 10px; width: 40%;" /> After an intense first qualification round, we are excited to invite everyone to participate in **Round 2 of VNOI CUP 2026**, taking place on **Saturday, May 30**! - &#128264; **Contest:** https://oj.vnoi.info/contest/vnoicup26_r2_mirror - &#128197; **Time:** [May 30, 2026 &mdash; 20:30 (GMT+7)](https://www.timeanddate.com/worldclock/fixedtime.html?day=30&month=5&year=2026&hour=13&min=30&sec=0&p1=0) This round continues the race toward the onsite Final Round of VNOI CUP 2026, where top contestants will compete for final standings and exclusive VNOI CUP merchandise. *If you are Vietnamese and eligible to participate in the official round, we strongly encourage you to register and compete there instead.* As announced previously, we also plan to invite several top international participants from the unofficial mirror roun...
[UNOFFICIAL] VNOI CUP 2026 — Round 2, /fixedtime.html?day=30&month=5&year=2026&hour=13&min=30&sec=0&p1=0) This round continues the race

Full text and comments »

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

128.
By BYN, 12 years ago, In English
Bayan Contest Warm Up round + 50 tshirts! <img src="http://bayanbox.ir/id/2486223970916195531?view" style="width: 40%; float: right;"> - Bayan **warm-up** round will be held on Sunday, [October 5th 2014, 13:00 (UTC)](http://www.timeanddate.com/worldclock/fixedtime.html?day=5&month=10&year=2014&hour=13&min=00&sec=0) and as indicated before, it will be held on Codeforces. Warm-up round is not a required round but top 50 are going to win t-shirts and it is going to be rated for both divisions. - Problems have been prepared by [user:mruxim,2014-10-02], [user:mR.ilchi,2014-10-02], [user:havaliza,2014-10-02] . We have tried our best to make the problem-set interesting and competitive and we hope you enjoy it. - It is necessary to have a complete profile on [contest.bayan.ir](http://contest.bayan.ir/en/) before the warm-up round! And please do make sure you have selected the correct t-shirt size! - We have upgraded our contest platform, and we've made sure everything is stable, tuned and robust now. Thanks to all those ...
Bayan Contest Warm Up round + 50 tshirts!, ;"> - Bayan **warm-up** round will be held on Sunday, [October 5th 2014, 13:00 (UTC)](http

Full text and comments »

Announcement of Bayan 2015 Contest Warm Up
  • Vote: I like it
  • +282
  • Vote: I do not like it

129.
By DEGwer, 13 years ago, In English
Codeforces Round #219 Hello. Codeforces Round #219 will take place on [December 13th at 18:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?day=13&month=12&year=2013&hour=18&min=0&sec=0&p1=166) for both Div.1 and Div.2 participant. Make sure that it will be held unusual time. Problem setters are [user:m.kagamiz,2013-12-12] and [user:DEGwer,2013-12-12], and we thank [user:Gerald,2013-12-12] for helping us to hold this contest, and [user:Delinur,2013-12-12] for the translation, and [user:MikeMirzayanov,2013-12-12] for systems. The score distribution will be uploaded soon, but probably we use the standard scoring system. **UPD1**: The score distribution is standard, **500-1000-1500-2000-2500** for both division. **UPD2**: Problem B from Div.2 and problem C from Div.1 have some problems, so all submissions to these problems are rejudged. I'm very sorry. **UPD3**: Anyone who gets AC two or more times, because of resubmit before clarification, please, write to [user:Gerald,2013-12-13...
Codeforces Round #219, -13], your submissions that should be skipped. Sorry for inconvenience. **UPD4**: Now systemtest

Full text and comments »

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

130.
By Nickolas, 12 years ago, translation, In English
Surprise Language Round #7 The contest is over. 13 people solved all problems &mdash; you guys are amazing! The editorial will be available [here](/blog/entry/13777). ------------ Today's language is FALSE, stack-based esoteric programming language invented over 20 years ago. The traditional A+B problem (integers A and B are separated with a space) can be solved [like this](http://rosettacode.org/wiki/A%2BB#FALSE). To test your solutions, you can: * download source code in C of the original interpreter [here](http://assets.codeforces.com/rounds/470/false_int.c). Testing system uses this interpreter with -q option. * use ["Custom Invocation"](/contest/470/customtest). * use online interpreters (they differ from the reference interpreter a bit but make debugging much easier): [1](http://morphett.info/false/false.html), [2](http://www.quirkster.com/iano/js/false-js.html). Useful links: * [language description by its author Wouter van Oortmerssen](http://strlen.com/false/false.txt) * [Pro...
Surprise Language Round #7, The contest is over. 13 people solved all problems — you guys are amazing! The editorial

Full text and comments »

Announcement of Surprise Language Round 7
  • Vote: I like it
  • +153
  • Vote: I do not like it

131.
By Nickolas, 11 years ago, translation, In English
VK Cup 2016 Wild Card Round 1 The contest is over; the editorial is available [here](http://codeforces.me/blog/entry/44292). --- The language of this round is [J](http://jsoftware.com/). The traditional A+B program (A and B are written in one line and separated with space) looks as follows: ~~~ print =: 1!:2&2 read =: 1!:1[3 in =. (read-.LF)-.CR print +/ ". in exit '' ~~~ The main source of information about the language is http://code.jsoftware.com/wiki/Main_Page. Version used is J804. [cut] Several notes: * to test your solutions locally, use jsonsole solution.ijs < input.txt. It's also possible to use jsonsole solution.ijs, in this case after entering test press Ctrl+z+Enter. * you can run your code on Codeforces platform, using Custom Test tab. * the language is not compiled, if your code has syntax error, you'll get verdict "Wrong answer on test 1". * note that Codeforces uses Windows-style line endings, #13#10. You can download language from http://www.jsoftware.com/down...
VK Cup 2016 Wild Card Round 1, ). --- The language of this round is [J](http://jsoftware.com/). The traditional A+B program (A, * to test your solutions locally, use jsonsole solution.ijs < input.txt. It's also possible to use

Full text and comments »

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

132.
By darkkcyan, history, 6 months ago, In English
[UNOFFICIAL] VNOI CUP 2026 — Round 1 Invitation Hello Codeforces! <img src="https://cdn.discordapp.com/attachments/1488567390223466577/1504366688068698212/VL1_VNOI_CUP2.png?ex=6a06ba28&is=6a0568a8&hm=7311d42ec47477ede77768da7526c794652d2a03e8c4958e6690525457495846&" style="float: right; margin-left: 10px; width: 40%;" /> We are excited to invite you to join us on **Saturday, May 16**, and try the same fun yet challenging problems from **Round 1 — VNOI CUP 2026**! - &#128264; **Contest:** https://oj.vnoi.info/contest/vnoicup26_r1_mirror - &#128197; **Time:** [May 16, 2026 — 20:30 (GMT+7)](https://www.timeanddate.com/worldclock/fixedtime.html?day=16&month=5&year=2026&hour=13&min=30&sec=0&p1=0) *If you are Vietnamese and eligible to participate in the official round, we strongly encourage you to register and compete there instead.* This year, we also plan to invite a few top international participants from the unofficial mirror rounds to join the **Final Round onsite in Vietnam**. These participants will compete in ...
[UNOFFICIAL] VNOI CUP 2026 — Round 1 Invitation, **Round 1 — VNOI CUP 2026**! - 🔈 **Contest:** https://oj.vnoi.info/contest

Full text and comments »

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

133.
By vovuh, 9 years ago, translation, In English
Educational Codeforces Round 34 [Rated for Div. 2] Hello Codeforces! On [December 12, 18:05 MSK](https://www.timeanddate.com/worldclock/fixedtime.html?day=12&month=12&year=2017&hour=18&min=5&sec=0&p1=166) Educational Codeforces Round 34 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for Div. 2** again. It will be held on extented ACM ICPC rules. After the end of the contest you will have one day 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. The problems were prepared by Mikhail [user:PikMike,2017-11-08] Piklyaev, Ivan [user:BledDest,2017-11-22] Androsov and me. Good luck to all participants! I also have a ...
Educational Codeforces Round 34 [Rated for Div. 2], /fixedtime.html?day=12&month=12&year=2017&hour=18&min=5&sec=0&p1=166) Educational CodeforcesRound 34 will

Full text and comments »

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

134.
By TheSensei, history, 17 months ago, In English
Eolymp Weekend Practice #8 ### **Hello Codeforces!** ------------------ ![ ](https://codeforces.me/predownloaded/da/f3/daf314d0dcdb835fcfcd817a35619436f4008852.svg) I'm very super duper ultra excited to invite you to [Weekend Practice round #8](https://basecamp.eolymp.com/en/contests/8g2aerj14903raif9v7veir3m8) , taking place on [July 13, at 12:00 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?day=13&month=7&year=2025&hour=15&min=00&sec=0&p1=166). This is a **rated** contest at Eolymp. <h2>NOTICE THAT THE ROUND TIME SCHEDULE GOT EARLIER BY 1 HOUR</h2> #### **Format and Difficulty** Same as in previous rounds, the competition is primarily aimed at improving practical skills. There will be $2$ hours for $5$ tasks of varying difficulty, the easiest of which can even be solved by beginners. The scoring for each task being block-based (meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block). If there is a tie between...
Coordinating The Round. - [user:MathModel,2025-07-13] For the $\underbrace{\mathtt{WWW..WW}}_{\infty, [user:MathModel,2025-06-27] For Coordinating The Round. - [user:MathModel,2025-07-13] For the

Full text and comments »

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

135.
By niyaznigmatul, 7 years ago, translation, In English
Innopolis Open Second Qualifier. 2019-2020 **The contest is in the gym: [contest:102461]** Hello! <img src="/predownloaded/92/05/9205710589b277c79acc323594a7516232130434.png" width="500px" align="right"/> The second qualifier to [Innopolis Open 2020](https://olymp.innopolis.ru/en/ooui/information/) rescheduled to [December 14th 1:00 PM UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Innopolis%20Open%202020%20Second%20Qualifier&iso=20191214T16&p1=354&ah=5). Qualifier duration is 5 hours, there are five problems in the contest. Those, who scored high enough, will be invited to the final contest that takes place on February 22-23, 2020. Those, who already qualified, can compete in second qualifier as well, but they won't influence qualification. Innopolis Open is only for middle and high school students. All others will be able to solve the problems in Codeforces::Gym. There is a trial round taking place, it ends in the evening of December 13. If you are new to Innopolis Open it's good to take part...
part in trial round to get to know the testing system and format of problems. Be careful, the trial, There is a trial round taking place, it ends in the evening of December 13. If you are new to

Full text and comments »

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

136.
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 71 [Rated for Div. 2] Hello Codeforces! On [contest_time:1207] [contest:1207] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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. The problems were invented and prepared by Roman [user:Roms,2019-08-06] Glazov, Adilbek [user:adedalic,2019-08-06] Dalabaev, Vladimir [user:Vovuh,2019-08-06] Petrov, Ivan [user:Bl...
Educational Codeforces Round 71 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

137.
By satyam343, 3 years ago, In English
Problems that I authored so far Hi everyone! I wanted to write such a blog for a long time. I finally decided to do it after Codeforces Round $934$. I would like to thank [user:Non-origination,2024-03-21], [user:GoatTamer,2024-03-21] and [user:KingRayuga,2024-03-21] for discussing the problems with me. For each problem, I tried to include the some interesting stuff if I could remember. I tried to avoid using spoilers for the problems. So you can look at the comments even if you have not tried the problem. | # | Date | Problem | Difficulty | Contest | Comment |----|-----------|---------------------------------|------------|--------------------------------------|--------------------------------------| | 1 | Aug 2021 | [Tree Distance Sum](https://www.codechef.com/problems/TREEDIST) | Div 2 E | Codechef Starters 10 | My first problem which appeared in some contest. I noticed some nice properties about the dfs traversal and de...
C | SnackDown 2021 — Online Round 1A| | | 3 | Feb 2022 | [Or Sum](https://www.codechef.com, Codeforces Round $934$. I would like to thank [user:Non-origination,2024-03-21], [user:GoatTamer,2024

Full text and comments »

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

138.
By -firefly-, 18 months ago, In English
Invitation to Soy Cup #2: Vivian Hello, Codeforces! We are [euphoric](https://vndb.org/v88) to invite you to [contest:105928], which will take place on [contest_time:105928]. You will have $5$ hours to solve $13$ problems, including at least one interactive problem. This is a team contest following ACM/ICPC rules, with teams of up to $3$ members. The penalty for an incorrect submission is **20 minutes**. The standings will be frozen for the last **60 minutes** of the contest. The final results and editorial will be streamed live on [Bilibili](http://live.bilibili.com/802593) on [June 2, 2025, at 06:00 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20250602T0600). All problems are created and prepared by me. We would like to thank: 1. [user:MikeMirzayanov,2025-05-26] for creating the fantastic CodeForces and Polygon platform. 2. [user:torif,2025-05-30] for sponsoring the round. 3. [user:SATSKY_2025target_LGM,2025-05-26], [user:Tobo,2025-05-26], [user:AkaiLemon,2025-05-28], [user:...
[user:sakuya_maid_fans,2025-05-26] for testing the round and giving useful feedback. 4. [user:macaquedev,2025-05-30

Full text and comments »

Announcement of Soy Cup #2: Vivian
  • Vote: I like it
  • +106
  • Vote: I do not like it

139.
By kostka, 12 years ago, In English
Hack me! (Codeforces Round #282 (Div. 2)) Quite delayed, but here we have stats about hacks in [contest:495]. Previous posts can be found [here](http://codeforces.me/search?query=hackme), including [div1](http://codeforces.me/blog/entry/15151). [cut] <h3>Stats</h3> Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>| :---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:495A] </small> | 623 (85.58%) | 76 (10.44%)| 29 (3.98%) | 728 | 47 (2.65%) | 1727 (97.35%) | 1774 | <small> [problem:495B] </small> | 274 (79.42%) | 60 (17.39%)| 11 (3.19%) | 345 | 232 (27.17%) | 622 (72.83%) | 854 | <small> [problem:495C] </small> | 103 (56.59%) | 75 (41.21%)| 4 (2.20%) | 182 | 426 (64.06%) | 239 (35.94%) | 665 | <small> [problem:495D] </small> | 0 | 0 | 0 | 0 | 3 (27.27%) | 8 (72.73%)| 11 | <small> [problem:495E] </small> | 0 | 0 | 0 | 0 | 0 | 0 | 0 | <ce...
Hack me! (Codeforces Round #282 (Div. 2)), : ~~~~~ (#( ~~~~~ ~~~~~ (((#)(( ~~~~~ ~~~~~ (#(() ~~~~~ It was also test #14 (look below

Full text and comments »

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

140.
By TimeWarp101, 4 years ago, In English
Codeforces Round #845 (Div. 2) and ByteRace 2023 Hello, Codeforces! NJACK &mdash; the Computer Science Club of IIT Patna is excited to invite you to **ByteRace 2023** &mdash; [contest:1777] under **Celesta** &mdash; the annual Techno-Management Fest of IIT Patna. The contest will take place on [contest_time:1777]. **This round will be rated for participants with rating lower than 2100.** ![ ](/predownloaded/fe/63/fe63baf2a3f195f519ff5907f40f0fb6fdd46ed7.png) Many thanks to all the people who made this round possible: - The problems were authored and prepared by me, [user:quantau,2023-01-19], [user:mayankfrost,2023-01-19], [user:ShivanshJ,2023-01-19], [user:Crocuta,2023-01-19] and [user:AwakeAnay,2023-01-19]. - [user:irkstepanov,2023-01-19] and [user:KAN,2023-01-19] for coordinating the round! - [user:jenishmonpara,2023-01-19], [user:100gods,2023-01-19] and [user:V_S_M,2023-01-19] for their guidance throughout the process. - VIP testers: [user:YashPant,2023-01-19] and [user:Newtech66,2023-01-19] <3 - Shoutout to [us...
Codeforces Round #845 (Div. 2) and ByteRace 2023, Fest of IIT Patna. The contest will take place on [contest_time:1777]. **This round will be rated

Full text and comments »

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

141.
By Endagorion, history, 9 years ago, translation, In English
Yandex.Algorithm 2018, second round Hello everyone! Today, [on March 13 at 9pm MSK](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Yandex.Algorithm+2018+Round+2&iso=20180313T21&p1=166) the second qualification round of Yandex.Algorithm 2018 tournament will take place. You can get to the contest page from the [Algorithm site](https://contest.yandex.ru/algorithm2018/). The problems are by me, Mikhail Tikhomirov. I am grateful to Gleb [user:GlebsHP,2018-03-13] Evstropov for his help with problems preparation, and also [user:ifsmirnov,2018-03-13], [user:halyavin,2018-03-13], [user:kuzmichev_dima,2018-03-13], [user:scorpion,2018-03-13] for testing the problems. Good luck, see you at the competition!
Yandex.Algorithm 2018, second round, -03-13], [user:kuzmichev_dima,2018-03-13], [user:scorpion,2018-03-13] for testing the problems., ], [user:scorpion,2018-03-13] for testing the problems. Good luck, see you at the competition!

Full text and comments »

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

142.
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 143 [Rated for Div. 2] Hello Codeforces! On [contest_time:1795] [contest:1795] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 [user:adedalic,2023-02-15] Dalabaev, Vladimir [user:vovuh,2023-02-15] Petrov, Ivan [user:BledDest,2023-02-15] Androsov, Ma...
Educational Codeforces Round 143 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

143.
By Error_Yuan, history, 6 weeks ago, In English
KDOI Tournament 2026 — Advanced Round 1 Invitation **UPD: The correct date should be Oct/24.** This is the English translation of [Announcement](https://www.oicon.cn/blogs/8). KDOI Tournament 2026 is here in full force! The first programming contest in the KDOI Tournament 2026 series, [KDOI Tournament 2026 Advanced Round 1](https://www.oicon.cn/contests/5), will be held on October 24, 2026, from 09:00 to 13:00 (UTC +8). The contest will feature **4 problems**, each worth **100 points**, with a total duration of **4 hours**. It will follow the **traditional OI** contest format. **English statements will be provided.** This will also be the first rated contest on OICon OJ! Advanced Round 1 is open to participants with a rating below **2400**. Since this is the first contest on our online judge, however, everyone is eligible to participate. The staff involved in organizing this contest are: - Problem setters: [user:Error_Yuan,2026-10-07] and [user:sszcdjr,2026-10-07]; - Testers: [user:Anonyme,2026-10-07], [user:qhj09...
KDOI Tournament 2026 — Advanced Round 1 Invitation, contest in the KDOI Tournament 2026 series, [KDOI Tournament 2026 Advanced Round 1](https

Full text and comments »

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

144.
By vovuh, history, 8 years ago, translation, In English
Codeforces Round #506 (Div. 3) &lt;copy-pasted-part&gt; Hello! [contest:1029] will start at [contest_time:1029]. You will be offered 6 or 7 problems with expected difficulties to compose an interesting competition for participants with ratings up to 1600. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially. The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests &mdash; just like you will be upset if many solutions fail after the contest is over. You will be given 6 or 7 problems and 2 hours to solve them. Note that **the penalty** for the wrong submission in this round (and the following Div. 3 rounds) is **10 minutes*...
Codeforces Round #506 (Div. 3), [user:BledDest,2018-06-20] Androsov for help in round preparation and testing theround. Good luck! I

Full text and comments »

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

145.
By Pyqe, history, 3 years ago, In English
COMPFEST 15 Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) <img alt="logo" src="/predownloaded/54/ec/54ec8a2a974eb225636db378f5470e039144d49b.png" style="float: right;height: 100.0px;margin: 10.0px;max-width: 100.0%;max-height: 100.0%;"> Hello, **Codeforces**! &#x1f60d;&#x1f60d; We are happy to invite you to participate in [COMPFEST 15 Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)](https://codeforces.me/contests/1866) on <a class="contest-time" contestid=1866></a>. COMPFEST is a national **ICPC-style contest** for university students in Indonesia. The problems are written and prepared by [user:ArvinCiu,2023-08-30], [user:asteriskzie,2023-08-30], [user:CyberSleeper,2023-08-30], [user:Edbert.H,2023-08-30], [user:FreeJinG,2023-08-30], [user:gansixeneh,2023-08-30], [user:KokiCoder,2023-08-30], [user:nandonathaniel,2023-08-30], and [user:Pyqe,2023-08-30]. We would also like to thank: - [user:KAN,2023-08-30] for helping to host the mirror round; - [user:AMnu,2023-08-30], ([user:KerakTelor,2023-08-30], [user:Owmic...
helping to host the mirror round; - [user:AMnu,2023-08-30], ([user:KerakTelor,2023-08-30

Full text and comments »

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

146.
By vntshh, 9 years ago, In English
Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined) Hi Codeforces! [Programming Club, IIT Indore](https://pclubiiti.github.io/) and [Euristica 2018](https://euristica.in/) are proud to present our flagship event, **Divide By Zero!** The contest will take place on [Saturday, 7th April at 9:35PM IST](https://www.timeanddate.com/worldclock/fixedtime.html?day=7&month=4&year=2018&hour=19&min=5&sec=0&p1=166). ![ ](https://i.imgur.com/hW6OEd4.jpg) **Prizes :** Codeforces T-shirts for top 15 participants overall and top 15 participants in India. Thanks to the following people for making the round possible : - [user:apoorv_kulsh,2018-04-06], [user:arnabsamanta,2018-04-06], [user:AakashHanda,2018-04-06], [user:vicennial,2018-04-06], [user:kr_abhinav,2018-04-06], [user:decrypt.cp,2018-04-06], [user:rohitranjan017,2018-04-06] and myself for setting the problems. - [user:usaxena95,2018-04-06] and [user:killer_bee,2018-04-06] for their help with the problems. - [user:300iq,2018-04-07] and [user:demon1999,2018-04-07] for testin...
Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined), testing the problems. - [user:gritukan,2018-04-07] for coordinating throughout theround

Full text and comments »

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

147.
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 108 [Rated for Div. 2] Hello Codeforces! On [contest_time:1519] [contest:1519] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 Roman [user:Roms,2021-04-28] Glazov, Adilbek [user:adedalic,2021-04-28] Dalabaev, Vladimir [user:vovuh,2021-04-28] Petrov, Ivan [us...
Educational Codeforces Round 108 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

148.
By MiracleMagician, 10 months ago, In English
Prosort [114] (Div. 3) > “It is not important to be better than someone else, but to be better than you were yesterday.” — Master Oogway, Kung Fu Panda Hello, **IIITD**! We are proud to present **Prosort[114] (Div. 3)**. We hereby invite all IIITD students to take part in it. The round will start on **Wednesday, January 14, 2026** at **17:00 IST**. You will have **2 hours** (until 19:00 IST) to solve the problems. **Note:** Only **IIITD college students** are officially eligible to participate in this round. The contest will consist of **6-7 problems** to be solved in **ICPC style** format. **At least one problem will be interactive** , so please make sure to read the [guide for interactive problems](https://codeforces.me/blog/entry/45307) before the contest. **Rules:** 1. The contest will be held on the **Codeforces** platform. 2. It is recommended to reach the venue **15 minutes prior** to the start time. 3. Only **IDE** will be allowed as there is no need of googling. **No switch...
**. We would like to thank: * [user:ro_.hi__th._,2026-01-13] for special assistance andtesting

Full text and comments »

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

149.
By kostka, 12 years ago, In English
Hack me! (Codeforces Round #282 (Div. 1)) Aren't you tired after [contest:494]? **Did you know...** that when you will be on the list of "best hackers" of the round the row with your handle will be highlighted (if you will be logged in)? <center> <img src="http://test.weaselcrow.com/cfhacks/f1.png"> </center> Other posts can be found [here](http://codeforces.me/search?query=hackme), including [div2](http://codeforces.me/blog/entry/15150). [cut] <h3>Stats</h3> Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>| :---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:494A] </small> | 363 (53.23%) | 293 (42.96%)| 26 (3.81%) | 682 | 201 (23.40%) | 658 (76.60%) | 859 | <small> [problem:494B] </small> | 2 (50.00%) | 2 (50.00%)| 0 (0.00%) | 4 | 32 (8.42%) | 348 (91.58%) | 380 | <small> [problem:494C] </small> | 0 | 0 | 0 | 0 | 6 (17.14%) |...
Hack me! (Codeforces Round #282 (Div. 1)), of "best hackers" of the round the row with your handle will be highlighted (if you will be logged in

Full text and comments »

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

150.
By WitchOfTruth, history, 6 years ago, In English
Contests hack statistics (Number of hacks by round) Just felt like gathering some data about hacks. Parsed around ~400 last contests Probably it would be worth it to also include SFT, but whatever Educational 96 is not finished yet but also whatever Last 100 ------------------ **847** Educational Codeforces Round 96 (Rated for Div. 2) **30** Codeforces Global Round 11 **248** Codeforces Round #674 (Div. 3) **0** 2020 ICPC, COMPFEST 12, Indonesia Multi-Provincial Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) **97** Bubble Cup 13 &mdash; Finals [Online Mirror, unrated, Div. 2] **86** Bubble Cup 13 &mdash; Finals [Online Mirror, unrated, Div. 1] **20** Codeforces Round #675 (Div. 2) **1** Codeforces Round #672 (Div. 2) **70** Codeforces Round #671 (Div. 2) **58** Educational Codeforces Round 95 (Rated for Div. 2) **3** Codeforces Round #673 (Div. 2) **11** Codeforces Round #673 (Div. 1) **73** Codeforces Round #667 (Div. 3) **121** Grakn Forces 2020 **4** Co...
Contests hack statistics (Number of hacks by round), Codeforces Round 90 (Rated for Div. 2) **13** Codeforces Round #655 (Div. 2) **2** Codeforces, Round 90 (Rated for Div. 2) **13** Codeforces Round #655 (Div. 2) **2** CodeforcesRound

Full text and comments »

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

151.
By Aksenov239, history, 10 years ago, In English
Bioinformatics Contest 2017 Announcement Hello everybody! I would like to announce the first [BioInformatics Contest](http://contest.bioinf.me/) organized by [Bioinformatics Institute](http://bioinformaticsinstitute.ru/en). The contest is hosted on [Stepik platform](https://stepik.org/course/Bioinformatics-Contest-2017-945/syllabus). You can already register and become familiar with the [rules](https://stepik.org/lesson/Welcome!-38040/step/2) and the testing system. Note, that you have to sign the rules, otherwise, you will not be able to participate. The contest consists of two rounds: - The Qualification Round will be held during one week from [January 23 (7AM UTC)](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20170123T07&p1=136) to [January 29 (11 PM UTC)](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20170129T23&p1=136). - The Final Round will be held during 24 hours starting at [February 18 (12:00 AM UTC)](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20170123T07&p1=136)....
], [user:GShark,2017-01-13], [user:VArtem,2017-01-13] and me. Good luck! **UPD:** The QualificationRound

Full text and comments »

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

152.
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 81 [Rated for Div. 2] Hello Codeforces! On [contest_time:1295] [contest:1295] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 invented and prepared by Roman [user:Roms,2020-01-13] Glazov, Adilbek [user:adedalic,2020-01-13] Dalabaev, Vladimir [user:Vovuh,2020-01-13] Petrov, Ivan [user:Bl...
Educational Codeforces Round 81 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

153.
By Nickolas, 13 years ago, translation, In English
Friday the 13th, Programmers' Day This time the language is **Ada**, chosen not for being particularly crazy (it's too Pascal-like to my taste) but for its name. Indeed, a language named for Ada Lovelace seems to be a perfect fit for programmers' professional holiday. I tried to balance the lack of language weirdness by problems somewhat less trivial than usual. Here is the traditional solution for "A+B" problem (integers A and B can be given in one line): ~~~ with Ada.Integer_Text_IO; use Ada.Integer_Text_IO; procedure AplusB is A, B: Integer; begin Get(Item => A); Get(Item => B); Put(Item => A + B, Width => 1); end AplusB; ~~~ The testing system uses gnat 4.7.2. To test your programs before submitting, you can: * use “Custom test” tab in the contest interface. * use ideone, language Ada (gnat-4.6). Remember that by default programs submitted by anonymous are shown in “recent codes”; to avoid this I recommend registering and using "private" privacy option or at least us...
=> A + B, Width => 1); end AplusB; ~~~ The testing system uses gnat 4.7.2. To test your programs

Full text and comments »

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

154.
By MikeMirzayanov, 14 years ago, translation, In English
Croc Champ 2013 — Qualification Round <img src="http://assets.codeforces.com/images/start.jpg" style="float:right;margin: 0 0.5em 0.5em 0.5em"/> Hi everybody! Let me remind you that on the [12th of April, at 20:00](http://timeanddate.com/worldclock/fixedtime.html?day=13&month=4&year=2013&hour=0&min=0&sec=0&p1=166) the Qualification Round of the [All-Russian Programming Championship CROC-2013](http://codeforces.me/croc2013) will start. You need to participate in the Qualification Round to make it to Round 1. Contestants who gain a score equal to the 2000-th place finisher score or greater will advance to the Round 1 (also you need to gain positive score). At the Qualification Round you will find a few problems, roughly ordered by the increasing complexity. During the Qualification Round the problems are judged only on pretests and system testing will take place after the end of the Qualification Round (round continues for 48 hours). The pretests do not cover all possible cases of input data, test your pr...
Croc Champ 2013 — Qualification Round, judged only on pretests and system testing will take place after the end of the QualificationRound

Full text and comments »

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

155.
By Hexagons, 2 years ago, In English
OMORI CONTEST Announcement Assalamualaikum (peace be upon you), Codeforces people &#128075;. I'm glad to invite you to the mashup [OMORI CONTEST](https://codeforces.me/contestInvitation/fc8da6d6845e77adc452e754d3d84c1086148c59) which will be held inshallah on [Thursday, October 17, 2024 at 19:30 (GMT+3)](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20241017T1930&p1=426). You will be given **3.5 hours (210 minutes)** to solve **7 cool problems** in an **ICPC-styled** contest, themed about the videogame [OMORI](https://www.google.com/search?q=omori) (Which is a great game that you might want to give a try). There will be exactly one interactive problem, so I suggest you should read the [guide for interactive problems](https://codeforces.me/blog/entry/45307). All problems have been written and prepared by me, [user:Hexagons,2024-10-04]. I would like to give a lot of thanks to: - [user:MikeMirzayanov,2024-10-04] for the great codeforces and polygon systems &#128077;, without them I wou...
continue enhancing the testing experience in the meantime of these 13 days.

Full text and comments »

Announcement of OMORI CONTEST
  • Vote: I like it
  • +370
  • Vote: I do not like it

156.
By kostka, 12 years ago, In English
Hack me! (CF Round #263, Div. 1) Stats about hacks in [contest:461] (quite late). [cut] <h3>Stats</h3> Problem | Successful hacks | Unsuccessful hacks | Other | Sum | :---:|:---:|:---:|:---:|:---:| [problem:461A] | 6 (8%) | 23 (32%) | 43 (60%) | 72 | [problem:461B] | 0 (0%) | 2 (33%) | 4 (67%) | 6 | [problem:461C] | 1 (100%) | 0 (0%) | 0 (0%) | 1 | ### Fastest hackers Problem | Time | Hacker | Defender | Hack :---:|:---:|:---:|:---:|:---:| [problem:461A] | 00:18:40 | [user:IWillBeRed,2014-08-26] | [user:thermal,2014-08-26] | <a href="http://codeforces.me/contest/461/hacks/110022/">110022</a> | [problem:461C] | 01:56:17 | [user:FatalEagle,2014-08-26] | [user:mareksom,2014-08-26] | <a href="http://codeforces.me/contest/461/hacks/111898/">111898</a> | Congratulations for [user:FatalEagle,2014-08-26] for one and only hack for problem <a href="http://codeforces.me/contest/461/problem/C">C</a>! It was really fatal hack for [user:mareksom,2014-08-26] (in last 5 minutes). ### Remarks #### [pr...
Hack me! (CF Round #263, Div. 1), passed pretests, but didn't pass test #13. #### [problem:461D] In nearly every solution which, segment tree passed pretests, but didn't pass test #13.

Full text and comments »

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

157.
By natalia, 16 years ago, translation, In English
Codeforces Beta Round #60: tutorial <b>Problem A</b><div><br></div><div><div>Fist, consider the case when all the numbers are non-zero. You can take a*c*e grams of sand, turn them into b*c*e grams of lead, and them turn into b*d*e grams of gold, and them turn into b*d*f grams of sand. If b*d*f &gt; a*c*e, you can infinitely increase the amount of sand and consequently the amount of gold. Otherwise, if b*d*f &lt;= a*c*e, it is impossible to get infinitely large amount of gold. The same is true when the fraction &nbsp;(a*c*e)/(b*d*f) has zero numerator only or zero denuminator only. Otherwise there is 0/0, and&nbsp;&nbsp;you have to check cases specially.</div><div><br></div><div>I explain, why I make this problem to be problem A.</div><div><br></div><div>1. Solution of the problem requires very little knowledge of programming (only "if"), so it was feasible for all participants.</div><div>2. Tricky cases really exist, but I hoped that "<span class="Apple-style-span" style="font-family: verdana, arial, sans-serif; font-siz...
Codeforces Beta Round #60: tutorial, \le 2$,(2) $k \le 13$., test with

Full text and comments »

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

158.
By MathModel, history, 10 months ago, In English
Invitation to Eolymp Blitz Round 11. ### Hello Codeforces! We're glad to invite you to the [**Eolymp Blitz Round #11**](https://basecamp.eolymp.com/contests/2ad26u26792v7aamtvg0b9c4bg) on [**25th January 2026, at 13:00 UTC**](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20260125T1300&ah=1&am=30&msg=Blitz%20Round%20%2311), a regular programming contest for beginners! <h3 style="color:red;"> PLEASE NOTE THE CHANGED START TIMING OF THE ROUND !!</h3> This is rated competition for members with rating $\le 1750$. ## Format and Difficulty The competition is meant help you get started with competitive programming and improve your problem solving skills. You will be given **1.5 hours** to solve **5 problems** of easy difficulty. The scoring for each task being block-based, meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block. If there is a tie between two participants, the one whose last productive submission (i.e., a submission that...
Invitation to Eolymp Blitz Round 11., ### Hello Codeforces! We're glad to invite you to the [**Eolymp Blitz Round #11**](https

Full text and comments »

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

159.
By vovuh, history, 9 years ago, translation, In English
Educational Codeforces Round 43 [Rated for Div. 2] Hello Codeforces! On [April 30, 17:35 MSK](https://www.timeanddate.com/worldclock/fixedtime.html?day=30&month=4&year=2018&hour=17&min=35&sec=0&p1=166) Educational Codeforces Round 43 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for Div. 2**. It will be held on extented ACM ICPC rules. After the end of the contest you will have one day 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 prepared by Mikhail [user:PikMike,2018-04-29] Piklyaev, Roman [user:Ajosteen,2018-04-29] Glazov, Adilbek [user:adedalic,2018-04-29] Dalabaev and me. We'd like to t...
Educational Codeforces Round 43 [Rated for Div. 2], /fixedtime.html?day=30&month=4&year=2018&hour=17&min=35&sec=0&p1=166) Educational CodeforcesRound 43 will start

Full text and comments »

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

160.
By BledDest, 9 months ago, In English
Kotlin Heroes 14 Announcement Hello Codeforces! <img src="/predownloaded/06/ac/06ac0ca161da9600c032502a8e61c4f216557657.png" style="width:350px;float:right;margin:0 1em 1em 1em;"/> We are happy to announce the new episode of Kotlin Heroes! It is both an opportunity to try learning a new programming language (if you've never coded in Kotlin before) or solve programming problems of very different levels of difficulty in it (if you're already familiar with Kotlin). No matter if you're a professional or a beginner, we'll be glad to see you participate! This is already the fourteenth time we conduct this competition, and the previous 13 episodes had lots of amazingly talented programmers participating. You can see for yourself by checking them out: [Episode 1](https://codeforces.me/contests/1170,1171), [Episode 2](https://codeforces.me/contests/1211,1212), [Episode 3](https://codeforces.me/contests/1297,1298), [Episode 4](https://codeforces.me/contests/1346,1347), [Episode 5: ICPC Round](https://codeforce...
, and the previous 13 episodes had lots of amazingly talented programmers participating. You can see

Full text and comments »

Announcement of Kotlin Heroes: Episode 14
  • Vote: I like it
  • +90
  • Vote: I do not like it

161.
By BledDest, 7 years ago, translation, In English
Codeforces Round #625 (Div.1, Div.2) and Technocup 2020 — Finals Hello everybody! Today, on March 1st, 2020 the final round of Technocup olympiad for Russian-speaking high school students is held. The round starts at 13:00 Moscow time. For those who want to compete on the same problems, we will host two Codeforces rounds: one for the first, and one for the second division. The rounds will start at 13:05 UTC, don't miss them! The round will start just after the onsite contest ends, so it can be postponed slightly if the onsite event timetable changes. If you compete in the Final Round today, you can't compete in the Codeforces round #625. The problems are prepared by [user:MikeMirzayanov,2020-02-29], [user:Endagorion,2020-02-29], [user:tourist,2020-02-29], [user:Roms,2020-02-29], [user:vovuh,2020-02-29], [user:voidmax,2020-02-29], [user:adamant,2020-02-29] and me. Many thanks to [user:KAN,2020-03-01], [user:AndreySergunin,2020-03-01], [user:antontrygubO_o,2020-03-01], [user:kuviman,2020-02-29], [user:MrPaul_TUser,2020-02-29], [user:Stepav...
Codeforces Round #625 (Div.1, Div.2) and Technocup 2020 — Finals, -speaking high school students is held. The round starts at 13:00 Moscow time. For those who want to

Full text and comments »

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

162.
By csacademy, 10 years ago, In English
Round #18 Hello, Codeforces! We are happy to announce that we're going to host a new contest at [csacademy.com](http://csacademy.com). [Round #18](https://csacademy.com/contest/round-18/) will take place on [Sunday, 12/Feb/2017 18:30 (UTC)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=CS+Academy+Round+%2318&iso=20170212T1830&p1=1440&ah=2&am=30). If you want to take part in this round you need to [register](https://csacademy.com/contest/round-18/) before the contest begins. This contest will be a Div1 + Div2, with **8** tasks of varied difficulty that need to be solved in **2** hours and **30** minutes. We are honoured to have [user:desert97,2017-02-10] as problem setter. #### Contest format: - You will have to solve **8** tasks in **2** hours and **30** minutes. - There will be full feedback throughout the entire contest. - Tasks will not have partial scoring, so you need to pass all test cases for a solution to count (ACM-ICPC-style). - Tasks will have dynamic score...
Round #18, [csacademy.com](http://csacademy.com). [Round #18](https://csacademy.com/contest/round-18/) will take place on

Full text and comments »

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

163.
By Lewin, history, 9 years ago, In English
Invitation to IndiaHacks 2nd Elimination 2017 On [Sunday, August 6th, 22:00 IST](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20170806T22&p1=438&ah=3), we will hold the 2nd elimination for IndiaHacks (some more details [here](http://codeforces.me/blog/entry/52069)). The top 900 individuals who qualified through previous rounds will have the opportunity to participate in this round. The top 25 global participants and top 25 Indian participants will advance to the final round. The link to the contest is [here](https://www.hackerearth.com/challenge/competitive/indiahacks-2017-programming-wave-20-eliminator/). After the official round is over, the next morning, on [Monday, August 7th, 11:35 IST](https://www.timeanddate.com/worldclock/fixedtime.html?day=7&month=8&year=2017&hour=9&min=5&sec=0&p1=166), we'll hold an unofficial unrated mirror here on Codeforces. This mirror will have ICPC rules. For participants of the official round, please hold off on discussing the problems publicly until after this mirror is over. ...
will have the opportunity to participate in this round. The top 25 global participants and top 25

Full text and comments »

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

164.
By __baozii__, history, 10 months ago, In English
Invitation to Baozii Cup 3 Hello, Codeforces! We are happy to invite you Baozii Cup 3, which will take place on [contest_time:664651]. You will have $5$ hours to solve $13$ problems, including **at least one** interactive problem. This is a team contest following ACM/ICPC rules, with teams of up to $3$ members. The penalty for an incorrect submission is $20$ minutes. The standings will be frozen for the last $60$ minutes of the contest. Most problems are created and prepared by me, with help from [user:Bronya_H,2026-01-17], [user:zeemanz,2026-01-17], and [user:TRDOG,2026-01-17]. We would like to thank: - [user:MikeMirzayanov,2026-01-17] for creating the fantastic CodeForces and Polygon platform. - [user:Sserxhs,2026-01-17], [user:SATSKY_2025target_LGM,2026-01-17], [user:-WIDA-,2026-01-17], [user:fatalerror,2026-01-17], and [user:itsiftikar02,2026-01-17] for testing the round and providing valuable feedback. - [user:-firefly-,2026-01-17] for generously letting me copy his [Soy Cup #2: ...
], [user:fatalerror,2026-01-17], and [user:itsiftikar02,2026-01-17] for testing theround and providing

Full text and comments »

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

165.
By Michael, 13 years ago, translation, In English
Yandex.Algorithm Test Round Analysis Test Round and its analysis were prepared by [user:snarknews,2013-07-07] and [user:Gassa,2013-07-07]. Problems of the Test Round have already been used before in different competitions. The following rounds will consist of new original problems, and you can still [register](http://algorithm.contest.yandex.com/register/) and compete in the [Qualification Round](http://algorithm.contest.yandex.com/contest/307/enter/). During the round a lot of participants tried to make "blind" submits, from time to time even going to the top places, but as the system tests showed with only one problem solved in fact. By the end of the round [user:tourist,2013-07-07] was at the first place with all problems but B submitted "blind". [user:vepifanov,2013-07-07] was at the second place with A, C and D submitted "blind", but B and F &mdash; submitted "open" (both with a wrong attempt), [user:Anton_Lunyov,2013-07-07] was at the third place with only C submitted "blind". All other participants had less ...
Yandex.Algorithm Test Round Analysis, the product of the first $13$ positive integers is greater than $10^9$, the answer is not greater, Test Round and its analysis were prepared by [user:snarknews,2013-07-07] and [user:Gassa,2013-07-07

Full text and comments »

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

166.
By Edvard, 11 years ago, translation, In English
Educational Codeforces Round 2 Hi, Codeforces! Educational Codeforces Round 2 will take place on [November 27th, 2015, at 15:00 UTC](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Educational+Codeforces+Round+2&iso=20151127T1500) for the first and second divisions. You can read about educational rounds [here](http://codeforces.me/blog/entry/21496). The round will be unrated for all users and it will be held with extented ACM ICPC rules. You will have two hours to solve six problems. After that you will have one day to hack any solution you want. You will have access to copy any solution and test it locally. Round was prepared by me, Edvard Davtyan. Problems was invented by me and [user:MikeMirzayanov,2015-11-13]. I hope you will enjoy the problems. Good luck and have fun! UPD: Thanks a lot to [user:PrinceOfPersia,2015-11-27] for testing the problems and [user:Delinur,2015-11-27] for checking my bad English (in problem statements). UPD2: The first part of competition is over. I hope th...
Educational Codeforces Round 2

Full text and comments »

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

167.
By steven.novaryo, history, 4 years ago, In English
COMPFEST 14 Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred) <img alt="logo" src="/predownloaded/03/5f/035ff83d655937b478f5fe9f351f79ac0781f6d2.png" style="float: right;height: 100.0px;margin: 10.0px;max-width: 100.0%;max-height: 100.0%;"> Hello, **Codeforces**! &#129303; We are happy to invite you to participate in [COMPFEST 14 Preliminary Online Mirror (Unrated, ICPC Rules, Teams Preferred)](https://codeforces.me/contests/1725) on <a class="contest-time" contestid=1725></a>. COMPFEST is a national **ICPC-style contest** for university students in Indonesia. The problems are written and prepared by [user:Pyqe,2022-09-02], [user:steven.novaryo,2022-09-02], [user:Nyse,2022-09-02], [user:muhammadhasan01,2022-09-02], [user:gansus,2022-09-02], [user:nandonathaniel,2022-09-02], [user:FerdiHS,2022-09-02], [user:TakeMe,2022-09-02], and [user:NeoZap,2022-09-02]. We would also like to thank: - [user:KAN,2022-09-02] for helping to host the mirror round; - rama_pang ([user:rama_pang,2022-09-02], [user:zappeko,2022-09-02], [user:Berted,202...
mirror round; - rama_pang ([user:rama_pang,2022-09-02], [user:zappeko,2022-09-02], [user:Berted

Full text and comments »

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

168.
By mohammedehab2002, history, 6 years ago, In English
Codeforces round #649 editorial ### [problem:1364A] Let's start with the whole array. If every element in it is divisible by $x$, the answer is $-1$; if its sum isn't divisible by $x$, the answer is $n$. Otherwise, we must remove some elements. The key idea is that removing an element that is divisible by $x$ doesn't do us any benefits, but once we remove an element that **isn't**, the sum won't be divisible by $x$. So let the first non-multiple of $x$ be at index $l$, and the last one be at index $r$. We must either remove the prefix all the way up to $l$ or the suffix all the way up to $r$, and we'll clearly remove whichever shorter. Code link: https://pastebin.com/j2Y8AJBA Alternatively, we can notice that this means the answer is either a prefix or a suffix, so we can simply bruteforce them all. ### [problem:1364B] TL;DR the answer contains the first element, last element, and all the local minima and maxima, where a local minimum is an element less than its 2 adjacents, and a local maximum is an e...
Codeforces round #649 editorial, if you run it for a million test cases, it would still pass. In fact, try to make it deterministic

Full text and comments »

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

169.
By BledDest, 8 years ago, translation, In English
Educational Codeforces Round 46 [Rated for Div. 2] Hello, Codeforces! On [June 27, 17:35 MSK](https://www.timeanddate.com/worldclock/fixedtime.html?day=27&month=6&year=2018&hour=17&min=35&sec=0&p1=166) Educational Codeforces Round 46 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. As usual, the round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM ICPC rules. 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. The problems were prepared by Adilbek [user:adedalic,2018-06-26] Dalabaev, Roman [user:Ajosteen,2018-06-26] Glazov, Mikhail [user:PikMik...
Educational Codeforces Round 46 [Rated for Div. 2], ?day=27&month=6&year=2018&hour=17&min=35&sec=0&p1=166) Educational Codeforces Round 46 will start

Full text and comments »

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

170.
By kpw29, 5 years ago, In English
New Year wishes from participants — "Cyan Rebellion 2022" survey results Hi! Two weeks ago I made a survey [link here:](https://codeforces.me/blog/entry/98424) about making Codeforces better. In this blog I am sharing the results. Consider reading the previous blog first, but this one should be self-contained as well. TLDR ------------------ The quality of Codeforces problems has increased over time, and people are mostly happy. Participants would probably be even happier with a greater variety of problem topics. It's important for setters to consider the contest as a whole, including the target audience of a given task. Some users wrote essays longer than the entire survey. How to access the results ------------------ Before we start, I would like to invite everyone to take a look at the raw data. If you are keen on showing off your data analysis skills, please do so! I hope that some of us will manage to find more interesting insights taking into account preferences of users from various skill groups. [Raw results](https://docs.google.com/...
challenges?"> ![ ](/predownloaded/1e/13 /1e1373e6ea994423b4d94145d28f7d1eafa7ac56.png)

Full text and comments »

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

171.
By plourde27, history, 6 years ago, In English
Invitation to the CodeRams Algorithm Contest #1 Hello Codeforces! On [contest_time:102892], the [CodeRams Algorithm Contest #1](https://codeforces.me/contests/102892) will occur. This is the first algorithm contest of the year for the CodeRams, my school coding club. We've held many contests over the past several months, but since this one is more like a Codeforces round, we've decided to open an online mirror of the contest on the Codeforces Gym. The contest will contain 9 problems, and you'll have 3 hours to solve them. The first few problems are fairly easy, designed to be solvable by anyone, while the last few are more difficult. The contest will likely be more interesting for users with a rating of under 2100, but anyone is welcome to participate. Each problem in the contest has a point value, with harder problems being worth more points. Contestants will be sorted first by their total number of points, and then by their solve times, if there is a tie. Some of the problems will also have subtasks and partial scores. ...
is more like a Codeforces round, we've decided to open an online mirror of the contest on the

Full text and comments »

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

172.
By EvenImage, history, 10 years ago, In English
My sad story When I was submitting the problem D in round #371, I clicked the "Choose File" button and selected my code. Before the submission, I read my code another time, found a bug in my code and fixed it. And then I clicked the "submit" button. But it turned out that my solution got wrong answer on pretest 4. I stress-tested my solution, and found it passed the big random data. I was really shocked. umm... Maybe my solution failed on some small testcases. So I tried many ways to generate testcases. But my solution was right on all the testcases I generated. After struggling for about 40mins, I gave up and submitted it again. It passed all the pretests. I compared two codes, and just found I submitted the old version (before fixing the bug) at first time. After asking my roommate, he said when you clicked the "Choose File" button, it would upload the file instead of recording the path. In the rest time of the contest, I tried to solve problem B and E but failed. <S>I think ...
When I was submitting the problem D in round #371, I clicked the "Choose File" button and selected

Full text and comments »

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

173.
By rfpermen, history, 5 years ago, In English
Invitation to TOKI Mirror Open Contest: BNPC-HS 2021 Final Round <p align="center"><img src="https://i.imgur.com/JpX9oOj.png"></p> We are excited to invite you to [TOKI Mirror Open Contest (Unrated) &mdash; BNPC-HS 2021 Final Round](https://tlx.toki.id/contests/tmoc-bnpchs-2021-final) on [Saturday, October 16th 2021 13:05 UTC+7](https://www.timeanddate.com/worldclock/fixedtime.html?msg=BNPC-HS+2021+Final+Round+Mirror&iso=20211016T1305&p1=108&ah=5). The contest will be **5 hours** long and will feature **10 problems**. Note that you should participate in the contest **individually**. Scoring will be based on **ICPC rules**. The problems were written by [user:KerakTelor,2021-10-11], [user:Owmicron,2021-10-11], [user:Yoshiyuki,2021-10-11], [user:siplusplus,2021-10-11], [user:rfpermen,2021-10-11], [user:Berted,2021-10-11], [user:Nich728,2021-10-11], [user:VinsenN,2021-10-11], and [user:vioalbert,2021-10-11]. Problem components were prepared by the Scientific Committee: [user:rfpermen,2021-10-11], [user:Owmicron,2021-10-11], [user:ZeroScar,2021-...
Invitation to TOKI Mirror Open Contest: BNPC-HS 2021 Final Round, to [TOKI Mirror Open Contest (Unrated) — BNPC-HS 2021 Final Round ](https://tlx.toki.id/contests

Full text and comments »

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

174.
By kostka, 12 years ago, In English
Hack me! (Codeforces Round #283 (Div. 1)) And [contest:497]. It wasn't very good round for hackers (especially because of strong pretests), but still &mdash; let's take a quick look. (Hacks description will be added later, maybe tomorrow?) Previous posts can be found [here](http://codeforces.me/search?query=hackme), including [div. 2](http://codeforces.me/blog/entry/15247). [cut] <h3>Stats</h3> Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>|<small>Hackers efficiency**</small>| :---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:497A] </small> | 54 (41.86%) | 55 (42.64%)| 20 (15.50%) | 129 | 112 (13.58%) | 713 (86.42%) | 825 | 32.53% | <small> [problem:497B] </small> | 24 (31.17%) | 23 (29.87%)| 30 (38.96%) | 77 | 50 (9.92%) | 454 (90.08%) | 504 | 32.43% | <small> [problem:497C] </small> | 0 (0.00%) | 1 (100.00%)| 0 (0.00%) | 1 | 10 ...
Hack me! (Codeforces Round #283 (Div. 1)), > | 0 | 0 | 0 | 0 | 5 (38.46%) | 8 (61.54%)| 13 | 0.00% | [problem:497E] | 0 | 0 | 0, And [contest:497]. It wasn't very good round for hackers (especially because of strong pretests

Full text and comments »

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

175.
By ACGN, history, 2 years ago, In English
Codeforces Round 987 (Div. 2) Editorial <spoiler summary="A little backstory about the round (ACGN)">The Highschool CPers (HSCP) Discord server was created in April 2022 by [user:pwned,2024-11-14], which over time grew into a close-knit community of highschool competitive programmers. I joined in the same month of its creation, and in the next month I approached [user:pwned,2024-11-14] about the possibility of setting a contest. Thus the HSCP round concept was born. Over the next month or so, the initial problems were born; the current problems A and F were produced in June-July 2022. We had several problem ideas by then, enough to set a div.2 round. However, as I was going to be busy in my 5th year of high school, and may not be that responsive to coordinators, the contest was in the ownership of [user:pwned,2024-11-14], who needed to wait until he reached master in order to propose the set on Codeforces. However, this step took almost 1.5 years as he would stay at candidate master for 57 consecutive contests, eve...
Codeforces Round 987 (Div. 2) Editorial, The Highschool CPers (HSCP) Discord

Full text and comments »

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

176.
By kuviman, 7 years ago, translation, In English
AI Cup 2019 Hello everyone! Mail.Ru Group announces start of the annual artificial intelligence programming championship — [AI Cup 2019](https://russianaicup.ru/). ![ ](https://hsto.org/webt/tw/r9/w5/twr9w5yd649q0nvqdja9fxnftbw.jpeg) AI Cup — open artificial intelligence programming contest. Test yourself writing a game strategy! It’s simple, clear and fun! This year's theme is — platformer. We are waiting for you on [our site](https://russianaicup.ru/)! The site is already open, you can start implementing your strategies. Eighth AI Cup championship is named CodeSide. You are to program an artificial intelligence to control a team of units. Your strategies will compete with each other in the Sandbox and the championship. Currently availiable programming languages: C++, C#, F#, D, Go, Java, Kotlin, Scala, Python, Ruby, Rust. The Sandbox is already open. Good luck! Currently the championship is in beta-test mode, and on December 7th Sandbox will start working officially! ![ ](ht...
/twr9w5yd649q0nvqdja9fxnftbw.jpeg) AI Cup — open artificial intelligence programming contest.Test

Full text and comments »

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

177.
By intrusiv, 3 years ago, In English
Codeforces Round 915 (Div. 2) Hello, Codeforces! Or, as we like to say in Romania: _Dacă voi nu mă vreți, eu vă vreu_, Codeforces! I am glad to finally invite you to participate in [contest:1905], which will start on [contest_time:1905]. You will be given **6** problems and **2 hours** to solve them. The problems were supposed to be authored and prepared by [user:valeriu,2023-11-16], but in reality they were by <a class='rated-user user-gray' href='/profile/tibinyte'title='Cheater tibinyte'>tibinyte</a>. I would like to thank: - [user:Artyom123,2023-05-25], for his [recherché](https://www.collinsdictionary.com/dictionary/english/recherche) coordination. - <s><b>S<font color='red'>ay_my_name</b> for LGM testing</s> - [user:cristi_tanase,2023-12-13], [user:Gheal,2023-12-13], [user:andrei_boaca,2023-12-13],<br>[user:Andreasyan,2023-12-13], [user:eggag32,2023-12-13], [user:i8d,2023-12-14], [user:Riblji_Keksic,2023-12-13], [user:htetgm,2023-12-13], [user:rolandpetrean,2023-12-13], [user:Lotomba,202...
Codeforces Round 915 (Div. 2), testing - [user:cristi_tanase,2023-12-13], [user:Gheal,2023-12-13], [user:andrei_boaca,2023

Full text and comments »

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

178.
By kostka, 12 years ago, In English
Hack me! (Codeforces Round #277.5 (Div. 2)) Welcome after the long break in Hack me! ([contest:489]). Previous posts can be found [here](http://codeforces.me/search?query=hackme). [cut] <h3>Stats</h3> Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other* | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>| :---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:489A] </small> | 11 (28.21%) | 24 (61.54%)| 4 (10.26%) | 39 | 400 (17.22%) | 1923 (82.78%) | 2323 | <small> [problem:489B] </small> | 185 (61.26%) | 102 (33.77%)| 15 (4.97%) | 302 | 427 (18.09%) | 1934 (81.91%) | 2361 | <small> [problem:489C] </small> | 8 (11.59%) | 59 (85.51%)| 2 (2.90%) | 69 | 158 (8.90%) | 1618 (91.10%) | 1776 | <small> [problem:489D] </small> | 2 (14.29%) | 6 (42.86%)| 6 (42.86%) | 14 | 38 (4.99%) | 724 (95.01%) | 762 | <small> [problem:489E] </small> | 0 | 0 | 0 | 0 | 23 (41.07%) | 33 (58.93%)| 56 | <small> [problem:4...
Hack me! (Codeforces Round #277.5 (Div. 2)), (58.93%)| 56 | [problem:489F] | 21 (55.26%) | 13 (34.21%)| 4 (10.53%) | 38 | 80, :489F] | 21 (55.26%) | 13 (34.21%)| 4 (10.53%) | 38 | 80 (36.87%) | 137 (63.13%) | 217

Full text and comments »

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

179.
By kevinsogo, history, 7 years ago, In English
Invitation to join the UP ACM Algolympics 2020 Mirrors at the Codeforces Gym Hello, Codeforces community! I'd like to invite you to the mirrors of the UP ACM Algolympics 2020 Elimination and Final Rounds. Algolympics is an annual contest organized by the Association for Computing Machinery, University of the Philippines Chapter, held onsite at the University of the Philippines Diliman. It is open to teams consisting of undergraduate college students from the Philippines. The mirrors are open to everyone! **Elimination Round Mirror** - There are 18 problems over several days. - Every problem is worth 1 point. - Scoring is binary. There are no partial points. - The penalty is the latest submission for an eventually solved problem. - The mirror will be held on February 27, 2020 (12:00pm UTC+8) &mdash; March 1, 2020 (6:00am UTC+8). - [Gym contest](https://codeforces.me/gym/102535) **Final Round Mirror** - There are 13 problems over 5 hours. - Every problem is worth 1 point. - Scoring is binary. There are no partial points. - The penalty i...
](https://codeforces.me/gym/102535) **Final Round Mirror** - There are 13 problems over 5 hours

Full text and comments »

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

180.
By kuviman, 6 years ago, In English
AI Cup 2020 Hello everyone! [AI Cup 2020](https://russianaicup.ru/) &mdash; the annual artificial intelligence programming championship by Mail.Ru Group is already running. ![ ](https://hsto.org/webt/lc/cr/py/lccrpynunbyrcvkh1v7lxtgdhdu.jpeg) AI Cup — open artificial intelligence programming contest. Test yourself writing a game strategy! It’s simple, clear and fun! This year's theme is — RTS. We are waiting for you on [our site](https://russianaicup.ru/)! The site is already open, you can start implementing your strategies. Ninth AI Cup championship is named CodeCraft. You are to program an artificial intelligence to control a number of units, gather resources, build your settlement and attack your enemies. Your strategies will compete with each other in the Sandbox and the championship. Currently availiable programming languages: C++, C#, F#, D, Go, Java, Kotlin, Scala, Python, Rust. The Sandbox is already open. Good luck! ## Schedule - Sandbox: already open for everyone. -...
. - Round 1: December 12-13. - Round 2: December 19-20. - Finals: December 26-28. ## Prizes In

Full text and comments »

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

181.
By MathModel, history, 15 months ago, In English
Eolymp Blitz #1 ### Hello Codeforces ! I'm glad to invite you to the First [**Eolymp Blitz Round #1**](https://basecamp.eolymp.com/en/contests/k4s9lmqljd6ttcsrh0fm71hbec) on [**6th September, at 10:00 UTC**](https://www.timeanddate.com/worldclock/fixedtime.html?day=6&month=9&year=2025&hour=13&min=00&sec=0&p1=166) , a regular programming contest for beginners! This is rated competition for members with rating $\le 1600$. ## Format and Difficulty The competition is meant help you get started with competitive programming and improve your problem solving skills. You will be given **1.5 hours** to solve **5 problems** of easy difficulty. The scoring for each task being block-based, meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block. If there is a tie between two participants, the one whose last productive submission (i.e., a submission that added at least one point) was made *earlier* will be ranked higher in the leaderboard...
] for testing the contest. ## Sponsors This round is sponsored by [Acai Travel](https

Full text and comments »

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

182.
By vaaven, history, 17 months ago, In English
Codeforces Round 1031 (Div. 2) Hello, Codeforces! We're glad to invite you to take part in [contest:2113], which will start on [contest_time:2113]. **Note the unusual start time of the round**. You will be given **6 problems** and **2 hours** to solve them. This round will be **rated** for participants whose rating is **below 2100**. Participants with higher rating can participate unofficially. The problems were authored and prepared by [user:bashkort,2025-06-13], [user:TheEvilBird,2025-06-13], [user:127.0.0.1,2025-06-13], [user:Mangooste,2025-06-13] and Moscow Olympiad Scientific Committee. The round is based on All-Russian olympiad in the name of Keldysh. We would like to thank - [user:Artyom123,2025-06-13] for his high-speed coordination; - [user:A_G,2025-06-15], [user:ahsoltan,2025-06-15], [user:Proof_by_QED,2025-06-15], [user:larush,2025-06-15], [user:Mikhango,2024-06-14], [user:Ormlis,2025-06-15], [user:_istil,2025-06-14] for testing; - [user:MikeMirzayanov,2025-06-13] for creating Codeforces ...
Codeforces Round 1031 (Div. 2), - [user:Artyom123,2025-06-13] for his high-speed coordination; - [user:A_G,2025-06-15, -13], [user:Mangooste,2025-06-13] and Moscow Olympiad Scientific Committee. The round is based on

Full text and comments »

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

183.
By SanguineChameleon, 19 months ago, In English
Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2) ### _✨ It took over a year, but it's finally here! ✨_ --- Hello everyone! :D We are proud to invite you to participate in [contest:2096], which will be held on [contest_time:2096]. The round will be **rated for everyone**. You will be given **8 problems** and **2 hours** to solve them. One of the problems will be interactive, so make sure to read the [guide for interactive problems](https://codeforces.me/blog/entry/45307) before the contest. All problems were authored by [user:thenymphsofdelphi,2025-04-14] and me. We would like to thank the following people: - [user:244mhq,2025-04-14], for coordinating the round; - [user:7oSkaaa,2025-04-14], [user:ahmetalp,2025-04-14], [user:Error_Yuan,2025-04-14], [user:Hori,2025-04-14], [user:larush,2025-04-14], [user:N_z__,2025-04-14], [user:omeganot,2025-04-14], [user:RobeZH,2025-04-14], [user:Um_nik,2025-04-14], [user:user202729,2025-04-14], [user:VHPro,2025-04-14], [user:zltzlt,2025-04-14], for testing; - [user:MikeMirzaya...
Neowise Labs Contest 1 (Codeforces Round 1018, Div. 1 + Div. 2), round will be **rated for everyone**. You will be given **8 problems** and **2 hours** to solve them

Full text and comments »

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

184.
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 51 [Rated for Div. 2] On [contest_time:1051] [contest:1051] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM 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. The problems were invented and prepared by Roman [user:Ajosteen,2018-09-19] Glazov, Ivan [user:BledDest,2018-09-19] Androsov and me. Good luck to all participants! Our friends at Harbour.Sp...
Educational Codeforces Round 51 [Rated for Div. 2], href="http://codeforces.me/blog/entry/51208">blog post. This round will be **rated for the

Full text and comments »

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

185.
By MathModel, history, 9 months ago, In English
Invitation to Eolymp Blitz #14 ### Hello Codeforces! We're glad to invite you to the [**Eolymp Blitz Round #14**](https://basecamp.eolymp.com/contests/37pbmqipe915d0nhjqhvk0ibno) on [**1st March 2026, at 13:00 UTC**](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20260301T1300&ah=1&am=0&msg=Blitz%20Round%20%2314), a regular programming contest for beginners! This is rated competition for members with rating $\le 1750$. ## Format and Difficulty The competition is meant help you get started with competitive programming and improve your problem solving skills. You will be given **$ \color{red}{\textbf{1}}$ hours** to solve **5 problems** of easy difficulty. The scoring for each task being block-based, meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block. If there is a tie between two participants, the one whose last productive submission (i.e., a submission that added at least one point) was made *earlier* will be ranked higher...
### Hello Codeforces! We're glad to invite you to the [**Eolymp Blitz Round #14**](https

Full text and comments »

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

186.
By Alex_2oo8, 13 years ago, translation, In English
Codeforces Round #206 Hello everyone! Very soon [on 13 october at 19:30 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?day=13&month=10&year=2013&hour=19&min=30&sec=0&p1=166) will take place Codeforces Round #206. I am author of the problems and it's my first round! I would like to thank problem coordinator Gerald Agapov ([user:Gerald,2013-10-13]), Evgeny Vihrov ([user:gen,2013-10-13]) for problem testing and Mary Belova ([user:Delinur,2013-10-13]) for translation of statements to English. Special thanks to Michael Mirzayanov ([user:MikeMirzayanov,2013-10-13]) for marvelous Codeforces and Polygon systems. Score distribution will be standard in both divisions: 500-1000-1500-2000-2500. I wish good luck for everyone and hope that you will enjoy the problems! Congratulations to the winners! Special congratulations to [user:rng_58,2013-10-14], the only participant, who have solved all 5 problems! First division: 1. [user:rng_58,2013-10-14] 1. [user:sankear,2013-10-14] 1. [user:VA...
Codeforces Round #206, ([user:gen,2013-10-13]) for problem testing and Mary Belova ([user:Delinur,2013-10-13]) for, /fixedtime.html?day=13&month=10&year=2013&hour=19&min=30&sec=0&p1=166) will take place CodeforcesRound

Full text and comments »

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

187.
By XiangXunyi, history, 9 months ago, In English
1e18 + 1 == 1e18 in C++ As the title, `1e18 + 1 == 1e18` in C++. This is because the double type stores the first 53 binary bits of a number. So the number 1 will be ignored. And most of submissions which fst on test 13 of problem C of edu round 187 are for this reason. UPD: I collected some suggestions from the comments: 1. Use `1000000000000000001` (I do not suggest it because it is prone to errors.) 2. Use `(long long)(1e18) + 1` 3. Use `1e18L + 1` 4. Use `1'000'000'000'000'000'001LL`
13 of problem C of edu round 187 are for this reason. UPD: I collected some suggestions from the, And most of submissions which fst on test 13 of problem C of edu round 187 are for this reason.

Full text and comments »

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

188.
By susenyang, history, 19 months ago, In English
Welcome to The 14th Huazhong Agricultural University Programming Contest! Hello Codeforces Community! I'm [user:susenyang,2025-04-13], and I'm excited to share a contest with you! This contest is [contest:105838], an official contest hosted by my university. I believe it's a great contest, and I hope you'll enjoy it. You will have $5$ hours to solve $13$ problems. The round will be hosted by rules of ICPC and the penalty is 20 minutes per wrong submission. Author List: [user:susenyang,2025-04-13], [user:Linear_L,2025-04-13], [user:zycpdd,2025-04-13], [user:23337456,2025-04-13], [user:tryandtryagain,2025-04-13], [user:alicespring,2025-04-13] We would like to thank: - [user:fzx,2025-04-13] for the red testing. - [user:thisislike_fan,2025-04-13], [user:gjyyyds,2025-04-13] for the orange testing. - [user:7_divided_by_3,2025-04-13], [user:xiojoy,2025-04-13] for the purple testing. - [user:cmy415,2025-04-13], [user:mojo__hugo,2025-04-13], [user:AEcreator,2025-04-13], [user:One_Wan,2025-04-13], [user:Silencer76,2025-04-13], [user:sakuya_maid_fans,...
like to thank: - [user:fzx,2025-04-13] for the red testing. - [user:thisislike_fan,2025-04-13

Full text and comments »

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

189.
By kostka, 12 years ago, In English
Hack me! (Codeforces Round #279 (Div. 2)) Hello and welcome in [contest:490] &mdash; description of hacks. Previous posts can be found [here](http://codeforces.me/search?query=hackme). [cut] <h3>Stats</h3> Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other* | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>| :---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:490A] </small> | 13 (27.66%) | 22 (46.81%)| 12 (25.53%) | 47 | 80 (3.55%) | 2174 (96.45%) | 2254 | <small> [problem:490B] </small> | 9 (15.79%) | 21 (36.84%)| 27 (47.37%) | 57 | 268 (20.12%) | 1064 (79.88%) | 1332 | <small> [problem:490C] </small> | 218 (52.40%) | 102 (24.52%)| 96 (23.08%) | 416 | 376 (42.11%) | 517 (57.89%) | 893 | <small> [problem:490D] </small> | 15 (60.00%) | 9 (36.00%)| 1 (4.00%) | 25 | 172 (39.27%) | 266 (60.73%) | 438 | <small> [problem:490E] </small> | 0 (0.00%) | 1 (100.00%)| 0 (0.00%) | 1 | 68 (33.33%) | 13...
Hack me! (Codeforces Round #279 (Div. 2)), on final tests| :---:|:---:|:---:|:---:|:---:|:---:| [problem:490A] | 13, >| :---:|:---:|:---:|:---:|:---:|:---:| [problem:490A] | 13 (27.66%) | 22 (46.81

Full text and comments »

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

190.
By MikeMirzayanov, history, 11 years ago, translation, In English
After Educational Codeforces Round 1 Educational Codeforces Round 1 is over. During 24 hours after coding phase many of you tried to hack other's solutions. And it were many successful hacks! It was 573 successful hacks, made by 101 hackers. Here are most effective: | # | Hacker | Number of succ. hacks | |---|-------|-------------------------| | 1 | [user:yashkumar18,2015-11-14] | 36 | | 2 | [user:halyavin,2015-11-14] | 31 | | 3 | [user:TrungPhan,2015-11-14] | 26 | | 4 | [user:Orenji.Sora,2015-11-14] | 25 | | 5 | [user:ykaya,2015-11-14] | 24 | | 6 | [user:xd560,2015-11-14] | 23 | | 7 | [user:greencis,2015-11-14] | 22 | | 8 | [user:kondranin,2015-11-14] | 20 | | 9 | [user:Allanur_tkm,2015-11-14] | 19 | | 10 | [user:bayram98,2015-11-14] | 18 | | 11 | [user:williamhu08,2015-11-14] | 17 | | 12 | [user:ErdemKirez,2015-11-14] | 17 | | 13 | [user:muratt,2015-11-14] | 13 | | 14 | [user:lifecodemohit,2015-11-14] | 11 | | 15 | [user:hnust_zhaozhixuan,2015-11-14] | 11 | | 16 | [user:BigBag,2015-11-14] | 11 | ...
After Educational Codeforces Round 1, Educational Codeforces Round 1 is over. During 24 hours after coding phase many of you tried to

Full text and comments »

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

191.
By YouKn0wWho, 4 years ago, In English
[Tutorial] Common Mistakes in Competitive Programming and How to Avoid Them One thing is for sure. You do make mistakes. I also make miskates and that's what makes us human. But what we can surely do is &mdash; to try to minimize the errors that we make throughout our life. I have compiled some of the mistakes that I made in my early Competitive Programming phase. I also mentioned how to avoid them. Also, in most cases, I will give you a chance to find out what the bug is before I reveal the culprit as I tried to make this blog interactive. The codes that I have used in this blog have been written in C++ as it is the most used language for CP. **So, if you are new to CP, stick with me as you might don't wanna repeat the mistakes that I made when I was a beginner.** #### Mistake 1 Check out the following code: <spoiler summary="Code"> ~~~~~ #include<bits/stdc++.h> using namespace std; int main() { int a = 1000'000'000,b = 1000'000'000; long long product = a * b; cout << product << '\n'; return 0; } ~~~~~ </spoiler> The outp...
$24.9999999999999$ and when converting it to int, it will return $24$. You may use `round(pow(5, 2

Full text and comments »

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

192.
By kostka, 12 years ago, In English
Hack me! (Codeforces Round #281 (Div. 2)) <s>While waiting for [API](http://codeforces.me/api/contest.hacks?contestId=494) to update,</s> (it has been updated already) let's look at hacks in [contest:493]. That was really good round (even I had some hacks :)). Previous posts can be found [here](http://codeforces.me/search?query=hackme). [cut] <h3>Stats</h3> Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>| :---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:493A] </small> | 18 (22.50%) | 20 (25.00%)| 42 (52.50%) | 80 | 249 (13.16%) | 1643 (86.84%) | 1892 | <small> [problem:493B] </small> | 456 (62.81%) | 178 (24.52%)| 92 (12.67%) | 726 | 509 (29.84%) | 1197 (70.16%) | 1706 | <small> [problem:493C] </small> | 161 (47.35%) | 100 (29.41%)| 79 (23.24%) | 340 | 715 (58.56%) | 506 (41.44%) | 1221 | <small> [problem:493D] </small> | 22 (59.46%...
Hack me! (Codeforces Round #281 (Div. 2)), %) | 506 (41.44%) | 1221 | [problem:493D] | 22 (59.46%) | 13 (35.14%)| 2 (5.41%) | 37, > (it has been updated already) let's look at hacks in [contest:493]. That was really goodround (even I

Full text and comments »

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

193.
By tzaph_, history, 4 years ago, In English
Invitation to TLX Regular Open Contest #29 <img width="350px" src="/predownloaded/2d/30/2d30c17aba8882b75b0b9b0aa7c222a519bcc7ba.png"> Hello, Codeforces! Hope you are ready to do some laundry! We are excited to invite you to <b>TLX Regular Open Contest (TROC) #29!</b> Key details: <ul> <li>Contest links: [TLX](https://tlx.toki.id/contests/troc-29)</li> <li> Time: [5th December 2022, 13:05 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=TLX%20Regular%20Open%20Contest%20%2329&iso=20221205T130500)</li> <li> Writer: [user:Zappeko,2022-12-02]</li> <li> Duration: 2 hours </li> <li> Problems: 8 <strike>buttons</strike> </li> <li> Scoring distribution: <b>100 &mdash; 200 &mdash; 300 &mdash; 450 &mdash; 500 &mdash; 550 &mdash; 650 &mdash; 700 </b> </li> </ul> I would like to thank: <ul> <li> [user:Pyqe,2022-12-02] and [user:steven.novaryo,2022-12-02] for their help in coordinating the round and in preparing the problem components.</li> <li> [user:Kinon,2022-12-02], [user:Drew_,2022-12-02], and [user...
/contests/troc-29) * Time: [5th December 2022, 13:05 UTC](https://www.timeanddate.com

Full text and comments »

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

194.
By adamant, history, 18 months ago, In English
Complex FFT is not as bad as you think ... Probably. Hi everyone! As some of you _might_ already know, I don't like NTT. Primary reasons for this are: - I don't like modular arithmetic optimizations (Montgomery, etc). - I don't like NTT mods, and prefer good, old $10^9+7$. - I do like algebra of complex numbers. But, to my regret, the overwhelming mainstream in modern competitive programming is NTT. Primary reasons are: - It's allegedly faster. - It needs less memory. - It has no precision issues. - People don't like algebra of complex numbers. There is nothing I can do about the last, but today I'll address the first 3. Optimizing complex FFT was on my mind for quite some time, but I didn't really work on it _that much_ until the [blog](https://codeforces.me/blog/entry/142063) by [user:Qwerty1232,2025-04-24] on optimizing NTT has dropped, which motivated me to actually put some serious effort into this. In this blog, we will primarily focus on optimizations that are specific to complex arithmetic...
approach to FFT](https://codeforces.me/blog/entry/117947) to the community. - [user:sslotin,2025-05-13

Full text and comments »

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

195.
By adr8sy, history, 5 months ago, In English
Code-X-Culture 3.0 Hello Everyone, **IIITA Freshers**, are thrilled to invite all competitive coders to participate in **Code-X-Culture 3.0**, our flagship competitive coding challenge. This contest is a true test of speed, logic, and algorithmic clarity. Whether you're a beginner or an experienced coder, Code-X-Culture has something for everyone. ![ ](/predownloaded/59/bf/59bfefe1afe0cfd788c7599010183f1a65311ce7.jpeg) ### Contest Details * **Date:** Saturday, June 13, 2026 * **Time:** 20:00 IST (2 Hours) * **Link:** [Click here to Register](https://codeforces.me/contestInvitation/35f81fdd59723a3da834fd462654cec882f2b278) * **Community:** [Join WhatsApp Group](https://chat.whatsapp.com/GdP6KfrPgBtCGO9JbfjNZH) --- ### Problem Setters & Testers A huge thanks to the team for their hard work in preparing the round: **Setters:** [user:BruteForceMe,2026-06-13], [user:adr8sy,2026-06-13], [user:suvayu69,2026-06-13], [user:vicks112,2026-06-13], [user:ember495,2026-06-13], [user:Nam...
hard work in preparing the round: **Setters:** [user:BruteForceMe,2026-06-13], [user:adr8sy,2026

Full text and comments »

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

196.
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 49 [Rated for Div. 2] On [contest_time:1027] Educational Codeforces Round 49 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM 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. The problems were invented and prepared by Vladimir [user:Vovuh,2018-08-17] Petrov, Adilbek [user:adedalic,2018-08-17] Dalabaev, Ivan [user:BledDest,2018-08-17] Androsov, Mike [u...
Educational Codeforces Round 49 [Rated for Div. 2], On [contest_time:1027] Educational Codeforces Round 49 will start. Series of Educational Rounds

Full text and comments »

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

197.
By kostka, 12 years ago, In English
Hack me! (CF Round #269, Div. 2) Hey there! I am testing some new stuff (according to your suggestions) and playing with matplotlib (learning it to be precise), so here is a bunch of statistics (only) in some past contest ([contest:471]). Previous posts can be found [here](http://codeforces.me/search?query=hackme). [cut] <h3>Stats</h3> By "rejected solutions" we understand solutions, which didn't pass the final tests (and were tested on them). Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other | Sum | <small>Rejected solutions</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>| :---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:471A] </small> | 401 (55.08%) | 289 (39.70%)| 38 (5.22%) | 728 | 514 (18.02%) | 2338 (81.98%) | 2852 | <small> [problem:471B] </small> | 10 (13.16%) | 60 (78.95%)| 6 (7.89%) | 76 | 204 (10.01%) | 1834 (89.99%) | 2038 | <small> [problem:471C] </small> | 2 (6.06%) | 29 (87.88%)| 2 (6.06%) | 33 | 70 (...
Hack me! (CF Round #269, Div. 2), | [problem:471D] | 7 (25.00%) | 13 (46.43%)| 8 (28.57%) | 28 | 91 (18.42%) | 403, Hey there! I am testing some new stuff (according to your suggestions) and playing with matplotlib

Full text and comments »

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

198.
By kostka, 12 years ago, In English
Hack me! (Codeforces Round #284 (Div. 2)) And statistics from [contest:499] (this round should be named after [user:dreamoon,2014-12-24]). Previous posts can be found [here](http://codeforces.me/search?query=hackme), including [post for div. 1](/blog/entry/15413). [cut] <h3>Stats</h3> We had only 21 successful hacks for this round (pretests were pretty good). Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other* | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>|<small>Hackers efficiency**</small>| :---:|:---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:499A] </small> | 13 (18.06%) | 39 (54.17%)| 20 (27.78%) | 72 | 108 (5.03%) | 2041 (94.97%) | 2149 | 10.74% <small> [problem:499B] </small> | 2 (2.47%) | 15 (18.52%)| 64 (79.01%) | 81 | 3 (0.14%) | 2118 (99.86%) | 2121 | 40.00% <small> [problem:499C] </small> | 6 (11.54%) | 40 (76.92%)| 6 (11.54%) | 52 | 156 (20.29%) | 613 (79.71%) | 769...
Hack me! (Codeforces Round #284 (Div. 2)), >| :---:|:---:|:---:|:---:|:---:|:---:|:---:| [problem:499A] | 13 (18.06%) | 39 (54.17%)| 20 (27.78%) | 72 | 108 (5.03, And statistics from [contest:499] (this round should be named after [user:dreamoon,2014-12-24

Full text and comments »

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

199.
By kostka, 12 years ago, In English
Hack me! (Codeforces Round #283 (Div. 2)) Hey there! Here are the hacking statistics from [contest:496]. It wasn't very good round for hackers (especially because of strong pretests), but still &mdash; let's take a quick look. (Hacks description will be added later, sorry). Previous posts can be found [here](http://codeforces.me/search?query=hackme), including [div. 1](http://codeforces.me/blog/entry/15248). [cut] <h3>Stats</h3> Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other* | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>|<small>Hackers efficiency**</small>| :---:|:---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:496A] </small> | 0 (0.00%) | 27 (55.10%)| 22 (44.90%) | 49 | 18 (0.81%) | 2193 (99.19%) | 2211 | 0.00% | <small> [problem:496B] </small> | 3 (8.57%) | 19 (54.29%)| 13 (37.14%) | 35 | 78 (6.67%) | 1091 (93.33%) | 1169 | 3.70% | <small> [problem:496C] </small> | 5 (11....
Hack me! (Codeforces Round #283 (Div. 2)), %) | 2193 (99.19%) | 2211 | 0.00% | [problem:496B] | 3 (8.57%) | 19 (54.29%)| 13 (37.14, Hey there! Here are the hacking statistics from [contest:496]. It wasn't very goodround for

Full text and comments »

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

200.
By UTPC_Admin, history, 20 months ago, In English
UT Open 2025 Hello, Codeforces! [UTPC](https://www.cs.utexas.edu/users/utpc/index.html), the competitive programming organization at the University of Texas at Austin, is happy to invite you to participate in our annual UT Open contest, which will be held on [Sunday, April 06, 2025 at 12:30PM UTC-6 (CST)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=UT+Open+2025&iso=20250406T1230&p1=24&ah=5). You will be given 13 problems (not ordered by difficulty) and 5 hours to solve them, with standard ICPC scoring. There will be a wide range of difficulties -- anyone is welcome to participate! This is a **team** contest for teams with up to 3 members. This is (of course) not an official Codeforces round, and is thus unrated. The problems were prepared and tested by [user:bubbarob19,2025-04-04], [user:chimasterbing,2025-04-04], [user:DylanSmith,2025-04-04], [user:fishy15,2025-04-04], [user:GhOsT16790,2025-04-04], [user:m7a1g5i8k8a1r4p0,2025-04-04], [user:meize,2025-04-04], [user:mwen,202...
). You will be given 13 problems (not ordered by difficulty) and 5 hours to solve them, with

Full text and comments »

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

201.
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 54 [Rated for Div. 2] On [contest_time:1076] [contest:1076] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM 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. The problems were invented and prepared by Roman [user:Ajosteen,2018-10-24] Glazov, Adilbek [user:adedalic,2018-10-24] Dalabaev, Vladimir [user:Vovuh,2018-10-24] Petrov, Ivan [user:BledDest,2018-...
Educational Codeforces Round 54 [Rated for Div. 2], href="http://codeforces.me/blog/entry/51208">blog post. This round will be **rated for the

Full text and comments »

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

202.
By MinakoKojima, 14 years ago, In English
Codeforces Round #172 Hello there! Codeforces Round #172 will take place on [Sunday, March 10th at 19:30 MSK(23:30 CST)](http://timeanddate.com/worldclock/fixedtime.html?day=10&month=3&year=2013&hour=19&min=30&sec=0&p1=166). This is my second time participating in prepration a Codeforces Round. Last time assist with [user:WJMZBMR,2013-03-04] is an unforgettable experience. This time, the hardest problems were created by **Jiatai Huang**([user:CMHJT, 2013-03-04]) and others by me and **Yuping Luo**([user:roosephu,2013-03-04]). Testers are [user:Sevenkplus,2013-03-04], [user:WJMZBMR,2013-03-04], [user:pashka,2013-03-04] and [user:Seter,2013-03-13]. We gratefully acknowledge **Gerald Agapov**([user:Gerald,2013-03-04]) for his help in giving advise about the problems, **Delinur** for her help in translating the problems to Russian, and [user:MikeMirzayanov,2013-03-04], who has designed such a powerful platform. Here let me express my personal thanks to the Codeforces community, which has given...
Codeforces Round #172

Full text and comments »

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

203.
By TadijaSebez, history, 5 years ago, In English
Mirror of Bubble Cup 14 Finals on Codeforces Hello, Codeforces! [Microsoft Development Center Serbia](https://www.microsoft.com/en-rs/mdcs) is thrilled to announce the finals of the **14th edition of Bubble Cup competition!** Bubble Cup is an international, **ICPC-style team contest** aimed at university and high school students. ![ ](/predownloaded/61/aa/61aa73763b3daf329d078697ff9a6291af114e0c.png) Contest will take place on [Saturday, 9th of October at 10AM CEST](https://www.timeanddate.com/worldclock/fixedtime.html?day=9&month=10&year=2021&hour=10&min=0&sec=0&p1=35), in online format. Winners will be announced at the closing ceremony. You can find more info on the [BubbleCup website](https://www.bubblecup.org/). Just like the previous editions, this final will be followed by an online mirror competition on Codeforces. Mirror will take place on the same day about an hour after the start of the finals &mdash; [contest_time:1599]. Contest will last for **4 hours** and **ICPC rules** will be applied. It will be a comp...
]) for helping out with problem testing. You can find problems from previous finals on our

Full text and comments »

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

204.
By dolphinigle, 15 years ago, In English
CROC Champ 2012 — Round 3 (Final) [contest:183] **Final Update:** Congratulations to the prize winners! <ul> <li>First place: [user:neex.emil,2012-04-28] --- 100000 rubles</li> <li>Runner Up: [user:Dmitry_Egorov,2012-04-28] --- Apple MacBook Pro 15</li> <li>2nd Runner Up: [user:vepifanov,2012-04-28] --- Apple MacBook Pro 13</li> </ul> Videos for the onsite round (posted by [user:ivan.popelyshev,2012-04-28]): [1](http://www.youtube.com/watch?v=QIRrD2zET3Q) [2](http://www.youtube.com/watch?v=eKEguEMPDDc) [3](http://www.youtube.com/watch?v=I97YzgF-3a4) [4](http://www.youtube.com/watch?v=E-mM5WBri5g) [5](http://www.youtube.com/watch?v=-YvmZvW9MiM) [6](http://www.youtube.com/watch?v=C2T1b37rWxQ) Congratulations to the winners of the mixed group (onsite & offsite)! <br/>[user:ivan.metelsky,2012-04-27] <br/>[user:WJMZBMR,2012-04-27] <br/>[user:neex.emil,2012-04-27] [user:rng_58,2012-04-27] deserves honorable mention for the only competitor to correctly submit both D and E :) [Editorial](http://co...
CROC Champ 2012 — Round 3 (Final), * Apple MacBook Pro 13 for the third place Please remember that the round

Full text and comments »

Announcement of Croc Champ 2012 - Final
  • Vote: I like it
  • +97
  • Vote: I do not like it

205.
By AT_80, history, 3 years ago, In English
Doubt in CSES' Inversion Probability after addition of new test cases Recently, [CSES](https://cses.fi/problemset/) updated the test cases of its problem [Inversion Probability](https://cses.fi/problemset/task/1728/). This resulted in a large number of previously Accepted solutions getting a WA on one or more of the new cases. My submission too was part of this. In particular, even after revision and rechecking from my side, it passes all but one of the 19 tests. <br /> Here is the code: <spoiler summary="Code"> ```c++ #include <bits/stdc++.h> #define endl "\n" using namespace std; int main() { // ios_base::sync_with_stdio(false); // cin.tie(NULL); // t, v are for test case inputs // s, u, w are for strings double a, b, c, d, e, f, g, h, o, p, q, r, t, v, x, y, z; double num, val, check, count, sum, maxm, minm, mid, ind, ans, fre, mfre; double c0, c1; long long i, j, k, l, m, n; string s, u, w; // cin >> t; // v = t; v = 1; while (v > 0) { v --...
Doubt in CSES' Inversion Probability after addition of new test cases, Recently, [CSES](https://cses.fi/problemset/) updated the test cases of its problem [Inversion

Full text and comments »

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

206.
By Zheng_iii, history, 9 months ago, In English
Invitation to CYCPC Round 2 ### Ciallo~(∠・ω< )⌒★, Codeforces! We are happy to invite you CYCPC Round 2 (Chengyang No.1 SHS 2nd ACM School Competition), which will take place on [contest_time:106384] . You will have **5** hours to solve **13** problems. This is a team contest following ACM/ICPC rules, with teams of up to **3** members. The penalty for an incorrect submission is **20** minutes. The standings will be frozen for the last $60$ minutes of the contest. The problems are created and prepared by [user:Zheng_iii,2026-02-25], [user:morandyg,2026-02-25], [user:Cubber,2026-02-25], [user:Sving1024,2026-02-25] and [user:Billly,2026-02-25]. We would like to thank: - [user:MikeMirzayanov,2026-02-25] for creating the fantastic CodeForces and Polygon platform. - [user:Silencer76,2026-02-25] ‘s sponsorship helped us a lot. - [user:chennie,2026-02-25], [user:MaxBlazeIceInk,2026-02-25], [user:Nanako7_ix,2026-02-25] and [user:Tachibana_Sherii,2026-02-25] testing the round and providing valuabl...
Invitation to CYCPC Round 2, ], [user:Nanako7_ix,2026-02-25] and [user:Tachibana_Sherii,2026-02-25] testing theround and providing

Full text and comments »

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

207.
By KADR, 17 years ago, translation, In English
Codeforces Beta Round #13 <div>Welcome all to Codeforces Beta Round #13, which will be held on Thursday, 6th of May at 18:00 MSK. I am an author of the problems.</div><div>I would like to thank <a href="http://codeforces.me/profile/MikeMirzayanov">Mike Mirzayanov</a>&nbsp;who made this contest possible, <a href="http://codeforces.me/profile/Shtrix">Roman Iedemskyi</a>&nbsp;and <a href="http://codeforces.me/profile/maksay">Andriy Maksay</a>&nbsp;for helping to test authors solutions and <a href="http://codeforces.me/profile/Nerevar">Dmitry Matov</a> for the translation of problem statements into English. Hope you will like the problems.</div><div><br></div><div>I hope that number 13 would be lucky for you!</div><div><br></div><div><br></div><div><div><b>UPD:&nbsp;</b>Congratulations to&nbsp;<a href="http://codeforces.me/profile/ivan.metelsky">Ivan Metelsky</a>&nbsp;who became the winner, having solved all 5 tasks!</div><div>You can view the tasks&nbsp;<a href="http://codeforces.me/contest/13">here</a>.</div><di...
Codeforces Beta Round #13, test authors solutions and Dmitry Matov <http://codeforces.me/profile/Nerevar> for the

Full text and comments »

Announcement of Codeforces Beta Round 13
  • Vote: I like it
  • +34
  • Vote: I do not like it

208.
By Ilya_Is2022, 4 years ago, In English
New Year's round... Hello, Codeforces! ------------------ So an unforgettable, rather difficult $2022$ year is coming to the end... However, it is about to be replaced by the long-awaited $2023$, which, I hope, will bring a lot of good both to you, people, and Codeforces... I, [user:Ilya_Is2022,2022-12-24], am glad to invite you to [contest: 417995] , which will take place already [contest_time: 417995] . Everyone will be able to take part in this round, regardless of the division :) In the round, you will be expected **5 &mdash; 8** tasks on New Year's theme (´。• ᵕ •。`). The round will take only **2** hour and **5** minutes, so I **would** **like** you to solve as many problems as possible! The competition will be held in the **ICPC** format, and testing of your solutions will be carried out on the full set of tests provided for the task (⌒‿⌒). I would like to thank: - [user:nekstas,2022-12-24] for help in making tasks. - [user:Alexfil,2022-12-24], [user:Anton_Wars,2022-12-26] for tes...
New Year's round..., ] . Everyone will be able to take part in this round, regardless of the division :) In theround, you

Full text and comments »

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

209.
By cry, 2 years ago, In English
Codeforces Round 979 Editorial Below is a timeline of the changes made to the round from start to finish. I hope this can depict what setting a contest is actually like for aspiring problemsetters. Please give me feedback about this in the comments. What else about the round would you like to know? Was this helpful? <spoiler summary="Round Timeline"> To denote problems, I will use quotes to denote the number of problems proposed for that postion so far (e.g. A' represents the first A proposed for the round, A'' represents second A proposed, etc). If the problem is in the final set, then it will be **bolded**. For dates, I will use the american standard notation (mm/dd). Also, I will not go in detail about why problems were rejected/unused because they might appear in the future. 8/11: [contest:1998] has just concluded and [user:sum,2024-10-18] has shipped himself off to college and won't have time due to <s>attending frat parties</s> his studies. I invite [user:vgoofficial,2024-10-18] to problemset with m...
Codeforces Round 979 Editorial, '', both getting initially accepted. 8/23: Round gets put up for testing with 7 problems. 8/25: I

Full text and comments »

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

210.
By UTPC_Admin, history, 2 years ago, In English
UTPC Fall 2024 Contest #1 Hello, Codeforces! [UTPC](https://www.cs.utexas.edu/users/utpc/index.html), the competitive programming organization at the University of Texas at Austin, is happy to invite you to participate in the first contest of the UTPC Fall contest season which will be held on [Friday, September 13, 2024 at 6:00PM UTC-5 (CDT)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=UTPC+Fall+2024+Contest+%231&iso=20240913T18&p1=24&ah=2). You will be given 8 problems (roughly ordered by difficulty) and 2 hours to solve them, with standard ICPC scoring. There will be a wide range of difficulties -- anyone is welcome to participate! We have will two divisions, Div. 2 for beginners to competitive programming and Div. 1 for people with some experience. This is a **team** contest, meaning that you are allowed to compete in teams of up to 3 members (it is totally acceptable to compete without teammates as well). This is (of course) not an official Codeforces round, and is thus unrated. The p...
the first contest of the UTPC Fall contest season which will be held on [Friday, September13, 2024

Full text and comments »

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

211.
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 77 [Rated for Div. 2] Hello Codeforces! On [contest_time:1260] [contest:1260] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 invented and prepared by ZiXuan Yan [user:RDDCCD,2019-11-26], Roman [user:Roms,2019-11-26] Glazov, Adilbek [user:adedalic,2019-11-26] Dalabaev, Vladimir [user:Vo...
Educational Codeforces Round 77 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

212.
By lperovskaya, 13 years ago, translation, In English
Yandex.Algorithm 2013: elimination stage Hi! The next stage will consist of three elimination rounds that will be held on: [Online round 1](http://algorithm.contest.yandex.com/contest/308) &mdash; [14 Jul 2013, 21:00 MSK](http://timeanddate.com/worldclock/fixedtime.html?year=2013&month=7&day=14&hour=21&min=0&sec=0&p1=166); [Materials](http://yadi.sk/d/LKa4GSI36uPtf); [Analysis](http://codeforces.me/blog/entry/8366) [Online round 2](http://algorithm.contest.yandex.com/contest/309) &mdash; [18 Jul 2013, 13:00 MSK](http://timeanddate.com/worldclock/fixedtime.html?year=2013&month=7&day=18&hour=13&min=0&sec=0&p1=166); [Materials](http://yadi.sk/d/wneXC1jA77LFK) [Online round 3](http://algorithm.contest.yandex.com/contest/310) &mdash; [22 Jul 2013, 05:00 MSK](http://timeanddate.com/worldclock/fixedtime.html?year=2013&month=7&day=22&hour=5&min=0&sec=0&p1=166); [Materials](http://yadi.sk/d/EWyuhmuk77LQ3) Each contest round lasts 100 minutes. Links to the rounds are avaliable on the round names above. The scoring mo...
round 2](http://algorithm.contest.yandex.com/contest/309) — [18 Jul 2013, 13:00 MSK](http

Full text and comments »

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

213.
By csacademy, 10 years ago, In English
Round #14 (Div. 2) Hello, Codeforces! We are happy to announce that we're going to host a new contest at [csacademy.com](http://csacademy.com). [Round #14](https://csacademy.com/contest/round-14/) will take place on [Monday, November/14/2016 17:00 (UTC)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=CS+Academy+Round+%2314&iso=20161114T17&p1=1440&ah=2). This round will be a Div. 2, meaning that the rating change will only affect users with a rating below 1550. Unrated users will also be affected. High rated coders can participate unofficially. Many thanks to [user:Yury_Bandarchuk,2016-11-13] for translating the tasks in Russian. If you want to take part in this round you need to [register](https://csacademy.com/contest/round-14/) before the contest begins. As this is a Div. 2, it will consist of **5** tasks of more accessible difficulty. #### Platform changes since Round #13: - Navbar redesign - Contest scoreboard filter added #### Contest format: - You will have to solve...
Round #14 (Div. 2), consist of **5** tasks of more accessible difficulty. #### Platform changes sinceRound #13

Full text and comments »

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

214.
By Shafaet, history, 10 years ago, In English
HackerRank HourRank 13 Another [HourRank round](https://www.hackerrank.com/contests/hourrank-13/challenges) is on the way! The time is [4th October 2016, 16:30 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=HourRank+13&iso=20161004T1630&p1=%3A&ah=1). You have just 1 hour to solve 3 algorithmic problems. The authors for this round are [user:ma5termind,2016-10-02], [user:scorpion,2016-10-02] and me. [user:wanbo,2016-10-02] tested the problems. [user:tunyash,2016-10-02] and [user:allllekssssa,2016-10-02] helped a lot to finalize the selection. We tried our best to make the round interesting. All the problems have short statements. There are subtasks in each of the problems, so I highly recommend you to read all the problems. Scores of the problems: * 25 [70% score for the 1st subtask] * 50 [30% score for the 1st subtask and 60% score in the 2nd subtask] * 60 [25% score for the 1st subtask and 70% score in the 2nd subtask] If two person has the same score, the one who reached t...
HackerRank HourRank 13, Another [HourRank round](https://www.hackerrank.com/contests/hourrank-13 /challenges) is on the way, The authors for this round are [user:ma5termind,2016-10-02], [user:scorpion,2016-10-02] and me

Full text and comments »

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

215.
By Endagorion, history, 10 years ago, translation, In English
Yandex.Algorithm 2016, third elimination round Cheers everyone. Today, [on June 13 at 10:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?year=2016&month=6&day=13&hour=10&min=0&sec=0&p1=166) the third and final qualification round of Yandex.Algorithm 2016 tournament will take place. I am the author of all tasks in this round. I wish to thank Ivan [user:Gassa,2016-06-13] Kazmenko, Oleg [user:snarknews,2016-06-13] Khristenko, and espically Aleksey [user:Chmel_Tolstiy,2016-06-13] Tolstikov and Maxim [user:Zlobober,2016-06-13] Akhmedov for their immense contribution to problems preparation. I also thank Yandex employees who were involved in testing this round. Best of luck! **UPD**: the round is complete! Congratulations to [user:Um_nik,2016-06-13], who was the only one to solve all problems! You can find the elimination standings [here](https://contest.yandex.ru/algorithm2016/). Congratulations to 25 best participants! Editorial [here](http://codeforces.me/blog/entry/45395)
Yandex.Algorithm 2016, third elimination round, &month=6&day=13&hour=10&min=0&sec=0&p1=166) the third and final qualification round of Yandex.Algorithm, /fixedtime.html?year=2016&month=6&day=13&hour=10&min=0&sec=0&p1=166) the third and final qualificationround

Full text and comments »

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

216.
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 78 [Rated for Div. 2] Hello Codeforces! On [contest_time:1278] [contest:1278] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 invented and prepared by Roman [user:Roms,2019-12-18] Glazov, Adilbek [user:adedalic,2019-12-18] Dalabaev, Vladimir [user:Vovuh,2019-12-18] Petrov, Ivan [user:Bl...
Educational Codeforces Round 78 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

217.
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 53 [Rated for Div. 2] On [contest_time:1073] [contest:1073] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM 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. The problems were invented and prepared by Roman [user:Ajosteen,2018-10-24] Glazov, Adilbek [user:adedalic,2018-10-24] Dalabaev, Vladimir [user:Vovuh,2018-10-24] Petrov, Ivan [user:BledDest,2018-...
Educational Codeforces Round 53 [Rated for Div. 2], href="http://codeforces.me/blog/entry/51208">blog post. This round will be **rated for the

Full text and comments »

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

218.
By awoo, 8 years ago, translation, In English
Educational Codeforces Round 65 [Rated for Div. 2] Hello Codeforces! On [contest_time:1167] [contest:1167] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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. The problems were invented and prepared by Roman [user:Roms,2019-05-14] Glazov, Adilbek [user:adedalic,2019-05-14] Dalabaev, Vladimir [user:Vovuh,2019-05-14] Petrov, Ivan [user:Bl...
Educational Codeforces Round 65 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

219.
By kostka, 12 years ago, In English
Hack me! (CF Round #262) Hey, I wanted to start new series about hacking. I think that this part of programming contests is really underrated, but can be helpful for both people solving problems (you should know what tricky cases you need to consider) and people writing problems (you should know how to write nice tests covering everything). So in this series, which I will try to continue, I will talk over hacks at Codeforces Rounds. I will try to do some statistics and take a look at most common mistakes in passing contests. It is my first article related to hacking (and first at all :)), so feel free to suggest something, correct me on some errors or mistakes (my English still can be much better :)) and tell about your hacks. Thanks in advance! So let's move to [contest:460]. **Update:** added country wise statistics (at the end). **Update:** added chart with hacks over time and first hacks. **Update:** the handles are now full of colours, with many thanks to awesome [user:sylap97,2014-08-2...
Hack me! (CF Round #262), | :---:|:---:|:---:|:---:|:---:| [problem:460A] | 23 (26%) | 53 (61%) | 11 (13 %) | 87 | [problem:460B

Full text and comments »

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

220.
By waipoli, history, 2 years ago, In English
Eolymp Cup #2 ![ ](https://eolympusercontent.com/images/ak1nas6ed565j4mo28t7od66q0?width=1920) Eolymp Cup #2 ============= We are very excited to announce [the second round of Eolymp Cup](https://basecamp.eolymp.com/en/contests/ptmnufrm6p6nl7gods1loo65go) on **6th of October at 15.00 UTC**! Take up a challenge to get a chance to win a trophy, medals, prizes, and scholarships at [Harbour.Space University](https://harbour.space/). **Eolymp Cup** is a programming competition for students. The competition consists of 4 rounds, held throughout the year. Each round features 6 problems, each designed to challenge participants' knowledge of algorithms, data structures and programming. The competition is open to everyone, but prizes will only be awarded to participants who are born after January 1, 2002. All other participants will compete unofficially. ### Registration You can register on the [contest page](https://basecamp.eolymp.com/en/contests/ptmnufrm6p6nl7gods1loo65go), just click "Joi...
============= We are very excited to announce [the second round of Eolymp Cup](https

Full text and comments »

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

221.
By BYN, 12 years ago, In English
Bayan Programming Contest 2014-2015 You enjoyed Bayan Programming Contest [2012-2013](http://codeforces.me/bayan201213)? Now we are happy to unveil Bayan Programming Contest 2014-2015! This will be Bayan's 3rd public programming contest and we have made several improvements and did our best to make the whole tournament even more fun! To register visit [contest.bayan.ir](http://contest.bayan.ir/) right now! Introducing the rounds ---------------------- <a href="http://contest.bayan.ir/"><img src="http://bayanbox.ir/id/6743048739787562347?view" style="float:right; margin: 20px 10px; padding: 1px; max-width: 800px; width: 50%;" alt="Bayan Programming Contest" /></a> We are going to host 5 rounds: 1. The first round is named **Shortcut!**. Shortcut! round is mainly meant to help us actively test our new contest platform, but since we'd like to thank all the people participating in this round, the winner will bypass "all" intermediate rounds, and directly advance to the final onsite event! Top 5 contestants...
round is named **Shortcut!**. Shortcut! round is mainly meant to help us activelytest our new

Full text and comments »

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

222.
By awoo, history, 2 years ago, translation, In English
Educational Codeforces Round 171 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Neapolis University Pafos](https://www.nup.ac.cy/). They offer a BSc in Computer Science and AI with [JetBrains Scholarships] (https://lp.jetbrains.com/academy/csai-program/). Gain cutting-edge skills in AI and machine learning, preparing you for high-demand tech careers. Curious? [Join the livestream] (https://jb.gg/dpdwgc) on **Tuesday, October 29 at 5:00 pm UTC** to learn about the CSAI program’s curriculum, course structure, scholarships, student internships, and their hands-on learning approach. Want more experience in coding and math competitions?<br> JetBrains **Youth Challenge** returns in November 2024! _Who can join?_ <br> Ages 13–18 <br> Anyone currently enrolled in secondary education <br> [Reg...
Educational Codeforces Round 171 [Rated for Div. 2], ! _Who can join?_ Ages 13–18 Anyone currently enrolled in secondary education

Full text and comments »

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

223.
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 74 [Rated for Div. 2] Hello Codeforces! On [contest_time:1238] [contest:1238] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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. The problems were invented and prepared by Roman [user:Roms,2019-10-07] Glazov, Adilbek [user:adedalic,2019-10-07] Dalabaev, Vladimir [user:Vovuh,2019-10-08] Petrov, Ivan [user:Bl...
Educational Codeforces Round 74 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

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

224.
By zap2727, history, 3 months ago, In English
17 Free AI Battle - Qualifier Round Finished! For Chinese Version, click [this](https://www.luogu.com.cn/article/uutv85wp/) **Special thanks to Codeforces for the evaluation resources!** To avoid any suspicion of cheating, I used problems I have already ACed for testing. ~~I don't think Doubao can pass the second round (~~ Each AI gets one revival chance (unless it does nothing or cannot be used for free) # Round 1 Let's start with an easy *800 problem! [CF2248A](https://codeforces.me/problemset/problem/2248/A) It's a super simple greedy problem, both players obviously delete from the very front. | AI/Agent Model | Status | No. | | :--- | :---: | :--- | | \*chatgpt | **Accepted** | 1 | | \*claude | **Accepted** | 2 | | \*Grok | X. No Response. | 3 ‌[Out]() | | \*deepseek | **Accepted** | 4 | | \*perplexity | X. *Wrong Answer on test 1* | 5 ‌[Restart]() | | Gemini 3.5 Flash-Lite | **Accepted** | 6 | | Qwen 3.7 | **Accepted** | 7 | | Doubao | **Accepted** | 8 | | Baidu Wenxin Yiyan | **Accepted** ...
17 Free AI Battle - Qualifier Round Finished!, I have already ACed for testing. ~~I don't think Doubao can pass the second round (~~ Each AI, ** | 4 | | \*perplexity | X. *Wrong Answer on test 1* | 5 ‌[Restart]() | | Gemini 3.5 Flash-Lite

Full text and comments »

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

225.
By CommonAnts, history, 19 months ago, In English
Welcome to UOJ Σ* Round #1 ! Welcome to **UOJ $\Sigma^\ast$ Round #1** ! We are pleased to invite you to [UOJ Σ* Round #1](https://uoj.ac/contest/96), which will be held on [Sunday, April 13, 2025 at 17:00 (UTC+8)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=UOJ+%CE%A3%2A+Round+%231&iso=20250413T17&p1=237&ah=5). There will be **3 problems** with subtasks, and **5 hours** for you to solve them under UOJ rules (similar to IOI, but pretests are used during contest rather than system tests). UOJ $\Sigma^\ast$ Round is a series of contest held by [user:CommonAnts,2025-04-12] on [UOJ](https://uoj.ac/), thanks to everyone for your contribution. > In formal language, $\Sigma^*$ represents the set of "all" strings. Can you find the answer to the problem in the ocean of countless characters? [Contest Link](http://uoj.ac/contest/96) ================== UOJ $\Sigma^\ast$ Round #1 is authored and prepared by [user:CommonAnts,2025-04-12] et al, with difficulty at about $2100, 2800, 3500$ on Codef...
Welcome to UOJ Σ* Round #1 !, Welcome to **UOJ $\Sigma^\ast$ Round #1** ! We are pleased to invite you to [UOJ Σ*Round #1

Full text and comments »

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

226.
By Vladithur, history, 4 years ago, In English
Codeforces Round #842 (Div. 2) Editorial Hope you liked the problems! <spoiler summary="(from thanhchauns2) Before the round starts"> This is my second contest on Codeforces, inspiring coordination has been done for the last several months, cannot wait until the third round is released! <spoiler summary="Testers' predictions"> <table> <tr style ="background-color:#D3D3D3"> <th>Tester</th> <th>A</th> <th>B</th> <th>C</th> <th>D</th> <th>E</th> <th>F</th> </tr> <tr> <td>[user:xiaoziya,2022-12-13]</td> <td>900</td> <td>1000</td> <td>1400</td> <td>1800</td> <td>2100</td> <td>3000</td> </tr> <tr> <td>[user:feecle6418,2022-12-13]</td> <td>900</td> <td>1200</td> <td>1400</td> <td>1700</td> <td>2200</td> <td>2900</td> </tr> <tr> <td>[user:cadmiumky,2022-12-13]</td> <td>800</td> <td>1100</td> <td>1550</td> <td>1900</td> <td>2200</td> <td>-</td> </tr> <tr> <t...
Codeforces Round #842 (Div. 2) Editorial, Hope you liked the problems!

Full text and comments »

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

227.
By BFR, history, 23 months ago, In English
Invitation to Code Quest 2 Online Mirror Hello CodeForces Community, We are happy to invite you to participate in [Code Quest 2.0 Online Mirror Contest](https://codeforces.me/contestInvitation/be1734f9aa8713789d4976a87ae7630f29e3f98f). The mirror is scheduled to take place on Codeforces at [contest_time:573484] and will last for 5 hours. Code Quest is a beginner-friendly annual competitive programming contest held by [ACM, INSAT Student Chapter](https://www.facebook.com/insatacm), aimed at introducing newcomers and beginners to the competitive programming environment, helping them learn, develop problem-solving skills, and integrate into the world of coding competitions. The contest consists of 13 problems with difficulties from 800 up to 1800. Problems have been created and prepared by: [user:get_ducked,2024-12-13], [user:Dali358,2024-12-13], [user:rayenbbs,2024-12-13], [user:Gassouma0,2024-12-13], [user:boukamcha77,2024-12-13], [user:Z41_1n,2024-12-13], [user:wapiex,2024-12-13], [user:CMiner,2024-12-13], [user...
[user:JOY_BOY__ALA_EDDINE,2024-12-13] for testing the round and providing valuable advice, ], [user:mehdi123,2024-12-13] and [user:JOY_BOY__ALA_EDDINE,2024-12-13] for testing the round and providing

Full text and comments »

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

228.
By Mitpro, 10 months ago, In English
My first Div. 4 contest! ### Hello Codeforces I am glad to invite you to take part in [my contest](https://codeforces.me/contestInvitation/c911ce4febc01da1bf46dc6e75a53058fada93d7). The round will be in ICPC style, but **penalty won't count** (if your solution is skipped, don't worry, **I skip WA submissions to not count penalty**). Note that problem K is supposed to be the last problem, but I am too lazy to change :). You can expect the difficulty of these problems to be Div. 4. You will be given **13 problems** to solve. It will start at [Friday, January 9, 2026 at 22:15 (UCT+7)](https://www.timeanddate.com/worldclock/fixedtime.html?day=9&month=1&year=2026&hour=18&min=15&sec=0&p1=166) and ends at [Friday, January 16, 2026 at 22:15 (UCT+7)](https://www.timeanddate.com/worldclock/fixedtime.html?day=16&month=1&year=2026&hour=18&min=15&sec=0&p1=166). All the problems are authored my [user:Mitpro,2026-01-09] I would like to thank: - [user:zeyd1234,2026-01-09] for giving me the idea to do this ...
/contestInvitation/c911ce4febc01da1bf46dc6e75a53058fada93d7). The round will be in ICPC style, but

Full text and comments »

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

229.
By Edvard, history, 11 years ago, translation, In English
Educational Codeforces Round 3 Hi, Codeforces! Educational Codeforces Round 3 will take place on [19 December 2015 at 18:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Educational+Codeforces+Round+3&iso=20151219T1500) for the first and second divisions. You can read about educational rounds [here](http://codeforces.me/blog/entry/21496) and [here](http://codeforces.me/blog/entry/21565). A lot of time have passed since the previous round. I hope that the next rounds will be more regular. <This paragraph wasn't changed> The round will be unrated for all users and it will be held with extented ACM ICPC rules. You will have two hours to solve six problems. After that you will have one day to hack any solution you want. You will have access to copy any solution and test it locally. </This paragraph wasn't changed> This time the round was prepared not only by me, Edvard Davtyan. Firstly, thanks a lot to Alexey Dergunov [user:dalex,2015-12-19] who shared one of his problems with well-known...
Educational Codeforces Round 3

Full text and comments »

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

230.
By tzaph_, 5 years ago, In English
Invitation to TOKI Regular Open Contest #25 Happy (late) new year Codeforces! &#127881; &#127881; &#127881; We are excited to invite you to <b>TOKI Regular Open Contest (TROC) #25!</b> &#129321; &#129321; &#129321; Key details: <ul> <li>Contest links: [TLX](https://tlx.toki.id/contests/troc-25)</li> <li> Time: [9th January 2022, 13:05 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=TOKI%20Regular%20Open%20Contest%20%2325&iso=20220109T130500) &#8986;</li> <li> Writer: [user:CyberSleeper,2022-01-08] &#127907; [user:MGS763,2022-01-08] &#129488; [user:ainunsy1,2022-01-08] &#128171; [user:joshjms,2022-01-08] &#9875; [user:JvThunder,2022-01-08] &#129365; [user:Zap,2022-01-08] &#127800; </li> <li> Duration: 2 hours </li> <li> Problems: 8 </li> </ul> <br> Scoring distribution &#128576;: <b>100 &mdash; 200 &mdash; 300 &mdash; 300 &mdash; 500 &mdash; 500 &mdash; 700 &mdash; 800 </b> We would like to thank: <ul> <li> [user:Prabowo,2022-01-07] &#129320; for <strike>being president</strike> the amazing coor...
> * Contest links: [TLX](https://tlx.toki.id/contests/troc-25) * Time: [9th January 2022, 13

Full text and comments »

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

231.
By i_pranavmehta, 3 years ago, In English
The 75 Hard coding challenge! Hi Coders! I hope everyone of you is doing great! A member of my Discord server [user:BadalArya,2023-09-13] recently came up with an idea to conduct a 75 Hard challenge (similar to the fitness one) for coding. I am excited to announce that we have concluded the development of the bot and have integrated it to our discord server to help coders track their progress for this challenge. This is how the challenge looks: 1. The bot provides 2 problems daily to each user (who ask for the challenge using the command ";hard75 letsgo"). These problems are based on the users cf rating (one problem is of the same rating and other is of +200 level NOTE: both these ratings are rounded to nearest 100). 2. On completion the user has to instruct the bot to check the progress using the command ";hard75 completed", the bot then checks whether user has completed both the problems on codeforces and accordingly saves his progress and the streak. 3. On completion of 75 days the bot would acknowledge t...
], [user:BadalArya,2023-09-13] and everyone else who helped to test this bot and make it better

Full text and comments »

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

232.
By ludo., history, 21 month(s) ago, In English
Déjà Vu: AI, Cheaters, and the Usual Chaos Hola CP-igos! As the name suggests _yet_ another blog an AI, cheaters etc. Introduction ================== Flashback to 1.5 years back... I just joined Codeforces, all contests were fine, no cheater blogs(and no cheaters)... I used to spend some time reading interesting blogs in catalog and the "Recent Actions" where I used to find blogs on other "non-educational" blogs, be it somebody's productivity plan, somebody reached GM, some new solutions on rounds, the "if u comment under this blog" blogs etc. All this was fun.. I could spend an hour or so, reading all this and the comments underneath them The Issue ------------------ Fastforward to now.... A round gets over.. And soon by the next day, all we have is tons of blogs on cheaters doing this, cheaters doing that, I found this, I found that and what not. And then people finding underneath blogs, seperate blogs being made for seperate cheaters, as though the cheaters have become kings, every set of cheaters with th...
------------------ For every round we have testers who test the rounds.. we can also have testers

Full text and comments »

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

233.
By zap2727, history, 3 months ago, In English
17 Free AI Battle - Qualifier Round Finished! For Chinese Version, click [this](https://www.luogu.com.cn/article/uutv85wp/) **Special thanks to Codeforces for the evaluation resources!** To avoid any suspicion of cheating, I used problems I have already ACed for testing. ~~I don't think Doubao can pass the second round (~~ Each AI gets one revival chance (unless it does nothing or cannot be used for free) # Round 1 Let's start with an easy *800 problem! [CF2248A](https://codeforces.me/problemset/problem/2248/A) It's a super simple greedy problem, both players obviously delete from the very front. | AI/Agent Model | Status | No. | | :--- | :---: | :--- | | \*chatgpt | **Accepted** | 1 | | \*claude | **Accepted** | 2 | | \*Grok | X. No Response. | 3 ‌[Out]() | | \*deepseek | **Accepted** | 4 | | \*perplexity | X. *Wrong Answer on test 1* | 5 ‌[Restart]() | | Gemini 3.5 Flash-Lite | **Accepted** | 6 | | Qwen 3.7 | **Accepted** | 7 | | Doubao | **Accepted** | 8 | | Baidu Wenxin Yiyan | **Accepted** ...
17 Free AI Battle - Qualifier Round Finished!, I have already ACed for testing. ~~I don't think Doubao can pass the second round (~~ Each AI, ** | 4 | | \*perplexity | X. *Wrong Answer on test 1* | 5 ‌[Restart]() | | Gemini 3.5 Flash-Lite

Full text and comments »

  • Vote: I like it
  • -15
  • Vote: I do not like it

234.
By PraveenDhinwa, history, 8 years ago, In English
Live the IOI experience with Replay of Indian IOI Training Camp on CodeChef! The International Olympiad in Informatics is one such event that we all look forward to, not only as players but also as spectators. An annual competition that began in 1989 in Bulgaria, the IOI has risen from its humble beginnings to become one of the largest worldwide competitions for school students that tests their skills in programming and problem-solving. CodeChef is conducting the next replay of the Indian IOI Training Camp. This contest is the second among the three replays that we plan to conduct. There will be three challenging problems and a five-hours to solve them. The authors of the round are: - Kushagra Juneja ([kushagra1729][1]), Praveen Dhinwa ([user:PraveenDhinwa,2018-07-20]), Sreejata Bhattacharya ([user:AnonymousBunny,2018-07-20]) and Zi Song Yeoh ([user:zscoder,2018-07-20]) The testers panel consists of: - Rajat De ([user:rajat1603,2018-07-20]), Sampriti Panda ([user:sampriti,2018-07-20]), Sidhant Bansal ([user:sidhant,2018-07-20]), Arjun Arul ([us...
authors of the round are: - Kushagra Juneja ([kushagra1729][1]), Praveen Dhinwa

Full text and comments »

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

235.
By xuandadenbenem, 9 years ago, In English
Codeforces Round #482 (Div. 2) Hi Codeforces! *Sorry for being late for the announcement.* I'm glad to introduce to you my first contest [contest:979]. It will take place on [contest_time:979]. You will have **5 problems** and **2 hours** to solve them. The problems were prepared by me (Quyen Dinh), [user:_Kuroni_,2018-05-13] (Trung Dang) and [user:_Shirone_,2018-05-13] (Lam Le) with suggestions from [user:FallingStar1709,2018-05-13] (Nhat Hoang) and [user:HaiDang2001VN,2018-05-13] (Dang Huynh). I would like to thank [user:KAN,2018-05-13] for his great help in checking the problems and giving comments, [user:Tommyr7,2018-05-13] for testing all the problems and [user:MikeMirzayanov,2018-05-13] for the awesome Codeforces and Polygon platform. Note that the round is rated for everyone with rating below **2100**. In this contest, you will meet _Kuro_, _Shiro_ and _Katie_, the three naughty but smart cats who love asking thought-provoking questions. I hope you will find our problems interesting. Good lu...
Codeforces Round #482 (Div. 2), great help in checking the problems and giving comments, [user:Tommyr7,2018-05- 13] for testing all, , [user:Tommyr7,2018-05-13] for testing all the problems and [user:MikeMirzayanov,2018-05-13] for the awesome

Full text and comments »

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

236.
By Zanite, history, 4 weeks ago, In English
Invitation to Indonesia National Contest (INC) 2026 Mirror <img src="https://zanite.dev/docs/icpc/inc-2026-mirror-banner.png" /> Salam sejahtera, Codeforces! We are excited to invite you to the mirror of **Indonesia National Contest (INC) 2026**! The Indonesia National Contest (INC) is an annual online programming competition that serves as a preliminary and qualifying round for Indonesian teams to advance to the ICPC Asia Jakarta Regional Contest. Key details: - **Rated for all** - Contest links: [TLX](https://tlx.toki.id/contests/inc-2026-mirror/) - Time: [Sunday, October 25, 2026 at 13:05 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Indonesia+National+Contest+2026+Mirror&iso=20261025T1305&p1=108&ah=2) - Duration: 2 hours - Problems: 6 - Allowed languages: C, C++11, C++17, C++20, Pascal, Java, Python 3, Go, Rust - Contest style: ICPC - Penalty per wrong submission: 10 minutes - There will be no scoreboard freeze. - Available Languages: English, Bahasa Indonesia We would l...
preliminary and qualifying round for Indonesian teams to advance to the ICPC Asia Jakarta Regional

Full text and comments »

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

237.
By havaliza, 14 years ago, In English
Codeforces Round #173 (Div. 2) Hi all! :{ We're glad to invite you to participate in Codeforces Round #173 prepared by [user:A.K.Goharshady,2013-03-13], [user:LGM,2013-03-13] and me ([user:havaliza,2013-03-13]). I want to thank [user:Gerald,2013-03-13], [user:MikeMirzayanov,2013-03-13] and [user:Delinur,2013-03-13] who helped us to prepare the round on this platform. And thanks to [user:Dani1373,2013-03-13], [user:hhoomn,2013-03-13], [user:MrM,2013-03-13], [user:MMJ,2013-03-13] and ~xorfire,2013-03-13 who tested the problems and helped us a lot. Today is ~LGM,2013-03-13's birthday and yesterday was ~gpac,2013-03-13's birthday. Happy birthday to you guys! ^.^ Hope you enjoy today's round and have lots of fun. :) **Update.** The [editorial](http://codeforces.me/blog/entry/6999) is out!
Codeforces Round #173 (Div. 2), the round on this platform. And thanks to [user:Dani1373,2013-03-13], [user:hhoomn,2013-03-13, us to prepare the round on this platform. And thanks to [user:Dani1373,2013-03- 13], [user:hhoomn

Full text and comments »

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

238.
By csacademy, 9 years ago, In English
Round #33 (Div. 2) + Special Prizes Hello, Codeforces! We are happy to announce that we're going to host a new contest at [csacademy.com](http://csacademy.com). [Round #33](https://csacademy.com/contest/round-33/) will take place on [Wednesday, June/14/2017 15:00 (UTC)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=CS+Academy+Round+%2333&iso=20170614T15&p1=1440&ah=2). This round will be a Div. 2, meaning that the rating change will only affect users with a rating below **1675**. Unrated users will also be affected. High rated coders can participate unofficially. If you want to take part in this round you need to [register](https://csacademy.com/contest/round-33/) before the contest begins. As this is a Div. 2, it will consist of **5** tasks of more accessible difficulty. #### Special prizes This round will have 3 special prizes consisting of private coaching lessons with our contest coordinator, [user:wefgef,2017-06-13]. Each lesson will be conducted on Skype and will last for 1 hour and 30 minute...
Round #33 (Div. 2) + Special Prizes, [csacademy.com](http://csacademy.com). [Round #33](https://csacademy.com/contest/round-33/) will take place on

Full text and comments »

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

239.
By waipoli, history, 21 month(s) ago, In English
Eolymp Cup #4 ![ ](https://eolympusercontent.com/images/ak1nas6ed565j4mo28t7od66q0?width=1920) Eolymp Cup #4 ============= Get ready for the [final round of the Eolymp Cup](https://basecamp.eolymp.com/en/contests/ajbi7s2jld37fch2ulvjkvgi9g) happening on **Sunday, March 2**! Compete for a chance to **win free HSU scholarships, Eolymp subscriptions**, and our **exclusive T-Shirts**. Don’t miss out on the action—we’re excited to see you there! ### About **Eolymp Cup** is a programming competition for students. The competition consists of 4 rounds, held throughout the year. Each round features 6 problems, each designed to challenge participants' knowledge of algorithms, data structures and programming. The competition is open to everyone, but prizes will only be awarded to participants who are born after January 1, 2002. All other participants will compete unofficially. ### Format and Duration In each round, you are given 3 hours to solve 6 problems. Each problem is split into sub-t...
============= Get ready for the [final round of the Eolymp Cup](https://basecamp.eolymp.com/en

Full text and comments »

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

240.
By hmehta, history, 6 years ago, In English
Topcoder SRM 789 (Unusual Start Time) **Topcoder SRM 789** is scheduled to start at [13:00 UTC -4, August 30, 2020] (https://www.timeanddate.com/worldclock/fixedtime.html?msg=SRM+789&iso=20200830T13&p1=98). Registration is now open for the SRM in the [Arena](http://arena.topcoder.com/) or [Applet](https://www.topcoder.com/contest/arena/ContestAppletProd7.2.jnlp) and will closes at 12:55 UTC-4. The coding phase will start at 13:05 UTC-4, so make sure that you are all ready to go. Thanks to <a href="https://www.topcoder.com/members/square1001"><font color=red><b>square1001</b></font></a>, <a href="https://www.topcoder.com/members/lg5293"><font color=red><b>lg5293</b></font></a> and <a href="https://www.topcoder.com/members/misof"><font color=red><b>misof</b></font></a> for writing the problem set. Also thanks to <a href="https://www.topcoder.com/members/misof"><font color=red><b>misof</b></font></a> for testing and coordinating the round. **Choose Your Competition Arena** There are two ways to compete in Algor...
**Topcoder SRM 789** is scheduled to start at [13:00 UTC -4, August 30, 2020] (https

Full text and comments »

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

241.
By Igorjan94, history, 3 years ago, In English
[Yandex.Cup] My strangest participation ever This summer I decided to visit Kalinindrad from Saint-Petersburg on 4-6 November, bought fly tickets on 10:55AM-13:00PM and everything went well. But Yandex decided to set half-final exactly at 12:00AM on 4th November :( Fortunately I participate at backend track (I'm just magenta in algorithm and I believe at least yellow in backend) and contest lasts for 5 hours. I decided to take my laptop and take part from Kaliningrad When I came to home airport, I saw "delayed until 12:55". Badumtss! On one hand, it's better that I can read all problems before flight and solve them during flight. On the other hand, it's worse that I'd have less time after landing Anyway, 12:00, I opened contest, opened all problems, screenshoted them (to be sure that occasional reload won't kill problems) and saved all needed resourced locally I rushed solving B (yes, this contest has problems B-F and description/instructions in A) while sitting in airport next to gate. Unfortunately this problem needed ...
merge. Finally done. Testing locally. WA on second test. Ah, I make select in wrong order. Oh no, I

Full text and comments »

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

242.
By MikeMirzayanov, history, 10 years ago, translation, In English
Testing Round #13 Hello, Codeforces! I want to test the system before [Good Bye 2016](/contests/750), to be sure that everything works as expected. I invite you to take part in [contest:753]. It will start soon, on [December, 29, 09:05:00 (UTC)](http://timeanddate.com/worldclock/fixedtime.html?day=29&month=12&year=2016&hour=12&min=5&sec=0&p1=166). It will be unofficial unrated round. The duration is 75 minutes. Pretests are unusually weak to trigger more hack. You may expect interactive problems. Hope for hacks for them. Thank you,<br> [user:MikeMirzayanov,2016-12-29] **UPD:** Many thanks to all the participants. It seems the system works as expected. We are ready to host [Good Bye 2016](/contests/750)!
Testing Round #13, ). It will be unofficial unrated round. The duration is 75 minutes., Hello, Codeforces! I want to test the system before [Good Bye 2016](/contests/750), to be sure, I want to test the system before [Good Bye 2016](/contests/750), to be sure that everything works

Full text and comments »

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

243.
By cry, 22 months ago, In English
Codeforces Round 998 (Div. 3) Editorial <spoiler summary="Rating Predictions"> | Predictor | A | B | C | D | E | F | G | |--------------------------------------------|------|------|------|------|------|------|------| | [user:Proof_By_QED,2025-01-15] | 800 | 1000 | 1100 | 1300 | 1600 | 1900 | 2400 | | [user:cry,2025-01-15] | 800 | 1000 | 1000 | 1200 | 1700 | 2000 | 2400 | | [user:chromate00,2025-01-15] | 800 | 1000 | 1000 | 1400 | 1700 | 2000 | 2400 | | [user:DivinePunishment,2025-01-15] | 800 | 1200 | 1100 | 1200 | 1700 | 2000 | 2300 | | [user:-firefly-,2025-01-15] | 800 | 1000 | 1000 | 1400 | 1800 | 2000 | 2400 | | [user:Error_Yuan,2025-01-15] | 800 | 1100 | 1200 | 1600 | 1800 | 2100 | 2400 | | [user:macaquedev,2025-01-15] | 800 | 1000 | 1500 | 1400 | 1300 | 2000 | 1900 | | [user:In...
Codeforces Round 998 (Div. 3) Editorial, Credits: [user:Proof_By_QED,2025-01-15] Analysis: [user:larush,2025-01-13]

Full text and comments »

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

244.
By ToxicPie9, 4 years ago, In English
[Tutorial/Parody Post] Common Mistakes in Competitive Programming and How to Avoid Them Yesterday [user:YouKn0wWho,2023-01-11] posted a [blog](https://codeforces.me/blog/entry/111217) explaining common mistakes in competitive programming and how to avoid them. I was greatly inspired by that post so I decided to make my own. I have compiled some of the mistakes that I didn't make in my early Competitive Programming phase. I also mentioned how to avoid them. Also, in most cases, I will give you a chance to find out what the bug is before I reveal the culprit as I tried to make this blog interactive. The codes that I have used in this blog have been written in Rust as it is the most beloved language for CP. #### Mistake 1 Check out the following code: <spoiler summary="Code"> ``` fn main() { let x: i32 = 1_000_000_000; let y: i32 = 1_000_000_000; println!("{}", x * y); } ``` </spoiler> The output should be $10^{18}$. But if you run the code, you will get a different output. Why? <spoiler summary="Reason"> Because it won't even compile....
summary="Code"> ``` fn test(v: Vec) -> usize { v.len() } fn main() { const N

Full text and comments »

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

245.
By csacademy, 10 years ago, In English
Round #28 (Div. 2) + Special Prizes Hello, Codeforces! We are happy to announce that we're going to host a new contest at [csacademy.com](http://csacademy.com). [Round #28](https://csacademy.com/contest/round-28/) will take place on [Wednesday, May/10/2017 13:00 (UTC)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=CS+Academy+Round+%2328&iso=20170510T13&p1=1440&ah=2). This round will be a Div. 2, meaning that the rating change will only affect users with a rating below **1650**. Unrated users will also be affected. High rated coders can participate unofficially. If you want to take part in this round you need to [register](https://csacademy.com/contest/round-28/) before the contest begins. As this is a Div. 2, it will consist of **5** tasks of more accessible difficulty. #### Special prizes This round will have 3 special prizes consisting of private coaching lessons with our contest coordinator, [user:wefgef,2017-05-08]. Each lesson will be conducted on Skype and will last for 1 hour and 30 minutes...
Round #28 (Div. 2) + Special Prizes, [csacademy.com](http://csacademy.com). [Round #28](https://csacademy.com/contest/round-28/) will take place on

Full text and comments »

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

246.
By waipoli, history, 23 months ago, In English
Eolymp Cup #3 ![ ](https://eolympusercontent.com/images/ak1nas6ed565j4mo28t7od66q0?width=1920) Eolymp Cup #3 ============= Get ready for the [third round of the Eolymp Cup](https://basecamp.eolymp.com/en/contests/s9jjggk0op4b55163d4t9l39nc) happening on **Sunday, December 15**! Compete for a chance to **win free HSU scholarships, Eolymp subscriptions**, and our exclusive **Evil Chmyaaax T-Shirt**. Don’t miss out on the action—we’re excited to see you there! ### About **Eolymp Cup** is a programming competition for students. The competition consists of 4 rounds, held throughout the year. Each round features 6 problems, each designed to challenge participants' knowledge of algorithms, data structures and programming. The competition is open to everyone, but prizes will only be awarded to participants who are born after January 1, 2002. All other participants will compete unofficially. ### Format and Duration In each round, you are given 3.5 hours to solve 6 problems. Each problem i...
============= Get ready for the [third round of the Eolymp Cup](https://basecamp.eolymp.com/en

Full text and comments »

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

247.
By ODT, history, 9 years ago, In English
Codeforces Round #449 Editorial [897A &mdash; Scarborough Fair](http://codeforces.me/contest/897/problem/A) By [user:mcfx,2017-12-04] For every $i$ in range $[l,r]$, if $c_i$ is $c_1$ then change it into $c_2$... Because $n, m$ are all very small, $O( nm )$ can easily pass it. PS. You can use binary search tree to solve it in $O( m\log n )$ time. [897B &mdash; Chtholly's request](http://codeforces.me/contest/897/problem/B) By [user:mcfx,2017-12-04] The $k$-th smallest zcy number is $conn(str(k),rev(str(k)))$, where $str$ denotes the decimal representation of a positive integer as a string, $conn$ denotes the concatenation two strings, and $rev$ denotes the reverse of a string. Then go over the smallest $k$ such numbers and sum them up to obtain the answer. [896A &mdash; Nephren gives a riddle](http://codeforces.me/contest/896/problem/A) By [user:mcfx,2017-12-04] $f(n)=str_1+f(n-1)+str_2+f(n-1)+str_3$. First we can compute the length of $f(n)$ for all possible $n$. For a pair of $(n...
Codeforces Round #449 Editorial, . For each round, we either replace an existing number with a strictly smaller one, or fill in an

Full text and comments »

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

248.
By Kuyan, 8 years ago, translation, In English
Mail.Ru Cup 2018 Round 2 ![ ](/predownloaded/13/b3/13b34cb749c0c7afb06d55eceae891af075a93fd.png) Hi all! I'm happy to invite everyone to a combined for Div.1 and Div.2 Mail.Ru Cup 2018 Round 2, that is starting at this time: [contest_time:1055]. The problems were prepared by [user:Kuyan,2018-11-09] and [user:Jacob,2018-11-09]. Thanks to [user:_kun_,2018-11-09] and [user:300iq,2018-11-09] for coordination and help in preparation. Also huge thanks to [user:majk,2018-11-09], [user:lewin,2018-11-09], [user:gritukan,2018-09-16], [user:demon1999,2018-11-09] for testing, and also to [user:MikeMirzayanov,2018-11-09] for Codeforces and Polygon platforms. This round is the second round in the new championship called [Mail.Ru Cup](https://codeforces.me/blog/entry/62355), you can learn more about it following the link. The round will be rated for everybody! The championship feature the following prizes: - First place &mdash; **Apple MacBook Air** - Second and third place &mdash; **Apple iPad** - Fourt...
Mail.Ru Cup 2018 Round 2, ![ ](/predownloaded/13/b3/13b34cb749c0c7afb06d55eceae891af075a93fd.png) Hi all! I'm happy to

Full text and comments »

Announcement of Mail.Ru Cup 2018 Round 2
  • Vote: I like it
  • +180
  • Vote: I do not like it

249.
By MofK, history, 3 years ago, In English
Codeforces Global Round 25 Editorial Hi, we hope you enjoyed our problems! For the playlist of songs used in the problem statements, click [this link](https://www.youtube.com/playlist?list=PLTVdHvnX6LZhAJre49E7M7tpGA30WlBM3). [problem:1951A] Author: [user:MofK,2024-04-06] <br> Prepared by [user:Kuroni,2024-04-06] <br> First solve: [user:xiachong,2024-04-06] at 00:01 <spoiler summary="Tutorial and Implementation"> [tutorial:1951A] [submission:255371605] </spoiler> <spoiler summary="Rate this problem"> Yay Meh Nay Banger song </spoiler> [problem:1951B] Author: [user:MofK,2024-04-06] <br> Prepared by [user:Kuroni,2024-04-06] <br> First solve: [user:pavement,2024-04-06] at 00:05 <spoiler summary="Hint 1"> What is the condition for your cow to win her first match? </spoiler> <spoiler summary="Hint 2"> If your cow is not already winning her first match, there are at most two candidate positions you can swap her to. </spoiler> <s...
Codeforces Global Round 25 Editorial, first stronger cow from the sample test. The testers weren't too impressed: ![ ](https

Full text and comments »

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

250.
By tzaph_, history, 6 years ago, In English
Invitation to TOKI Regular Open Contest #18 Happy (late) new year Codeforces community! We are excited to invite you to <b>TOKI Regular Open Contest (TROC) #18!</b> Key details: <ul> <li>Contest links: [TLX](https://tlx.toki.id/contests/troc-18) (combined divisions)</li> <li> Time: [17th January 2021, 13:05 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=TOKI+Regular+Open+Contest+%2318&iso=20210117T1305&ah=2) </li> <li> Writer: [user:steven.novaryo,2021-01-15] [user:Zap,2021-01-15] </li> <li> Duration: 2 hours </li> <li> Problems: 7 </li> </ul> <br> Scoring distribution: <b>100 &mdash; 250 &mdash; 300 &mdash; 350 &mdash; 450 &mdash; 600 &mdash; 650 </b> We would like to thank: <ul> <li> [user:Prabowo,2021-01-15] for <strike>admitting to be a masochist</strike> the amazing coordination of the round.</li> <li> [user:hocky,2021-01-15] for <strike>showing his very long tongue</strike> helping with problem preparation.</li> <li> [user:malfple,2021-01-15] and [user:markus_geger,2021-01-15] for testi...
/contests/troc-18) (combined divisions) * Time: [17th January 2021, 13:05 UTC](https

Full text and comments »

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

251.
By Error_Yuan, 15 months ago, In English
Codeforces Round 1046 (Div. 1, Div. 2) Editorial <spoiler summary="Rate the Contest!"> - Amazing round: - Good round: - Average round: - Bad round: - Horrible round: </spoiler> [problem:2136A] Idea: [user:Alan_dong,2025-08-25] Preparation: [user:Register,2025-08-25] <spoiler summary="Hint"> If one team got a score of $x$ in the first half, what is the maximum score the other team could get? </spoiler> <spoiler summary="Solution"> We can consider the first half and the second half separately. The dream might come true if and only if the scores in both halves are possible. In the second half, the RiOI team scored $(c - a)$ goals, while the KDOI team scored $(d - b)$ goals. Suppose the RiOI team scored $x$ goals in some half. Denoting the score of the KDOI team as $y$, one can see that the maximal value of $y$ is $2\cdot x + 2$, under the goal order $\tt{\color{red}K\color{red}K\color{black}RK\color{red}K\color{black}R...RK\color{red}K\color...
Codeforces Round 1046 (Div. 1, Div. 2) Editorial, - Amazing round: - Good round: [likes:all

Full text and comments »

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

252.
By PraveenDhinwa, history, 10 years ago, In English
Invitation for SnackDown 2016 Pre-Elimination Round B Replay Contest on Codechef Hello CodeForces Community! I would like to invite you to the Replay Contest of CodeChef [SnackDown 2016 Pre-Elimination Round B](https://www.codechef.com/SNPB16RP) which begins in few hours i.e [at 9 PM IST, 13th June](http://www.timeanddate.com/worldclock/fixedtime.html?msg=SnackDown+Online+Pre-+elimination+Round+B+-+Replay&iso=20160613T21&p1=44), just after the main contest. The problems have been set and tested by [user:kevinsogo,2016-06-13] (Kevin Charles Atienza), [user:Antoniuk,2016-06-13] (Vasya Antoniuk), [user:Cherrytree,2016-06-13] (Sergey Kulik) and the translations are written by [user:huzecong,2016-06-13] (Hu Zecong), [user:Antoniuk,2016-06-13] (Vasya Antoniuk), VNOI Team, [user:Cherrytree,2016-06-13] (Sergey Kulik), with [user:PraveenDhinwa,2016-06-13] (Praveen Dhinwa) as contest admin. **Registration:** The contest is open for all and it will be a team based contest with a maximum of up to 2 members in a team. One need to have a CodeChef account and register ...
Invitation for SnackDown 2016 Pre-Elimination Round B Replay Contest on Codechef, [SnackDown 2016 Pre-Elimination Round B](https://www.codechef.com/SNPB16RP) which begins in few hours i.e, The problems have been set and tested by [user:kevinsogo,2016-06-13] (Kevin Charles Atienza

Full text and comments »

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

253.
By MikeMirzayanov, 15 years ago, translation, In English
Codeforces Contest Rules This document provides a detailed and formal version of the Codeforces contest rules. If you're simply looking to understand the basics, we recommend starting with the post [Codeforces Contests](/blog/entry/456). Please note that organizers may make minor modifications to the rules for specific rounds; any such changes will be included in the official announcement of the respective round. Unless otherwise stated, the following rules should be considered the default for all contests. By participating in a Codeforces contest and/or submitting any materials, you automatically agree to abide by these [terms and conditions](/terms). ### General information about a round 1. You need to register to participate in a round. The registration opens six hours before the start of the contest and closes 5 minutes before it, unless the information about the round states otherwise. 1. The system of conducting contests has two interface languages available: Russian and English. The cont...
rounds; any such changes will be included in the official announcement of the respectiveround

Full text and comments »

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

254.
By Leeisateam, history, 5 years ago, In English
A hack for Problem C: "Set or Decrease" (Educational Round #120) [problem:1622C] ================== A few others and I had solutions for this problem that passed the system tests but had a bad time complexity of `O(aᵢ * t)`. The problem has `aᵢ <= 10^9` and `t <= 10^4` so `aᵢ * t` can be up to `10^13`, which could take over an hour for the code to run, and would obviously give the "Time Limit Exceeded" verdict. For any step, if you choose **set**, it is optimal to set the greatest element (that hasn't been set yet) equal to the smallest element, because this decreases the sum the most. If you choose **decrease**, it is optimal to decrease the smallest element. It's optimal to do all the **decrease**s before all the **set**s, because this way the largest elements can be set to an even lower number, compared to if any **set** step is done before a **decrease** step. My initial approach to this problem (with the wrong time complexity) was to simulate the steps one by one, on each step choosing greedily whether to **set** or **decrease**...
A hack for Problem C: "Set or Decrease" (Educational Round #120), <= 10^4` so `aᵢ * t` can be up to `10^13`, which could take over an hour for the code to run, and, needed for my code to solve this test case: a_i * t = 10^9 * 10^4 = 10^13 (takes > 1 hour, estimated number of operations needed for my code to solve this test case: a_i * t = 10^9 * 10^4

Full text and comments »

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

255.
By coder0687, history, 3 years ago, In English
How to solve this question without using Segment/Fenwick tree **FYI &mdash; Its a Netcore Round-2 Question, contest is already over on hackerearth.** ================================================================================= ![ ](https://i.ibb.co/wCRRMc0/pic.png) **Text format of above photo** ~~~~~ Given an array a, consisting of N integers. You are also given q queries on the array that you need to perform on the array a. Each query is of the following two types: 1. l r 0 - Find the or of array elements on the segment [l, r], that means the value a[l] | a[l+1] | . . . | a[r] where | is the bitwise OR operation. 2. l r x - Apply ai = ai ⊕ x for all i such that l ≤ i ≤r, where ⊕ is the bitwise XOR operation. For each query of type 1, print the result you get. Input format for custom testing Note: Use this input format if you are testing against custom input or writing code in a language where we don\'t provide boilerplate code. • The first line contains an integer N denoting the length of the string. • The seconf li...
**FYI — Its a Netcore Round-2 Question, contest is already over on hackerearth

Full text and comments »

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

256.
By new2022, history, 5 years ago, In English
Invitation to Spybits Number Theory Contest, Udyam'22 — IIT (BHU) Varanasi (Unrated) Hello Everyone!<br> We would like to invite you all to participate in the [SPYBITS2022 CONTEST-1](https://www.codechef.com/SPYB2022) aka the Spybits Number Theory Contest, under the banner of Udyam'22, IIT (BHU) Varanasi. The contest will be held on [28th Jan 2022 at 20:00 IST](https://www.timeanddate.com/worldclock/fixedtime.html?msg=SPYBITS2022+CONTEST-1&iso=20220128T20&p1=176&ah=2&am=15). Udyam is the annual technical fest of the Department of Electronics Engineering, Indian Institute of Technology (BHU),Varanasi. To know more about Udyam, please visit the official website of [Udyam'22](https://www.udyamfest.com/). Spybits Number Theory Contest is the first round of the SPYBITS event, in which your Number Theory knowledge is tested along with your programming skills. This contest is open to everyone, so you can appear in the contest even if you haven't registered for the SPYBITS event. All the problems have been prepared by [user:XORring-Samurai,2022-01-21], [user:Laz...
'22](https://www.udyamfest.com/). Spybits Number Theory Contest is the first round of the

Full text and comments »

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

257.
By phpduke, history, 4 years ago, In English
Call for Contest Admin / Problemsetter! We are looking for **contest admins** and **problem setters** for a contest series we are starting at TheJobOverflow. We are experimenting with the format and variety of problems &mdash; the contests are primarily geared toward algorithms/ideas with a lesser component of peeling multilayer observations. TJO has 6,000 users and has evaluated 10,000 solution to programming tasks this week. What is TJO? TheJobOverflow is an **Open Community Platform** for interview preparation & CP. It's built and managed by alumni of IIIT Hyderabad, IIT Bombay, IIT BHU, and IIT Guwahati. Team has ICPC world finalists, IOI medalists, Math olympiad folks and also houses key people who authored math-contest [Gordian Knot](https://codeforces.me/blog/entry/57311) a few years ago ( : Our contest series is yet to be launched, meanwhile we have compiled & tested [**350 problem's Question Bank**](https://thejoboverflow.com/problems/) which includes **latest Coding Round & Interview** problems asked by **Go...
://thejoboverflow.com/problems/) which includes **latest Coding Round & Interview** problems asked by

Full text and comments »

  • Vote: I like it
  • -13
  • Vote: I do not like it

258.
By hmehta, history, 6 years ago, In English
TCO20 Special Rookie SRM w/ Prizes ### TCO20 Special Rookie SRM 1 TCO20 Special Rookie SRM 1 as part of the 2020 Topcoder Open is scheduled to start at [13:00 UTC-5 on November 18, 2020](https://www.timeanddate.com/worldclock/fixedtime.html?msg=TCO20+Special+Rookie+SRM&iso=20201118T13&p1=98&ah=2&am=30).  **Registration** is now open for the Rookie SRM in the [Arena or Applet](https://www.topcoder.com/community/arena) and closes at 12:55 UTC-5. The coding phase will start at 13:00 UTC-5, so make sure that you are all ready to go. [Click here to what time it starts in your area.](https://www.timeanddate.com/worldclock/fixedtime.html?msg=TCO20+Special+Rookie+SRM&iso=20201118T13&p1=98&ah=2&am=30) The Rookie SRM is open to everyone and has some special cash prizes. It will only be rated for members who: \- Have never competed in Rated Algorithm Contests OR \- Have competed in equal to or less than 5 rounds OR \- If their current rating is less than 800 rating points. **Prizes**: 1st: $300 ...
scheduled to start at [13:00 UTC-5 on November 18, 2020](https://www.timeanddate.com/worldclock

Full text and comments »

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

259.
By huangzirui, history, 4 years ago, In English
Editorial of Codeforces Round 796 [problem:1688A] Idea: [user:huangzirui,2022-06-03]. Solution: [user:huangzirui,2022-06-03]. Preparation: [user:huangzirui,2022-06-03]. Good problem Average problem Bad problem Did not solve <spoiler summary="Hint"> Consider $x=2^k$ and $x\ne 2^k$ separately. </spoiler> <spoiler summary="Solution"> Let $p_i$ be the $i$-th bit of $x$, $q_i$ be the $i$-th bit of $y$ (both indexed from $0$). $x\ \texttt{and}\ y > 0\Leftrightarrow \exists i,\ p_i= q_i = 1$. $x\ \texttt{xor}\ y > 0\Leftrightarrow \exists i,\ p_i\ne q_i$. To satisfy the first condition, find the minimum integer $k$ satisfying $p_k=1$, and assign $1$ to $q_k$. If $x\ne 2^k$, the second condition is satisfied now. Otherwise, find the minimum integer $j$ satisfying $p_j=0$, and assign $1$ to $q_j$. The time complexity is $O(1)$. </spoiler> <spoiler summary="Code (C++)"> ```cpp #include<bits/stdC++.h> ...
Editorial of Codeforces Round 796, $ and $y_1\le 10^6$, $p_1\ge 11$. But $x\ge 11\times 13\times 17\times 19\times 23\times 29\times 31

Full text and comments »

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

260.
By fmoeran, history, 3 years ago, In English
BIO prime problem Hi guys, Here's a problem from the 2016 British Informatics Olympiad round 1. # Problem statement A prime number is a whole number, greater than 1, that can only be divided by itself and the number 1. Two prime numbers are connected if the difference between them is 2n for some whole number n ≥ 0; e.g. possible differences are 1, 2, 4, 8, 16, 32, … A path is a sequence of (at least two) prime numbers, without repetition, where adjacent numbers in the sequence are connected. If the first number in the sequence is p and the last number is q then we say the path is between p and q. The length of a path is the total number of prime numbers used. There may be multiple paths between two prime numbers; the lengths of these paths may be different. For example: • 13 is connected to 5 (13 &mdash; 5 = 8 = 23), 5 is connected to 3 (5 &mdash; 3 = 2 = 21) and 3 is connected to 2 (3 &mdash; 2 = 1 = 20); • As 13 and 5 are connected there is a path between them (13—5) whose leng...
Hi guys, Here's a problem from the 2016 British Informatics Olympiad round 1. # Problem

Full text and comments »

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

261.
By de_sousa, history, 11 months ago, In English
An Imprecision Problem (Small Imprecision Contest Editorial) This is the editorial for my **Small Imprecision Contest** ( https://codeforces.me/gym/106258 ). It is more detailed than regular editorials and is meant to be a standalone blogpost, so it should still be an interesting read even if you didn't participate. This problem has been passed around as a funny concept in some Discord servers, and it was first proposed by [user:pajenegod,2025-12-25] in 2023. This problem doesn't belong in regular competitions, but regardless, I thought it was too cool to not exist, and at the same time, solving it requires some advanced floating point knowledge and intuition; this blogpost is more detailed than usual in an attempt to create a good introduction to these concepts. *With this blogpost I would like to participate in https://codeforces.me/blog/entry/149422 , a cool initiative by [user:ntherner,2025-12-25] that is rewarding interesting Codeforces blogposts. If you have something interesting to share, please give it a read.* I...
that are not affected by this by testing random `float` numbers. In C++, to test what values are

Full text and comments »

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

262.
By zscoder, history, 6 years ago, In English
April Fools Day Contest 2021 — ZS Edition Hi everyone, April Fools is near and as usual we have an [April Fools Day Contest](https://codeforces.me/blog/entry/88840) on Codeforces this year. In addition to that, I usually try to host some form of mini April Fools Contest for my friends every year (or almost every year). This year, I am trying to host a bigger April Fools Day contest than usual and I invite everyone to participate! In view of the April Fools contest on Codeforces, the round will begin at [31 March 10pm (GMT+8)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=April+Fools+Day+Contest+2021+%28ZS%29&iso=20210331T22&p1=122) and lasts for exactly $24$ hours (and thus it will end ~35 minutes before the CF April Fools round). The contest will consist of several unusual tasks, and I hope that everyone will at least find something interesting. The problems will not be sorted by increasing order of difficulty (if the word difficulty is even applicable), so it is **highly advisable** to read (and try!)...
! In view of the April Fools contest on Codeforces, the round will begin at [31 March 10pm (GMT+8

Full text and comments »

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

263.
By MathModel, history, 18 months ago, In English
Weekend Practice #7 ### **Hello Codeforces!** ------------------ ![ ](https://codeforces.me/predownloaded/da/f3/daf314d0dcdb835fcfcd817a35619436f4008852.svg) I'm very super duper ultra excited to invite you to [Weekend Practice round #7](https://basecamp.eolymp.com/en/contests/uitnv9tt356kj7di2bqsabpps0) , taking place on [June 7, at 13:00 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?day=1&month=7&year=2025&hour=16&min=00&sec=0&p1=166). This is a **rated** contest at Eolymp. #### **Format and Difficulty** Same as in previous rounds, the competition is primarily aimed at improving practical skills. There will be $2$ hours for $5$ tasks of varying difficulty, the easiest of which can even be solved by beginners. The scoring for each task being block-based (meaning points are awarded for each block of tests separately, and only if the solution passes all tests in the block). If there is a tie between two participants, the one whose last productive submission (i.e., a sub...
you to [Weekend Practice round #7](https://basecamp.eolymp.com/en/contests/uitnv9tt356kj7di2bqsabpps0

Full text and comments »

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

264.
By SummerSky, 9 years ago, In English
Notes on Codeforces Beta Round #65, A, B, C, D, E (bitmask DP) [problem:71A] For the given string, if its length is not larger than 10, we shloud output it directly; otherwise we should output the first letter, the length minus 2, and the last letter. [problem:71B] It can be observed that a reasonable answer must always be writen as x*k+y, where x denotes the number of values that are equal to k while y denotes the unique value which is neither k nor zero. Note that y can be zero. According to the conditions, we have (x*k)/(n*k)≤(t/100), and thus x≤t*n/100. We can first compute x as t*n/100, where "/" denotes the integer division. Then, we can enumerate y from 0 to k-1, inclusively, to find out the answer. [problem:71C] It seems that we have to enumerate all the feasible polygons and their rotation angles to find out the answer, which leads to complexity of O(N^2). However, one can check that if a polygon with M edges is found to be reasonable, then we can always find at least another one polygon with Q edges, where Q is a diviso...
Notes on Codeforces Beta Round #65, A, B, C, D, E (bitmask DP), Therefore, it is sufficient to test the polygons which have 3, 4, 5, 7, 11, 13 ... edges. It can be

Full text and comments »

  • Vote: I like it
  • -5
  • Vote: I do not like it

265.
By tatyam, history, 4 years ago, In English
The 1st Universal Cup. Stage 12: Ōokayama (TTPC2022) Hello Codeforces! The 12th Stage of the 1st Universal Cup is coming. It will be held from April 15th to 16th. This contest is based on the [Tokyo Tech Programming Contest 2022 (TTPC2022)](https://atcoder.jp/contests/ttpc2022), with some changes, including one new problem. **If you have seen the problems from TTPC2022 before, please skip this round.** Thank you to the - writers: tatyam, noshi91, potato167, mencotton, noya2, zer0star, shobonvip, ebi_fly, tassei903, x0214sh7, - test-runners: rickytheta, riantkb, - translators: ChatGPT, tatyam, - and the Universal Cup Committee. As usual, we have three time windows for participating. You can participate in the contest in the following three time windows: - [April 15th 13:00 — 18:00 (UTC +8)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=The+1st+Universal+Cup.+Stage+12%3A+%C5%8Cokayama+Time+Window+1&p1=3910&iso=20230415T13&ah=5) - [April 15th 19:00 — 24:00 (UTC +8)](https://www.timeanddate.com/worldclock/fixed...
problems from TTPC2022 before, please skip this round.** Thank you to the - writers: tatyam

Full text and comments »

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

266.
By gKseni, 10 years ago, translation, In English
Code Festival 2016: interview and photos from participants [Code Festival 2016](http://codeforces.me/blog/entry/48616) was held in Tokyo on 25-30 of November. Boris [user:qwerty787788,2016-12-13] Minaev has shared with us his impressions, and Maxim [user:Zlobober,2016-12-13] Ahmedov and Nicolay [user:KAN,2016-12-13] Kalinin shared photos. &mdash; _To start with, let's mention that,_ [AtCoder](https://atcoder.jp/) _and_ [Indeed company](http://ru.indeed.com/about) _announced the festival. How many quals were there? In what way were they arranged?_ &mdash; There were 3 contests, in which you could take part. In the first part TOP-10 were selected, in the second one — TOP-5, the third one — TOP-5. To sum up, there are 20 foreigners to be selected. &mdash; _Which quals the Japanese had then?_ &mdash; Probably the same, but 200 participants passed the qual there. &mdash; _That means, the event is more orientated on Japanese people?_ &mdash; The previous years the event was held only for Japanese, this year they decided ...
. Boris [user:qwerty787788,2016-12-13] Minaev has shared with us his impressions, and Maxim

Full text and comments »

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

267.
By ankeshgupta007, 8 years ago, In English
Invitation to HourStorm #10 on HackerEarth Hi everyone! I would like to invite you to participate in [HourStorm #10](https://www.hackerearth.com/challenges/competitive/hourstorm-10/?utm_source=challenges-modern&utm_campaign=registered-challenges&utm_medium=right-panel). The contest will start at [16:00 UTC,April 13, 2019](https://www.timeanddate.com/worldclock/fixedtime.html?msg=HourStorm+%2310+HackerEarth&iso=20190413T16&p1=1440&ah=1) It's a 1-hour competition with 3 traditional (but nice) algorithmic tasks. You will receive points for every test case your solution passes, so you can get some points with partial solutions as well. Check the contest page for more details about contest schedule and rules. The problems have been prepared by me and [user:FarFromRed,2019-04-09], helped by [user:anil_9717,2019-04-09] and tested by [user:Arpa,2019-04-09]. There are prizes for top 3 contestants: $75, $50 and $25 Amazon gift cards respectively. In addition, the top **5** will win HackerEarth t-shirts. Good Luck and High Ra...
-challenges&utm_medium=right-panel). The contest will start at [16:00 UTC,April 13, 2019](https

Full text and comments »

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

268.
By cry, 2 years ago, In English
Crafting Farmer John — My USACO Problemsetting Experience Hello Codeforces! If you've somehow been living under a barn, [USACO](https://usaco.org/) is the largest online competitive programming contest for the USA high school students. As I myself am a USA high school student about to graduate, I'd like to reflect on my experience with contributing problems to USACO. By the way, I don't select problems that end up on each contest &mdash; I just contribute possible candidates. Also, I guess this is inspired by [user:xiaowuc1,2025-01-30]'s [blog](https://codeforces.me/blog/entry/113687), who also used to be a pretty active USACO problemsetter. The difficulty column is purely based on **my own opinion**. <table> <thead> <tr> <th> # </th> <th> Problem </th> <th> Contest </th> <th> Difficulty </th> <th> Comments </th> </tr> </thead> <tr> <td> 1 </td> <td> <a href="https://usaco.org/index.php?page=viewproblem2&cpid=1255">Circular Barn</a> </td> <td> Silver, 2022 December<...
version. He also ended up preparing the test cases of the problem. orz. 2

Full text and comments »

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

269.
By lperovskaya, history, 11 years ago, translation, In English
Three Subregionals Cup 2015: Western QF We gladly invite you to participate in the [Three Subregionals Cup 2015](http://contest.yandex.com/QF2015/ "") – a team-based online programming competition parallel to the ACM ICPC Subregionals in Moscow, Minsk and St. Petersburg. The tournament will be organized by the team of Yandex.Contest and the jury of the Subregionals. The online rounds will be held on the Yandex.Contest system. The dates and start times of subregionals are: Moscow – [October 18, 12:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Moscow+QF&iso=20151018T1200&p1=166 ""), Saint Petersburg – [October 24, 13:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Northern+QF&iso=20151024T1300&p1=166 ""), Minsk – [November 04, 18:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Western+QF&iso=20151104T1800&p1=166 ""). Teams that participate in the onsite version of one of the three quarterfinals will be able to participate in the online versions of the other quarterfinals...
, 13:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Northern+QF&iso=20151024T1300&p1

Full text and comments »

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

270.
By dreadolisk, history, 13 months ago, In English
[GYM] STEM Avengers: Age of Algorithms **Salam Codeforces!** [Team A²](https://sites.google.com/view/team-a-squared) is glad to invite you all to the second contest in the STEM Avengers series of contests, [contest:642756], which will start on [contest_time:642756]. You will be given **7 Problems** and **2 hours** to solve them. All the problems are written and prepared by me ([user:M.AbdurRehman,2025-12-16]), [user:1uxmere,2025-10-10], and [user:24GB,2025-12-16]. This contest is going to be an **Avengers** themed contest, with the problems being named and themed after Avengers Phase II movies. **Now that the STEM Avengers have assembled, let's get to algorithmic fights!** The round will be **rated in the A² rating system** and will be held on extended **ICPC** rules. After the contest, your code will be tested manually (and may get hacked or skipped). The difficulty would be comparable to Div. 3/4. The problems will be **partially sorted by difficulty**. The problems include a wide variety of topics — from Co...
Avengers have assembled, let's get to algorithmic fights!** The round will be **rated in the A² rating

Full text and comments »

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

271.
By Flamire, history, 2 years ago, In English
EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial [2002A &mdash; Distanced Coloring](https://codeforces.me/contest/2002/problem/A) idea & solution: [user:xcyle,2024-08-12] <spoiler summary="Hint 1"> Consider the case with $n=m=k$. </spoiler> <spoiler summary="Hint 2"> Generalize the solution for all $n,m,k$. </spoiler> <spoiler summary="Tutorial"> It can be shown that for any $k\times k$ subgrid, the colors we use must be pairwise distinct. Thus, we have an lower bound of $\min(n,k)\cdot\min(m,k)$. We can show that this lower bound is indeed achievable by coloring the upper-left $\min(n,k)\cdot\min(m,k)$ subgrid with distinct colors, and copy-pasting it to fill the rest of the grid. Time complexity: $O(1)$. </spoiler> <spoiler summary="Solution"> ~~~~~ #include <bits/stdc++.h> using namespace std; int t, n, m, k; int main() { scanf("%d", &t); while (t--) { scanf("%d%d%d", &n, &m, &k); printf("%d\n", min(n, k)*min(m, k)); } return 0; } ~~~~~ </spoiler> [2...
EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) Editorial, ]$. $L$ is some constant ($100$ should work). We found this solution during testing, tried, and

Full text and comments »

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

272.
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 95 [Rated for Div. 2] Hello Codeforces! On [contest_time:1418] [contest:1418] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. 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 Roman [user:Roms,2020-09-13] Glazov, Adilbek [user:adedalic,2020-09-13] Dalabaev, Vladimir [user:vovuh,2020-09-13] Petrov, Ivan [us...
Educational Codeforces Round 95 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round

Full text and comments »

  • Vote: I like it
  • -544
  • Vote: I do not like it

273.
By nitesh_gupta, 8 years ago, In English
CodeCraft-19 and Codeforces Round #537 (Div. 2) Hello Everyone! I would like to invite you to CodeCraft-19, which is a part of [Felicity](https://www.facebook.com/felicity.iiith), the annual techno-cultural fest of IIIT Hyderabad. It will take place on [contest_time:1111]. The round will be **rated for Div 2 participants (whose ratings are lower than 2100)**. As usual, participants from the first division can participate in the contest out of the competition. You will be given **5** problems, all of which are based on the theme of our fest, "Superheroes". ![ ](/predownloaded/ad/13/ad13e5d5c52ce4e0f23273fde2f69a5eb98cd4c9.jpg) I would like to thank the CodeCraft team -- [user:nir123,2019-02-02], [user:additya1998,2019-02-02], [user:devanshg27,2019-02-02], [user:gaurav172,2019-02-02], [user:night_fury208,2019-02-02], [user:shaanknight,2019-02-02], [user:psaini,2019-02-02], [user:sharmaritvik60,2019-02-02], [user:swetanjal,2019-02-02] and [user:vivace_jr,2019-02-02] -- for helping in preparation of the problemset. I would...
CodeCraft-19 and Codeforces Round #537 (Div. 2), testing the round and [user:MikeMirzayanov,2019-02-02] for the great Codeforces and Polygon

Full text and comments »

  • Vote: I like it
  • -128
  • Vote: I do not like it

274.
By portajohn, history, 5 months ago, In English
A message to Vansh_Vala, who deleted his post Context ------------------ I recently came across this fine gentleman's post celebrating his recent achievement of Specialist. He cited the following things as being helpful for him: <blockquote> Regular contest participation. Upsolving problems after contests. Learning new algorithms and data structures. Analyzing mistakes instead of repeating them. Staying consistent even when progress felt slow. </blockquote> Now [user:Vansh_Vala,2026-06-13] is quite an interesting coder. After looking at his submissions, I was met with many that either got CE or WA on test 1. Amazed, I asked about this peculiar habit of not running his code locally. It is with profound sorrow that I must share the news that, in the midst of our intellectual discussion, he chose to delete the blog post. An open letter ------------------ Dear [user:Vansh_Vala,2026-06-13], I grieve the loss of our discussion and am deeply saddened that you did not reciprocate my interest. I understand that you ar...
progress felt slow. Now [user:Vansh_Vala,2026-06-13] is quite an interesting coder. After

Full text and comments »

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

275.
By EvenImage, 4 years ago, In English
Problems that I authored so far Since competitive programming is dying, and I'm almost retired, so it's time to review the problems I authored. Hi everyone! I wanted to write such a blog for a long time, motivated by similar blogs, [by](https://codeforces.me/blog/entry/113093) [user:antontrygubO_o,2023-02-25], [by](https://codeforces.me/blog/entry/108940) [user:adamant,2023-02-25] and [by](https://codeforces.me/blog/entry/108595) [user:tibinyte,2023-02-25]. This is not a super-comprehensive list. I set many shit problems that I don't want to share for some local contests. It can be long, and I'm not sure if I have finished half of them yet. The number of asterisks after the label indicates the recommendation levels. One asterisk means this problem is worth reading. Two asterisks mean this problem is one of my favorite problems, Three asterisks mean this problem is one of my best problems. | # | Date | Problem | Contest | Comment | | ---- | ----------- | --------------------------------------------...
Wanna Be the Guy](https://codeforces.me/contest/469/problem/A) | Codeforces Round #268 | My first and, ](https://codeforces.me/contest/469/problem/A) | Codeforces Round #268 | My first and only single

Full text and comments »

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

276.
By lucifer1004, history, 6 years ago, In English
My Editorial for Google Kick Start 2021 Round B # Google Kick Start 2021 Round B Tutorial [中文版 | Chinese version](https://cp-wiki.vercel.app/tutorial/kick-start/2021B/) Here are my solutions to Google Kick Start 2021 Round B. Some of them (C & D) are not optimal, albeit they passed all the test cases. ## Problem A &mdash; [Increasing Substring](https://codingcompetitions.withgoogle.com/kickstart/round/0000000000435a5b/000000000077a882) We simply go ahead and try appending the current letter after the last letter. Complexity: - Time complexity is $\mathcal{O}(|S|)$. - Space complexity is $\mathcal{O}(|S|)$. <spoiler summary="Code (C++)"> ~~~~~ #include <cstdio> #include <iostream> #include <vector> using namespace std; template <typename T> void read(T &x) { x = 0; char c = getchar(); T sig = 1; for (; !isdigit(c); c = getchar()) if (c == '-') sig = -1; for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + c - '0'; x *= sig; } class Solution { public: void solve(i...
My Editorial for Google Kick Start 2021 Round B, # Google Kick Start 2021 Round B Tutorial [中文版 | Chinese version](https://cp-wiki.vercel.app

Full text and comments »

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

277.
By SomethingNew, 4 years ago, In English
Codeforces Round #814 (Div. 1, Div. 2) Editorial Sorry for not very good samples, and late editorial. It was our first round, so it was wary stressful for us, But we hope you liked the problems despite this! [problem:1719A] <spoiler summary="Hint 1"> Try to look at the parity of $n, m$. </spoiler> <spoiler summary="Hint 2"> The player who wins does not depend on player's strategy. </spoiler> <spoiler summary="Hint 3"> The only thing that the winning player depends on is the parity of $n, m$. </spoiler> <spoiler summary="Tutorial"> Note that the game will end only when the chip is in the upper right corner (otherwise you can move it $1$ square to the right or up). For all moves, the chip will move $n - 1$ to the right and $m - 1$ up, which means that the total length of all moves is $n + m - 2$ (the length of the move is how much the chip moved per turn). Since the length of any move is odd, then after any move of Burenka, the sum of the lengths will be odd, and after any move of Tonya is even. So we can find...
Codeforces Round #814 (Div. 1, Div. 2) Editorial, Sorry for not very good samples, and late editorial. It was our first round, so it was wary

Full text and comments »

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

278.
By z4120, history, 7 years ago, In English
Main test for problem C2 is not strong enough (For codeforces global round 5.) There are some users who submit the same code for C1 and C2, but get main test failed for C1 and passed for C2. This JavaScript code shows that there are 12 users who passed C1 and failed C2: (run this in the developer console on a Codeforces page) <spoiler summary="Code"> ```js function sleep(ms){ return new Promise(function(resolve,reject){ setTimeout(resolve,ms) }) } async function custom_test(source,programTypeId,input){ // There's no official API // adapt from CF customtest js code const data=await $.post('/data/customtest',{ csrf_token: Codeforces.getCsrfToken(), source: source, sourceCode: source, tabSize: 4, programTypeId: programTypeId, input: input, output: '', // not _tta: 510, // ? communityCode: '', action: 'submitSourceCode', }) while(true){ sleep(2500) const response=await $.post("/data/customtest", { communityCode: "", action: "getVerdict", customTestSubmit...
Main test for problem C2 is not strong enough, (For codeforces global round 5.) There are some users who submit the same code for C1 and C2

Full text and comments »

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

279.
By cyand1317, 9 years ago, In English
VK Cup 2018 Round 2 and Codeforces Round #472 Editorial Long time no see! As [VK Cup Round 2](http://codeforces.me/contest/924) and its two parallel rounds ([Div. 1](http://codeforces.me/contest/956) and [Div. 2](http://codeforces.me/contest/957)) comes to a close, we're here to congratulate on all who did well on the contest and cheer for everyone who participated &mdash; the queue won't stop you! Here are the detailed tutorials for the problems. Feel free to discuss in the comments! Kudos to [user:arsor,2018-03-25] for translating the tutorials into Russian! --- [tutorial:957A] <spoiler summary="Model solution"> ~~~~~ _, s = input(), input() print('Yes' if ('??' in s or 'C?C' in s or 'M?M' in s or 'Y?Y' in s or s[0] == '?' or s[-1] == '?') and not ('CC' in s or 'MM' in s or 'YY' in s) else 'No') ~~~~~ </spoiler> <spoiler summary="Alternative solution (Errichto)"> ~~~~~ #include <bits/stdc++.h> using namespace std; void NO() { puts("No"); exit(0); } void YES() { puts("Yes"); exit(0)...
VK Cup 2018 Round 2 and Codeforces Round #472 Editorial, Разбор задач VK Cup 2018 Раунд 2 и Codeforces Round #472, ; const ld EPS = 1e-9; const ld PI = acos(-1.0); const int N = 100 * 1000 + 13; int n, u; int a[N, Long time no see! As [VK Cup Round 2](http://codeforces.me/contest/924) and its two parallel

Full text and comments »

Tutorial of VK Cup 2018 - Round 2
  • Vote: I like it
  • +114
  • Vote: I do not like it

280.
By Error_Yuan, history, 2 years ago, In English
Refact.ai Match 1 (Codeforces Round 985) Editorial Thank you all for participating in the round! We apologize for the wrong checker in problem E at the beginning of the contest, as well as the weak tests in problem B. To be honest, all the hacked submissions have similar logic and codes in B, which made me suspicious. Anyway, we are sorry for the inconvenience! >_< <spoiler summary="Rating Predictions"> | |A|B|C|D|E|F|G|H|I| |:--:|:--:|:--:|:--:|:--:|:--:|:--:|:--:|:--:|:--:| |[user:Error_Yuan,2024-11-7]|800|1200|**1600**|**2100**|**2300**|2600|**3000**|3400|**3500**| |[user:sszcdjr,2024-11-7]|800|1100|1600|2000|2300|**2600**|2900|**3300**|3500| |[user:wyrqwq,2024-11-7]|800|**1000**|1400|2200|**2300**|2600|**3000**|3500|3500| |[user:Otomachi_Una,2024-11-7]|**800**|1000|1600|2200|2400|2600|3200|3500|3500| |[user:dxqwq,2024-11-7]|900|1100|1700|2200|2400|2600|3200|3500|3500| |[user:Kubic,2024-11-7]|800|1000|1600|2400|2200|2800|3000|3500|3300| |[user:wsc2008qwq,2024-11-7]|800|1100|1600|1900|2200|2700|3100| | | |[user:chroma...
Refact.ai Match 1 (Codeforces Round 985) Editorial, Thank you all for participating in the round! We apologize for the wrong checker in problem E at

Full text and comments »

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

281.
By MDovzhenko, 14 years ago, translation, In English
The CROC All-Russian Open Programming Championship Results Last Friday, on May 17, CROC finishes the All-Russian Open Programming Championship. The CROC company (together with Codeforces) holds a competition for the best coders of our country for the second year in a row. Informational technologies are a dynamic habitat where the best minds dwell and sometimes innovative ideas come up at a great speed! This time the organizers stated that the championship is all-Russian but they were surprised to see the championship interest extending beyond the national border. <center> <img src="http://lh3.googleusercontent.com/-bHHNR_A6z6k/UZpYlF2ElYI/AAAAAAABDVs/OlIAHRayouI/s560/90520.jpg"/> </center> <i>The interest towards the competition was such that we had many participants from Russia, former Sovyet republics and even far away countries. On this championship, coders solve sports programming problems: to win, they need to come up with effective algorithms, code them quickly, consider all non-typical situations. Besides, there is the additi...
Championship took part in several stages: it started at the qualification round on April,13 the internet

Full text and comments »

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

282.
By Topcoder_Updates, history, 5 years ago, In English
Topcoder Rookie SRM 13 Topcoder Rookie SRM 13 is scheduled to start at [21:00 UTC-4 on May 17, 2022.](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Rookie+SRM+13&iso=20220517T21&p1=98) Registration is now open for the SRM in the [Arena or Applet](http://topcoder.com/community/arena) and closes at 20:55 UTC-4 .The coding phase will start at 21:05 UTC-4, so make sure that you are all ready to go. [Click here to see what time it starts in your area](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Rookie+SRM+13&iso=20220517T21&p1=98). The Rookie SRMs are open to everyone and has some special prizes. It will only be rated for members who: - Have never competed in Rated Algorithm Contests OR - Have competed in equal to or less than 5 rounds OR - If their current rating is less than 800 rating points. Prizes: Topcoder T-shirt for Top 20 *Prizes are only for members who are eligible to be rated Best of luck! \- The Topcoder Team *** Please take a look a...
Topcoder Rookie SRM 13

Full text and comments »

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

283.
By jackylova_fan_fan_fan, 3 years ago, In English
Online Mirror of The 20th Southeast University Programming Contest (Summer) Hi, Codeforces! We are so happy to invite you to participant in [The 20th Southeast University Programming Contest (Summer)](https://codeforces.me/contests/105172), which will start at [contest_time:105172]. This round will be conducted according to ACM/ICPC rules. Therefore, solutions will be judged on all test points during the competition. The competition is team-based, with teams of 1 to 3 people, and you will be given 11 to 13 problems and 5 hours to solve them. **Please note that the penalty for submitting an incorrect answer in this competition is 20 minutes.** All questions were created and written by me and [user:Ram_seu,2024-05-19]. We would like to thank: 1. [user:MikeMirzayanov,2024-05-20] for creating Codeforces and Polygon. 2. CPC club of Southeast University and the seuOJ provided by SEUCPC club . 3. Science and Technology Association of Southeastern university school of Computer Science and Engineering, school of Software and school o...
testing this round and giving useful feedback. 5. Last but not least, You for participating in

Full text and comments »

284.
By reirugan, 12 months ago, In English
Codeforces Round 1065 (Div. 3) Editorial I hope you all enjoyed the contest! Special thanks to - [user:djm03178,2025-11-18] for suggesting the inclusion of C1, and for helping with test writing on all problems, especially F - [user:satyam343,2025-11-18] for helping me solve H - [user:Dominater069,2025-11-18] for providing the idea for one of the solutions to E - [user:Intellegent,2025-11-18] for providing one of the proofs for the solution to D, and for providing the idea for one of the solutions to F <spoiler summary="Rate the contest!"> <spoiler summary="Quality"> - Excellent contest - Good contest - Average contest - Bad contest - Horrible contest </spoiler> <spoiler summary="Difficulty"> - Trivial contest - Easy contest - Average contest - Hard contest - Impossible contest </spoiler> </spoiler> #### [...
Codeforces Round 1065 (Div. 3) Editorial, suggesting the inclusion of C1, and for helping with test writing on all problems, especially F

Full text and comments »

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

285.
By jackylova_fan_fan_fan, history, 18 months ago, In English
Online Mirror of The 21st Southeast University Programming Contest (Summer) Hi, Codeforces! We are so happy to invite you to participant in [contest:105895], which will start at [contest_time:105895]. This round will be conducted according to ACM/ICPC rules. Therefore, solutions will be judged on all test points during the competition. The competition is team-based, with teams of 1 to 3 people, and you will be given 11 to 13 problems and 5 hours to solve them and two of them will be divided into two versions. **Please note that the penalty for submitting an incorrect answer in this competition is 20 minutes.** All questions were created and written by [user:Huan_YP2002,2024-11-08], [user:limithym,2024-11-08] and me. We would like to thank: 1. [user:MikeMirzayanov,2024-05-20] for creating Codeforces and Polygon. 2. CPC club of Southeast University and the seuOJ provided by SEUCPC club . 3. Science and Technology Association of Southeastern university school of Computer Science and Engineering, school of Software and school of ...
], [user:king_of_gamers,2025-05-10] for testing this round and giving useful feedback. 5. Last but

Full text and comments »

286.
By kostka, 12 years ago, In English
Hackers ranking (beta) ### FAQ **What is this?** Have you ever wondered who is the best hacker on Codeforces? Here is simple solution, which would try to answer for your problem! I would like to introduce new system of grading hackers in rounds. [cut] <p></p> <b>How does it work?</b> The whole rating system is based on <a href="http://en.wikipedia.org/wiki/Elo_rating">Elo rating</a>. The problem is how to measure user's performance in each round. **Yes, how?** The whole system is now in phase of testing, so some solutions may be changed (and probably will be changed :)). So let's consider some user during some round. Let's call him Bob. **I want to choose another name, may I?** No. **Ok.** So, let's say that Bob solved three problems: A, B and C (Bob is pretty sad), but also hacked one solution for B and had one unsuccessful hack attempt. Bob doesn't know that his solution for C won't pass system tests. How would we know if it was good or bad? At first, we will look at al...
to measure user's performance in each round. **Yes, how?** The whole system is now in phase of

Full text and comments »

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

287.
By WorldWarV, history, 2 months ago, In English
Codeforces Round 1122 (Div. 3) Editorial Thanks for participating in [contest:2266]! <spoiler summary="Rate the contest!"> <spoiler summary="Quality"> - Excellent contest - Good contest - Average contest - Bad contest - Horrible contest </spoiler> <spoiler summary="Difficulty"> - Trivial contest - Easy contest - Average contest - Hard contest - Impossible contest </spoiler> </spoiler> [problem:2266A] <spoiler summary="Hint"> How many participants can possibly have solved all three problems? </spoiler> <spoiler summary="Solution"> At most $\min(a_1,a_2,a_3)$ participants could have solved all three problems. This is achievable by making the same $\min(a_1,a_2,a_3)$ participants solve every problem, then distributing the remaining solves arbitrarily. Thus, the answer is $n-\min(a_1,a_2,a_3)$. ...
Codeforces Round 1122 (Div. 3) Editorial, )$. The complexity is $O(1)$ per test case. ```cpp

Full text and comments »

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

288.
By E404_Not_Found, 4 years ago, In English
Editorial of TheForces Round #5 Hello everyone! Thanks for participating in [**TheForces Round #5 (PerfectForces)**](https://codeforces.me/contestInvitation/acef71576c8cfc2665d529cfced0712a0342ad63). [problem:425963A] <spoiler summary="Editorial"> We must first determine the scenario in which the answer is $0$. If $a > c$, then. Following that, if $b <= d$, the answer will be $-1$. Answer for the alternative case is $\frac{c - a}{b - d} + 1$. Because every second, the distance will be reduced by $(d - b)$. <spoiler summary="Solution"> ``` #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int tests; cin >> tests; while (tests--) { int a, b, c, d; cin >> a >> b >> c >> d; if (a > c) { cout << 0 << '\n'; continue; } if (b <= d) { cout << -1 << '\n'; continue; } int num = c - a; int den = b - d; cout << num / den + 1 << '\n'; } return 0; } ``` </spoiler> </spoiler> [problem:425963B...
Editorial of TheForces Round #5, Hello everyone! Thanks for participating in [**TheForces Round #5 (PerfectForces)**](https

Full text and comments »

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

289.
By Avalanche, 12 years ago, translation, In English
Polygon Updates (Fall-Winter 2014) <a href="https://polygon.codeforces.com/"><img src="https://polygon.codeforces.com/image/polygon-logo.PNG" style="float: left; margin: 1em 2em 1em 1em"/></a> Hi Codeforces! My name is Maxim Gusarov and I joined the Codeforces developer team in September and am recently working with Vitaly [user:kuviman,2014-12-24] Kudasov on improving the [Polygon](https://polygon.codeforces.com/) system. Today I would like to introduce you to the new potential of the system where all problems for the Codeforces rounds and many other programming contests are prepared. #### Update 1 As a user logs into the system, she can now use either the login or the email given at the registration. You can also attach the session to the IP address to enhance security. <center> <img src="http://assets.codeforces.com/images/polygon-post/login-by-email-and-attach-to-ip.png"/> </center> #### Update 2 Any user who has the access to edit a problem can become its supervisor. The supervisor will always...
illustrating potential, we have redesigned the “Invocation” page. Each test is followed by the time

Full text and comments »

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

290.
By undef, 15 years ago, translation, In English
Codeforces Round #115 Hello everyone! I am glad to invite You to take part in round #115 which is rated for participants of both divisions. As in last year, in this round You will help gamer Vasya to find himself in the virtual world of computer games: brag to his friends about his achievements, determine who is a "noob" and who is a "hardcore" player, destroy the Main Evil, play several rounds of the Plane of Tanks and get rid of the crowd of very bad gnomes. Generally, get a lot of fun! The round authors are Gerald Agapov ([user:Gerald,2012-04-13]), Evgeny Lazarev ([user:undef,2012-04-13]) and Alexey Shmelev ([user:ashmelev,2012-04-13]). Vladislav Epifanov ([user:vepifanov,2012-04-13]) and Maria Belova ([user:Delinur,2012-04-13]) helped us with the round preparation. In this round You will be given 6 problems, instead of usual 5, also **the round duration is increased from 2 to 3 hours**. P.S. Probably You have noticed the contest with strange name "RazMERiq 2012 (Private Contest)". Onsite con...
Codeforces Round #115, ([user:Delinur,2012-04-13]) helped us with the round preparation. In this round You will be given

Full text and comments »

Announcement of Codeforces Round 115
  • Vote: I like it
  • +71
  • Vote: I do not like it

291.
By pathetique, history, 3 years ago, In English
codeforces Codeforces | In English По-русски pathetique | Logout HOMETOPCATALOGCONTESTSGYMPROBLEMSETGROUPSRATINGEDUAPICALENDARHELP → Pay attention Before contest Educational Codeforces Round 162 (Rated for Div. 2) 2 days Register now » → pathetique pathetique User''s contest rating in Codeforces communityRating: 1448 User''s contribution into Codeforces communityContribution: -61 Settings Blog Favourites Teams Submissions Problemsetting Groups Talks Contests → Top rated # User Rating 1 jiangly 3678 2 Benq 3602 3 ecnerwala 3542 4 maroonrk 3541 5 cnnfls_csy 3540 6 orzdevinwang 3493 7 inaFSTream 3478 8 Um_nik 3430 9 Geothermal 3409 9 Rebelz 3409 Countries | Cities | Organizations View all → → Top contributors # User Contrib. 1 maomao90 174 2 adamant 164 3 TheScrasse 161 3 SecondThread 161 3 awoo 161 6 nor 159 7 maroonrk 158 8 Um_nik 156 9 BledDest 145 9 Geothermal 145 View all → → Favourite groups # Name 1 X-Camp 402H 2022 Fall View all → ...
, petyb, scanhex, senjougaharin, shnirelman, SomethingNew, Toy_mouse, Zandler fortesting the round

Full text and comments »

  • Vote: I like it
  • -41
  • Vote: I do not like it

292.
By prithwiraj15, 5 years ago, In English
Round-3 Ode 2 Code, 2021 Ode 2 Code 2021 Round-3 =========================== Round 3 of Ode 2 Code gave only one question with a total time of 45 mins to solve it. I was not able to solve this problem. Can anyone help me ? PS :- The competition is already over, hence it the question can be disclosed now **Question Statement** You are given - An array A of N integers. - And M queries consist of three integers k, y and x. Beauty of a array A[1], A[2], A[3], A[4],...., A[N] is defined as A[1] + A[2] + A[3] + A[4] + .... + A[N]. For each query, k, y, x, you are given the following conditions :- - Let U be the bitwise AND of the beauties of any y subarrays among all subarrays of size k. - And, Z = U | x, where | is the bitwise OR operation. Calculate the maximum possible value of Z for all queries. **Constraints** - 1 <= N <= 1000 - 1 <= M <= 1000 - 1 <= Ai <= 10^9 - 1 <= ki <= N - 1 <= yi <= N-ki+1 - 1 <= xi <= 10^9 **Sample Test Cases** 1) Sample Case 1 ...
Round-3 Ode 2 Code, 2021, Ode 2 Code 2021 Round-3 =========================== Round 3 of Ode 2 Code gave only one

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

293.
By Peregrine_Falcon, 5 years ago, In English
Invitation to Replay of Ada Lovelace National Girls' Programming Contest 2021 **16th of December, 2021 is the 50th Victory day of Bangladesh!** Hello, Codeforces community! I'm glad to invite you to the **Replay of Ada Lovelace National Girls' Programming Contest 2021** which will be held on December 16, 2021, at [10:00 +0600](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Replay+of+Ada+Lovelace+National+Girls%27+Programming+Contest+2021&iso=20211216T10&p1=73&ah=5) and will run for 05 hours. The contest will take place at [Toph.co](https://toph.co/) This is not a rated contest. You can register for the contest [here](https://toph.co/c/ada-lovelace-national-girls-2021-r). Problems of this contest were prepared and tested by [user:shefin.cse16,2021-12-13], [user:rebornplusplus,2019-10-16], [user:cryptid, 2020-07-04], [user:adnan_toky, 2021-07-03], [user:Algo.1067,2020-10-10], [user:tahsin_protik,2021-04-13], [user:farabi_Shafkat,2021-12-13], [user:rifatrraazz,2021-12-13], [user:ash_98,2021-12-13], [user:ishtupeed,2021-12-13], [user:Tari...
[user:shefin.cse16,2021-12-13], [user:rebornplusplus,2019-10-16], [user:cryptid, 2020-07-04], [user:adnan_toky, 2021

Full text and comments »

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

294.
By CodeStar1234, history, 5 years ago, In English
Cheaters Caught from IIT Roorkee in Round 732(Div 2) So I was going through the standings in and around my rank in the Round 732 division 2 round and found 2 people cheating in this round. I was quite surprised that all of them passed the plagiarism tests even though their submissions are same.[user:MikeMirzayanov,2021-07-13] , [user:AquaMoon,2021-07-13] , [user:Cirno_9baka,2021-07-13] These cheaters are : [user:31vaibhavg07,2021-07-13] [user:harsh_arora,2021-07-13] There submissions for question D are totally same , just there is a change in name of a function .Even the submissions for B and C are same just the variables have been changed by a bit. The links for the submissions for question D are below(Full code is same only function name for nCr is different) : [submission:122130053] [submission:122129503] There links for the submission for question C are below (Only template and variable names are different): [submission:122103199] [submission:122103741] There links for the submission for question B ...
Cheaters Caught from IIT Roorkee in Round 732(Div 2), So I was going through the standings in and around my rank in the Round 732 division 2round and

Full text and comments »

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

295.
By Proof_by_QED, 8 months ago, In English
Nebius Round 2 and Codeforces Round 1088 Editorial <spoiler summary="Rating Predictions"> | Predictor | A | B | C | D | E | F | G | H | |----------------------------------|-----|-----|-----|------|------|------|------|------| | [user:Proof_by_QED,2026-03-27] | 800 | 1300 | (1400-2000) | 1700 | 2100 | 2400 | 2600 | 3500| | [user:nifeshe,2026-03-27] | 800 | 1400 | (1400-1900) | 1800 | 2200 | 2600 | 3000 | 3500| | [user:dinohaur,2026-03-27] | 800 | 1200 | (1400-1700) | 2100 | 2300 | 2600 | 2900 | 3300 | | [user:_istil,2026-03-27] | 800 | 1200 | (1300-1800) | 1900 | 2300 | 2500 | 2800 | 3300 | | [user:Dragos,2026-03-27] | 800 | 1400 | (1400-1900) | 1800 | 2100 | 2400 | 2800 | 3500 | | [user:Argentum47,2026-03-27] | 800 | 1300 | (1400-2000) | 1900 | 2200 | 2500 | ? | ? | | [user:simplelife,2026-03-27] | 800 | 1200 | (1200-1800) | 1600 | 2000 | 2500 | 6700 | 6700 | | [user:AksLolCoding,2026-03-27] | 800 | 1000 | (1100-1800) | 1600 | 1900 | 2400 | ? | ? | | [user:nik_exists,2026-03-27]...
Nebius Round 2 and Codeforces Round 1088 Editorial, tests = 1; cin >> tests; for(int test = 0; test < tests; test++) { solve

Full text and comments »

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

296.
By JetBrains, 9 months ago, In English
JetBrains Blackbox Cup 2026 Hello Codeforces! <center> <img alt="Blackbox Cup" src="/predownloaded/01/6f/016f9c161ea8b567a1056cf765f5a7d6d8ebe501.png" style="float: right;height: 250.0px;margin: 10.0px;max-width: 100.0%;max-height: 100.0%;"> </center> We’re excited to invite you to a brand-new AI-native competition from JetBrains — not your typical algorithm marathon. Meet the <span style="font-weight:700;color:#7967FF;"><a href="https://lp.jetbrains.com/academy/blackbox-cup/2026/" style="color:inherit;font-weight:inherit;text-decoration:underline;">Blackbox Cup</a></span>, happening <span style="font-weight:700;color:#7967FF;">on March 15, 2026</span>. **TL;DR:** The Blackbox Cup is here to give you a fun (and challenging) taste of working with unknown systems, messy constraints, and missing context, with any tools allowed (yes, even AI! &#x1F92F;). <p> <center> <a href="https://lp.jetbrains.com/academy/blackbox-cup/2026/#registration" style="display:inline-flex;align-items:center;justify...
, 2026, 16:00 UTC** — Live session: Trial Round editorial + Q&A - **March 13** — Registration

Full text and comments »

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

297.
By Lewin, history, 10 years ago, In English
VK Cup Round 2 + Codeforces Round #409 Tutorial <spoiler summary="Viscious Keyboard"> [tutorial:801A] <spoiler summary="example code 1"> ~~~~~ print (lambda s: max((s[:i] + x + s[i+1:]).count("VK") for x in "VK" for i in range(len(s))))(raw_input()) ~~~~~ </spoiler> <spoiler summary="example code 2"> ~~~~~ print (lambda s: s.count("VK") + int(any(x*3 in "K" + s + "V" for x in "VK")))(raw_input()) ~~~~~ </spoiler> </spoiler> <spoiler summary="Valued Keys"> [tutorial:801B] <spoiler summary="example code"> ~~~~~ x,y = raw_input(), raw_input() print all(a>=b for a,b in zip(x,y)) * y or "-1" ~~~~~ </spoiler> </spoiler> <spoiler summary="Voltage Keepsake"> [tutorial:772A] <spoiler summary="example code (c++)"> ~~~~~ #include <stdio.h> #include <algorithm> #include <assert.h> using namespace std; typedef long long ll; typedef long double ld; // Adjust MAXN for bounds const ll MAXN=1e5+4; // MAXV is the max amount of time we can take const ld MAXV=1e18; ll a[MAXN],b[MAXN]; ld exhaust[MAXN]; i...
VK Cup Round 2 + Codeforces Round #409 Tutorial, ) { return c == 32 || c == 10 || c == 13 || c == 9 || c == -1

Full text and comments »

Tutorial of VK Cup 2017 - Round 2
  • Vote: I like it
  • +63
  • Vote: I do not like it

298.
By plagues, 3 months ago, In English
The most outrageous cheating in the history of Huawei Challenge ![ ](/predownloaded/e4/f0/e4f0838fd7d6c43c6a92c2655748800519c78bd3.jpg) I am writing this because I believe that prohibited collaboration occurred during this Challenge and affected the prize positions. To state my personal conclusion plainly: I believe this is cheating, not merely a collection of innocent coincidences. The final positions relevant to the accounts discussed in this post were: | Rank | Handle | Final score | Result of my public-data review | |---:|---|---:|---| | 2 | [user:IceKylin,2026-08-28] | 16808.628 | Historical team with [user:candy0014,2026-08-28] named “IceKylin 0339 team”; all-time runtime/score leads with [user:candy0014,2026-08-28] and [user:Retired_Zhisheng,2026-08-28] | | 3 | [user:mahiro_zcy,2026-08-28] | 16757.390 | Repeated all-time runtime/score correlation with [user:mojo__hugo,2026-08-28]; repeated timing correlation with [user:Zinc-acetate,2026-08-28]; weak close event with [user:Mango2011,2026-08-28] | | 4 | [user:Zinc-acetate,2026-08-...
325 positive submissions across 13 contest days. [user:Turritopsis_nutricula,2026-08-28] had 148

Full text and comments »

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

299.
By kostka, 12 years ago, In English
Hack me! (Codeforces Round #278 (Div. 1)) Waiting for next round, let's take some time and look at hacks in [contest:487]. That was really good round for hackers :) Previous posts (including post for Div. 2.) can be found [here](http://codeforces.me/search?query=hackme). [cut] <h3>Stats</h3> Yeah, everyone saw that there were plenty of hacks for problem A. How many exactly? Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other* | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>| :---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:487A] </small> | <strong>460 (80.70%)</strong> | 96 (16.84%)| 14 (2.46%) | 570 | 58 (11.09%) | 465 (88.91%) | 523 | <small> [problem:487B] </small> | 8 (42.11%) | 8 (42.11%)| 3 (15.79%) | 19 | 99 (27.58%) | 260 (72.42%) | 359 | <small> [problem:487C] </small> | 67 (90.54%) | 5 (6.76%)| 2 (2.70%) | 74 | 45 (28.66%) | 112 (71.34%) | 157 | <small> [problem:487D] </sm...
Hack me! (Codeforces Round #278 (Div. 1)), Waiting for next round, let's take some time and look at hacks in [contest:487]. That was really

Full text and comments »

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

300.
By susenyang, history, 8 months ago, In English
Welcome to The 15th Huazhong Agricultural University Programming Contest! Hello Codeforces Community! I'm [user:susenyang,2026-04-04], and I'm excited to share a contest with you **again**! This contest is [contest:106456], an official contest hosted by my university. You will have $5$ hours to solve $13$ problems.The round will be hosted by rules of ICPC and the penalty is 20 minutes per wrong submission. This year, I **did not** participate in problem setting; instead, I took part in the competition as a contestant. The following are the authors of this contest: - A B: [user:Jiangcheneee,2026-04-04] - C F: [user:vanadium-23,2026-04-04] - D J H I K M: [user:tryandtryagain,2026-04-04] - E G: [user:waszz123456,2026-04-04] - L: [user:WuHuaRou,2026-04-04] We would like to thank: - [user:thisislike_fan,2026-04-04], [user:Yaimsea,2026-04-04], [user:OxyaneOH2,2026-04-04], [user:Silencer76,2026-04-04], [user:lishiya,2026-04-04], [user:Linear_L,2026-04-04], [user:eiruty,2026-04-04], [user:baka_killer_uuz,2026-04-04] for testing. - [user:MikeMirza...
. You will have $5$ hours to solve $13$ problems.The round will be hosted by rules of ICPC and the

Full text and comments »

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

301.
By -WIDA-, history, 16 months ago, In English
NowCoder Summer Multi-School Training Camp 2025 Hello, Codeforces! As the official team of NowCoder (China's leading programming competition platform), we are pleased to introduce the 2025 NowCoder Summer Multi-School Training Camp! This annual event has been running for eight years. Since the summer of 2018, we have collaborated with top competitors from algorithmic competitions such as ICPC, NOI, and IOI, aiming to enhance participants' programming skills through competitions, lectures, and exchanges, and to prepare for upcoming competitions like ICPC and CCPC in the second half of the year; simultaneously, we seek to foster learning and exchange among university training teams worldwide. <center> <h2 style="border-bottom: 1px solid #000;">Details</h2> </center> 1. **Schedule**. Consistent with last year, this year's training camp will consist of ten ICPC-style competitions, starting on [Tuesday, 15 July 2025<sup title="timezone offset" style="font-size:8px;" data-immersive-translate-walked="24cdac9c-eeae-41da-aef2-9dcf...
+Multi-School+Training+Camp+2025%3A+Round+1&iso=20250715T12&p1=%3A&ah=5) and running for five weeks

Full text and comments »

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

302.
By shailesh_2004, history, 14 months ago, In English
Weak testcases in Codeforces Round 1048 Div2E1/Div1C1 and Div2E2/Div1C2 In [problem:2138C1] and [problem:2138C2], the testcases are **weak**. DP is the only approach to be used in both, but unfortunately a greedy solution got Accepted: Easy Version: [submission:337674745] It even passed hard version: [submission:337674792] **Failed testcase:** **Input:** ~~~~~ 1 19 8 1 1 1 1 2 3 4 5 6 6 7 8 9 10 11 12 13 14 ~~~~~ **Expected Output:** 5 **Greedy Approach Output:** 4 <spoiler summary="Tree Visualization"> ![Tree Visualization](/predownloaded/3b/e5/3be5ca311b851346838086569b8b0d07c07b0e56.png) </spoiler> [user:maomao90,2025-09-09], [user:StarSilk,2025-09-09], [user:installb,2025-09-09], [user:tarjen,2025-09-09], [user:wjy666,2025-09-09], [user:2014CAIS01,2025-09-09] The problem wasn’t tested properly. Even though there are more than 60 test cases, it didn’t include this one. I hope the authors add this test case and rejudge all the accepted submissions on both problems. Special thanks to [user:nithish654,2025-09-09] f...
Weak testcases in Codeforces Round 1048 Div2E1/Div1C1 and Div2E2/Div1C2, :** ~~~~~ 1 19 8 1 1 1 1 2 3 4 5 6 6 7 8 9 10 11 12 13 14 ~~~~~ **Expected Output:** 5

Full text and comments »

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

303.
By vioalbert, history, 6 years ago, In English
Invitation to TOKI Regular Open Contest #19 Happy Valentine's Day, Codeforces community! We are excited to invite you to <b>TOKI Regular Open Contest (TROC) #19!</b> Key details: <ul> <li>Contest link: [TLX](https://tlx.toki.id/contests/troc-19) (combined division)</li> <li> Time: [14th February 2021, 13:05 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=TOKI+Regular+Open+Contest+%2319&iso=20210214T1305&ah=2) </li> <li> Writer: [user:rama_pang,2021-02-09] [user:steven.novaryo,2021-02-10] [user:vioalbert,2021-02-09] [user:Zap,2021-02-09] [user:Berted,2021-02-09] [user:Pyqe,2021-02-09]</li> <li> Duration: 2 hours </li> <li> Problems: 7 </li> </ul> <br> Scoring distribution: <b>100 &mdash; 200 &mdash; 350 &mdash; 450 &mdash; 500 &mdash; 600 &mdash; 800 </b> We would like to thank: <ul> <li> [user:prabowo,2021-02-09] for the amazing coordination of the round.</li> <li> [user:hocky,2021-02-09] for helping with problem preparation.</li> <li> [user:AMnu,2021-02-09], [user:JvThunder,2021-02-09], and [...
/contests/troc-19) (combined division) * Time: [14th February 2021, 13:05 UTC](https

Full text and comments »

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

304.
By fchirica, 13 years ago, In English
Codeforces Round #245 — Editorial [problem:430A] ------------------ The problem asks you to output “-1” if there is no solution. A natural question is now: “when there is no solution”? Try to come up with a test like this! After some analysis, you’ll see anyhow we draw the points and the lines, there will always be a solution. By manually solving small cases, you might already have found the pattern. But for now, let’s assume anyhow we draw points and lines, there will always be a solution. Let’s have a fixed set of points. Then, anyhow we draw a line, there should still be a solution. So, we need to find a coloring of points, such as for every line, |number of red points which belong to it – number of blue points which belong to it| <= 1. Suppose anytime you color a point with red you assign it +1 value. Also, anytime you color it with blue you assign it -1 value. Then, for a segment, the drawing is good if S = sum of values assigned to points that belong to segment is between -1 and 1 (in other words |S| ...
Codeforces Round #245 — Editorial, . A natural question is now: “when there is no solution”? Try to come up with a test like this

Full text and comments »

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

305.
By Vichitr, 6 years ago, In English
ICPC Amritapuri Practice Session #5 [Team Contest] Announcement Hello Codeforces, **ICPC Amritapuri** Regional will be hosting next team practice round on [CodeDrills](https://codedrills.io/contests/amrita-icpc-practice-session-5) on [Sunday, 28th March 2021](https://www.timeanddate.com/worldclock/fixedtime.html?msg=ICPC+Amritapuri+Practice+Session+%235&iso=20210328T20&p1=438&ah=2&am=30). There will be 5 problems to be solved in 2.5 hours. ![ ](/predownloaded/2f/d3/2fd3f43a91f04458baa3d00e69ab9764bbd72f5a.jpeg) **Contest Details** - Contest Link — https://codedrills.io/contests/amrita-icpc-practice-session-5 - Date & Time — [28 Mar 2021, Sunday, 20:00 IST](https://www.timeanddate.com/worldclock/fixedtime.html?msg=ICPC+Amritapuri+Practice+Session+%235&iso=20210328T20&p1=438&ah=2&am=30) - Duration — 2.5 Hours - Will follow standard ICPC scoring system (20 minutes penalty and 1 point per problem) **Registration** - You will need to create a team on the contest page in order to participate. - Team size can be upto ...
the help in round testing. - Balajiganpathi [user:Balajiganapathi,2021-03-28] S, Divyansh

Full text and comments »

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

306.
By greateric, history, 5 months ago, In English
IQ is Pure COPE, Here's Why (Useful CP and Life Information #5?) Background ------------------ On CF I think you can tend to see people attributing good rating to IQ. This is often associated with hopelessness when people are stuck in gray/green. I think it's the perfect cope &mdash; it's the easiest thing to say that completely explains why you're 1100 and your friend is orange, and, bonus, if anyone tries to prove you wrong, you can just claim that they are privileged and intelligent. You may think I am 2000 and thus out of touch to be able to comment on this topic, which _may_ be true. However, I was also once a noob who got 28/1000 on a USACO silver round. And I was pretty overweight as a kid and sucked at sports and always thought of myself as not having the genetics to be an athlete, but [I now hold the squat, bench, and deadlift 18-and-under state records in my powerlifting federation](https://pa.liftingdatabase.com/records-default?recordtypeid=72&categoryid=603&weightclassid=5). (Probably not for long though lol) A lot of this i...
silver round. And I was pretty overweight as a kid and sucked at sports and always thought of

Full text and comments »

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

307.
By yummy, 11 years ago, In English
Codeforces Round #334 Bonus Editorial: More Ideas on Div. 1 E I wrote problem [problem:603E] for the recent Codeforces round and was pleasantly surprised to see so many different solutions submitted in addition to my own ([submission:14611571]). Even though I proposed the problem, I learned a lot by reading the submissions after the contest! Since I think these other approaches illustrate some beautiful techniques, I would like to share them with you guys. Below, I describe three different solution ideas by [user:TooSimple,2015-12-03], [user:winger,2015-12-03], and [user:malcolm,2015-12-03], respectively. (If you haven't read the [editorial](/blog/entry/21885) yet, I suggest that you do so before continuing, since some of the observations and definitions carry over.) #### Solution 1: [user:TooSimple,2015-12-03] Like my original solution, this approach uses a link-cut tree to maintain an online MST. The main idea is the following observation: In a tree with an even number of vertices, an edge can be removed if and only if it separates the grap...
Codeforces Round #334 Bonus Editorial: More Ideas on Div. 1 E, I wrote problem [problem:603E] for the recent Codeforces round and was pleasantly surprised to see

Full text and comments »

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

308.
By perseverance_01, 5 years ago, In English
How to set a Round on Codeforces [Tutorial] ft. Jay Sharma Hello Everyone, I Invited over [user:JaySharma1048576,2021-08-13] who was the setter of round #730 Div2 to explain the whole process of setting a round on Codeforces, from eligibility criteria to making test cases and about monetary benefits. Video Link: [here](https://www.youtube.com/watch?v=JNmL--61ts8) Do Check it out! Edit: There is a bit of background noise in the video, I apologize about that, there was some construction work going around the house, will be more careful next time. Thank You :)
How to set a Round on Codeforces [Tutorial] ft. Jay Sharma, Hello Everyone, I Invited over [user:JaySharma1048576,2021-08-13] who was the setter ofround, I Invited over [user:JaySharma1048576,2021-08-13] who was the setter of round #730 Div2 to explain

Full text and comments »

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

309.
By installb, history, 14 months ago, In English
Codeforces Round 1048 (Div. 1, Div. 2) Editorial [2139A &mdash; Maple and Multiplication](https://codeforces.me/contest/2139/problem/A) Idea: [user:installb,2025-09-08] Preparation: [user:installb,2025-09-08],[user:2014CAIS01,2025-09-08] <spoiler summary="Solution"> If $a=b$ we need $0$ steps. If $a$ can be divided by $b$, we only need $1$ step, which is to multiply $b$ by $\frac{a}{b}$. Same for the case when $b$ can be divided by $a$. Otherwise, we need at most $2$ steps. As both $a$ and $b$ are positive integers, we can first multiply $a$ by $b$ and then multiply $b$ by the original value of $a$. Both number will be equal to $a\times b$. </spoiler> <spoiler summary="Code (C++)"> ```cpp #include <bits/stdc++.h> using namespace std; typedef long long ll; int solve(){ int a,b; cin >> a >> b; if(a == b) return 0; if(a % b == 0 || b % a == 0) return 1; return 2; } int main(){ ios::sync_with_stdio(false); int TC; cin >> TC; while(TC --){ cout <<...
Codeforces Round 1048 (Div. 1, Div. 2) Editorial, problem"> - Amazing problem: - Good problem: - Average problem: [likes:13

Full text and comments »

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

310.
By shahidul_brur, 9 years ago, In English
[Tutorial] Snake Eating Problem of Codechef Snackdown 2017 Qualification round In the qualification round of [Codechef Snackdown 2017](https://www.codechef.com/SNCKQL17), I was able to solve all the problems and I had a great fun to solve the problem [SNAKEEAT](https://www.codechef.com/problems/SNAKEEAT). I was so much excited that I had given [a post](http://codeforces.me/blog/entry/52130) to express my feeling after solving this problem. After that some people asked me on codeforces or [facebook](https://www.facebook.com/Shahidul.BRUR), how I had solved the problem. So, I had decided to write a post regarding my solution idea of this problem. Before staring the post, I want to say you that I am not so great programmer, so I may make mistake in my post. And, this is my first tutorial post on codeforces, so forgive me if you find anything wrong. Also, English is not my native language, so I may make some grammatical mistake in my post. So, I beg your forgiveness in advance. Abridged problem description: ----------------------------- Given the l...
[Tutorial] Snake Eating Problem of Codechef Snackdown 2017 Qualification round, In the qualification round of [Codechef Snackdown 2017](https://www.codechef.com/SNCKQL17), I was

Full text and comments »

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

311.
By csacademy, 9 years ago, In English
Round #48 (Div. 2) Hello, Codeforces! We are going to host a new contest at [csacademy.com](http://csacademy.com). [Round #48](https://csacademy.com/contest/round-48/) will take place on [Wednesday, September/13/2017 15:00 (UTC)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=CS+Academy+Round+%2348&iso=20170913T15&p1=1440&ah=2). This round will be a Div. 2, affecting users with a rating below **1675**. #### Contest format: - You will have to solve **5** tasks in **2** hours. - There will be full feedback throughout the entire contest. - Tasks will not have partial scoring, so you need to pass all test cases for a solution to count (ACM-ICPC-style). - Tasks will have dynamic scores. According to the number of users that solve a problem the score will vary between 100 and 1000. - Besides the score, each user will also get a penalty that is going to be used as a tie breaker. #### About the penalty system: - Computed using the following formula: the minute of the last accepted ...
Round #48 (Div. 2), ). [Round #48](https://csacademy.com/contest/round-48/) will take place on [Wednesday, September/13

Full text and comments »

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

312.
By shishyando, 5 years ago, In English
Codeforces Round #781 (Div. 2) Editorial Again, I hope that you liked all the problems. Share your ideas and solutions in the comments, because there are always different ones! So, the editorial: <spoiler summary="A: GCD vs LCM"> [problem:1665A] <spoiler summary="Editorial"> In this problem it is enough to print $n - 3$, $1$, $1$, $1$. It is easy to see that this answer is correct for any $n \ge 4$. </spoiler> <spoiler summary="Implementation (C++, shishyando)"> ~~~~~ #include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; while (T --> 0) { int n; cin >> n; cout << n - 3 << ' ' << 1 << ' ' << 1 << ' ' << 1 << '\n'; } return 0; } ~~~~~ </spoiler> </spoiler> <spoiler summary="B: Array Cloning Technique"> [problem:1665B] <spoiler summary="Editorial"> We will use a greedy technique. Let's find the most common element in the array. Let it be $x$ and let it occur $k$ times in the array. Then let's make a copy where all elements...
Codeforces Round #781 (Div. 2) Editorial, numbers $\{23, 19, 17, 13, 11, 9, 7, 5, 4\}$. Their $\text{lcm} > 10^9$ that's why $x \bmod \text{lcm} = x

Full text and comments »

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

313.
By culver0412, 4 years ago, In English
Editorial of Codeforces Round #865 Thanks for participating, and happy Easter! ### [problem:1816A] <spoiler summary="Editorial"> Let us show that Ian can get to Mary within two moves. Indeed, consider $(x_1,y_1)$ and $(x_2,y_2)$ where $x_2-x_1=1$, since the value of the $x$-coordinates of a point lying on the segment joining $(x_1,y_1)$ and $(x_2,y_2)$, and is not at the endpoints, is strictly between $x_1$ and $x_2$, but there are no integers strictly between $x_1$ and $x_2$, the point must not be a lattice point. Similarly, no lattice points lie on the segment joining $(x_1,y_1)$ and $(x_2,y_2)$ with $y_2-y_1=1$ except for the endpoints. Therefore, Ian can jump from $(0,0)$ to $(x-1,1)$ to $(x,y)$. </spoiler> <spoiler summary="Implementation"> ~~~~~ #include<bits/stdc++.h> using namespace std; void solve(){ int a,b; cin >> a >> b; cout << 2 << "\n" << a-1 << ' ' << 1 << "\n" << a << ' ' << b << "\n"; } int main(){ int t; cin >> t; while(t--){ solve(); ...
Editorial of Codeforces Round #865, , and a bit complicated. During round testing, tester [user:rsj,2023-04-09] found an alternative

Full text and comments »

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

314.
By Test2311, 6 years ago, In English
Invitation to Code-MAT 2021 Hello codeforces!!! **Mathematics and Computing Society (MACS) IIT BHU** is glad to invite you to our programming event **Code-MAT 2021**. The contest will take place on Codechef [15th April, 17:30 IST](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Code-MAT&iso=20210415T1730&p1=1045&ah=2). You will be given 2 hours to solve six problems of varying difficulty which is bound to keep you on your toes. **Contest link** : https://www.codechef.com/CDMT2021 The problem set has been prepared by [user:Test2311,2021-04-12] , [user:Delirious_Butter,2021-04-13] , [user:AK....,2021-04-13] and [user:TheBigBool,2021-04-12]. We would also like to appreciate [user:gaddopur_coder,2021-04-12] , [user:ShubhamAvasthi,2021-04-12] , [user:vivant,2021-04-12] , [user:akshat__1136,2021-04-12] and [user:sin_ha_rsh,2021-04-12] for testing the round and providing valuable feedback on the problems. ![ ](https://i.imgur.com/LwABLsM.png) We have prizes worth **2000 INR** for IIT BHU Par...
-12] and [user:sin_ha_rsh,2021-04-12] for testing the round and providing valuable feedback on the

Full text and comments »

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

315.
By Nickolas, 15 years ago, translation, In English
Surprise Language Round #5: editorial Here goes a review of the problems. I tried to set them so that each of them shows a certain aspect of the language --- a commonly used verb or a specific feature. Once it was recognized and found, the solution should become evident. #### [problem:153A] Let me note right away that the sample code provided in the blog post does work both in Custom test and in ideone (as well as locally), as long as the numbers are written one per line and (attention!) each of them, including the last one, is followed by the end-of-line character. The last '\n' is not shown in the tests, but it is there, and COBOL minds it. All test cases at Codeforces are generated with this in mind, so there should be no problems like this when the code is submitted. The most evident COBOL feature is storing numbers in decimal notation, with width set by the programmer. In this case we focused on the fact that by default the number is printed in a fixed-width way, padded with leading zeros if needed. These zer...
Surprise Language Round #5: editorial, code provided in the blog post does work both in Custom test and in ideone (as well as locally), as

Full text and comments »

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

316.
By iman_MC, 16 years ago, In English
ALL CodeForces Rounds Tutorial <html> <body> <br /><br /> >>>>>>>**Hi I just Say Really Sorry For Delay in UPD This Blog...!**<br /><br /><br /> <u>This is not Complete</u> , but i try to find <b>all Tutorial codeforces round</b> and posted here , thanks in advance :D <br /><br />This post will <b> <span class="Apple-style-span" style="border-collapse: collapse;color: rgb(255,0,0);font-family: verdana , arial , sans-serif;font-size: 12.0px;"> UPD</span></span></b> after each contest . <span>If anyone have or writes any editorial that's</span> <b> <span> <span class="Apple-style-span" style="border-collapse: collapse;color: rgb(255,0,0);font-family: verdana , arial , sans-serif;font-size: 12.0px;"> not in here</span></span></b> , Plz post here for ALL . <br /><br /><b>UPD </b> &nbsp;: Table1 updated : in Future!!! <br /><br /><b>UPD </b>&nbsp;: Table2 updated : CF # 118 ...to... CF # 169 added .<br /><br /> </p><hr /><br /></p> <div align="justify"> <br /><br /><b><s...
> Testing Round #4

Full text and comments »

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

317.
By Ripatti, 15 years ago, translation, In English
Editorial for Codeforces Beta Round #93 <p><b>div2 A.</b> In this problem you should find length of polyline, multiply it by $k/50$ and output that you will recieve. Length of polyline is sum of lengths of its segments. You can calculate length of every segment using Pythagorean theorem: $d(A,B)=\sqrt{ (x_A - x_B)^2 + (y_A - y_B)^2 }$.<br />[cut]<br /><b>div2 B.</b> Idea of this problem was offered by [[user:RAD,2011-11-10]]. It was the last problem in the problemset and I had no any easy idea:) I thank him for it.<br /><br />Here you should calculate an array $cnt[100]$. $i$-th element of it stores number of sticks whose lengths equal $i$. Now you should calculate number of pairs of sticks of equal lengths. This number is $k = \sum_{i=1}^{100} [cnt[a]/2]$, where $[x]$ is floor of $x$. For every frame you need 2 if such pairs and <span class="short_text" lang="en"><span class="hps">you can choose it in any order</span></span>. Therefore the answer will be $z = [k/2]$.<br /><br /><b>div2 С. div1 A.</b> At the first you should...
Editorial for Codeforces Beta Round #93, \le y_2 \le x_2$ $t(y_1, y_2) < t_0$. For example, you can see following test 100 110

Full text and comments »

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

318.
By Biza, 7 years ago, In English
Mirror of Bubble Cup 12 Finals on Codeforces Hello, Codeforces! It's our pleasure to announce the the finals of the 12th [Bubble Cup](https://www.bubblecup.org/)! Bubble Cup is a programming competition organized by [Microsoft Development Center Serbia (MDCS)](https://www.microsoft.com/sr-latn-rs/mdcs). The contest will take place on [Saturday, 14th of September at 10:00 UTC+2](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Bubble+Cup+12+Finals+-+%5BOnsite%5D&iso=20190914T10&p1=35&ah=5) in Belgrade, and will last for 5 hours. Live results will be available on the [official Bubble Cup website](https://www.bubblecup.org/CompetitorsCorner/Finals/1775). Results will be frozen during the last hour of the competition. The winners will be announced at the closing ceremony. The format of the competition is very similar to ACM-ICPC — teams consisting of up to three people are allowed, and they have one computer and five hours to solve problems without partial scoring. Ties are broken using the usual time penalty rules. ...
-13] for big help with problem testing. The full editorial, together with the statements and

Full text and comments »

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

319.
By ajinkya1p3, history, 11 years ago, In English
Invitation to Clique 1.1 Clique is back!! And this time, it is going to be bigger, better, and much more exciting!! Get ready to experience the thrill once again as we bring for you 3 hours of non-stop coding, and fun! Web Enthusiasts' Club, National Institute of Technology Karnataka, Surathkal has brought for you the second edition of the online programming contest series &mdash; Clique. Date: 12th March 2016, Saturday Time: 9.30pm to 12.30am IST ([Check your timezone here](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Clique+1.1&iso=20160312T2130&p1=2225&ah=3)) Register At: [http://www.hackerrank.com/clique2](http://www.hackerrank.com/clique2) Problem Setters: [user:vishalkarve15,2016-03-10], [user:vadi,2016-03-10], [user:ajinkya1p3,2016-03-10], [user:vaibhav0808,2016-03-10], [user:64616e69,2016-03-10] Testers: [user:rednivrug15,2016-03-10], [user:vishalkarve15,2016-03-10], [user:prabhu_3095,2016-03-10] RULES: 1.This is an individual contest. 2.There are FIVE problems of...
of varying difficulty levels. 3.You will receive one point for solving a problem (passing alltest

Full text and comments »

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

320.
By hmehta, history, 6 years ago, In English
Topcoder Single Round Match 799 — Postponed by an hour Topcoder SRM 799 is scheduled to start at [12:00 UTC-5 on February 6, 2021](https://www.timeanddate.com/worldclock/fixedtime.html?msg=SRM+799&iso=20210206T12&p1=98). Registration is now open for the SRM in the [Arena or Applet](https://www.topcoder.com/community/arena) and closes at 11:55 UTC-5. The coding phase will start at 12:05 UTC-5, so make sure that you are all ready to go. Thanks to <a href="https://www.topcoder.com/members/IH19980412"><font color=red><b>IH19980412</b></font></a> for writing the problem set. Also thanks to <a href="https://www.topcoder.com/members/misof"><font color=red><b>misof</b></font></a> for testing and coordinating the round. This SRM will award points towards Stage 3 of TCO21 and also the qualifications for <a href="http://tco21.topcoder.com/regional-events/">TCO21 Regional Events</a> **Some Important Links**:: [Match Results](https://community.topcoder.com/stat?c=round_overview) (match results, rating changes, challenges, individual tes...
Topcoder Single Round Match 799 — Postponed by an hour, ">misof for testing and coordinating the round. This SRM will award

Full text and comments »

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

321.
By csacademy, 9 years ago, In English
Round #61 (Div. 1 + Div. 2) with prizes Hello, Codeforces! We're going to host a new contest at [csacademy.com](http://csacademy.com). [Round #61](https://csacademy.com/contest/round-61/) will take place on [Wednesday, 13/December/2017 15:05 (UTC)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=CS+Academy+Round+%2361&iso=20171213T1505&p1=1440&ah=2). This contest will be a Div1 + Div2, with **7** tasks of varying difficulty that need to be solved in **2** hours. #### Facebook event Recently, Facebook has reintroduced the possibility of recurring events. If you choose "Interested" [here](https://www.facebook.com/events/1480600318656445/), you will be notified before each round we organise from now on. #### Contest format: - You will have to solve **7** tasks in **2** hours. - There will be full feedback throughout the entire contest. - Tasks will not have partial scoring, so you need to pass all test cases for a solution to count (ACM-ICPC-style). - Tasks will have dynamic scores. According to the ...
Round #61 (Div. 1 + Div. 2) with prizes, ). [Round #61](https://csacademy.com/contest/round-61/) will take place on [Wednesday,13/December/2017

Full text and comments »

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

322.
By dalex, 15 years ago, translation, In English
Codeforces Beta Round 76 - Analysis <p>At first I tell about the contest at all.<br></p>My problems in the contest were A-div2,&nbsp; B-div2,&nbsp; C-div2/A-div1,&nbsp; E-div2/C-div1,&nbsp; D-div1. I wanted to make only div.2 round, but then we decided to give you seven problems at both divisions. <a class="rated-user user-admin" href="../../../profile/MikeMirzayanov" title="Штаб, MikeMirzayanov">MikeMirzayanov</a> prepared the problem about milk pouring and <a class="rated-user user-orange" href="../../../profile/anonymous" title="Майор anonymous">anonymous</a> gave E-div1 problem. Also <a class="rated-user user-admin" href="../../../profile/RAD" title="Штаб, RAD">RAD</a> gave some advices to complicate problems Azembler and Flags a bit.<br><p>And now let's start analysis.<br><br><br><b>Problem A (div.2) - Restoring Password</b><br><br>Password was very easy to restore. You should just iterate over groups of 10 characters in the first string and over all codes. Then, if some number's code is equal to the group - print t...
Codeforces Beta Round 76 - Analysis, -div2, C-div2/A-div1, E-div2/C-div1, D-div1. I wanted to make only div.2 round

Full text and comments »

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

323.
By yelghareeb, history, 10 years ago, In English
My cheating incident on today's contest (round #381 DIV 2) I’m going to share with you my story in today’s contest. After the system test and getting my A B C problems accepted, I was surprised of being removed from the standings board and having my problems skipped. Thanks to Mike Mirzayanov, I knew that there was a cheating incident on my profile, as my solution for problem A was identical to pashka921’s. - My solution: [http://codeforces.me/contest/740/submission/22428028](http://codeforces.me/contest/740/submission/22428028) (19:39:33) - Solution of pashka921: [http://codeforces.me/contest/740/submission/22428017](http://codeforces.me/contest/740/submission/22428017) (19:39:28) The 2 solutions are completely IDENTICAL and There is no probability that this situation happened by coincidence. FYI, his submission was before mine by 5 seconds exactly. **First, I’m going to prove that pashka921 is cheating:** 1. At every page of submission on his profile ([http://codeforces.me/submissions/pashka921](http://codeforces.me/submi...
My cheating incident on today's contest (round #381 DIV 2), did, in codeforces round 367 div 2, between time 20:36:09 and time 20:40:13, he was able to make 2

Full text and comments »

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

324.
By Sumarbrander, history, 6 years ago, In English
Weak test cases for the problem C of Codeforces Round 664 (div 2) My solution for the problem [problem:1395C] of the contest [contest:1395] was uphacked by [user:lightbender,2020-08-13] after the contest. So I was looking for the same mistake in other participants' code and found another user with code giving the wrong output on the same test case. Thanks [user:yellow_13,2020-08-13] for finding the test case. I feel that many incorrect codes might have been accepted because of weak test cases. My Submission:- [submission:89709001] Other Submission:- [submission:89699186] The solution fails for the test case 3 2 3 10 128 130 137 The output should be 130 but the code outputs 131. This is the second time in last 3 contests that incorrect codes have been accepted due to weak test cases. I ask the Codeforces community and [user:sshwyR,2020-08-13] to look into it.
Weak test cases for the problem C of Codeforces Round 664 (div 2), [user:yellow_13,2020-08-13] for finding the test case. I feel that many incorrect codes might have been, incorrect codes have been accepted due to weak test cases. I ask the Codeforces community and

Full text and comments »

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

325.
By Lewin, history, 9 years ago, In English
Editorial Round 1 of Yandex.Algorithm 2018 <spoiler summary="Police Patrol"> First, let's try to find the largest block that two patrols can cover (hint, it's not k). For instance, we can have one patrol cover $1,2,\ldots,k$. and the other cover $2,3,\ldots,k+1$. So, we can split $n$ houses into blocks of length $k+1$. Now, we have to look at what to do with the leftover houses. If there are more than two empty blocks, we need two patrols to cover both blocks. If there is only one empty block, we only need one patrol. Thus, the answer can be computed by the formula in the code below <spoiler summary="code"> ~~~~~ n,k = map(int, raw_input().split()) print (n/(k+1))*2 + min(2, n%(k+1)) ~~~~~ </spoiler> </spoiler> <spoiler summary="Alphabetic Subsequence"> We can check that this is equivalent to counting the number of permutations of $0,1,2,\ldots,9$ that appear in $s$. There are two solutions: <spoiler summary="solution 1"> Just do it. This is O(10! * |s|) ~ 3*10^8. This is fast enough in some languages. ...
Editorial Round 1 of Yandex.Algorithm 2018, simulate one round, and can multiply by an appropriate constant to get the limit value. We can also

Full text and comments »

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

326.
By Nickolas, 12 years ago, translation, In English
Surprise Language Round #7: editorial #### [problem:470A] As usual, the first problem tests competitors' ability to do basic math, and in this case it is even easier than the sample &mdash; without any loops. <pre>^'0- &#36 1+*3*1+.</pre> #### [problem:470B] This problem uses more advanced language concepts &mdash; loop, conditional execution and even named variables! Variables are convenient to use as loop counters and result accumulators, so as to avoid stack manipulations for the same purpose. [cut] An if-then-else in FALSE looks like this: <pre>(true/false condition on top of stack) &#36; [(then statements)] ? ~ [(else statements)] ?</pre> Solution: <pre>0n: {number of 6s found uninterrupted so far} 0r: {true, if 666 found} [^&#36 1_=~] [ '6= &#36 [n; 1+ n:] ? ~ [0n:] ? n; 2 > r; | r: ] # % r; &#36 ["YES"] ? ~ ["NO"] ?</pre> #### [problem:470C] This problem can be solved in two ways. You could read numbers, store them to named variables and de...
Surprise Language Round #7: editorial, write a "simple counting sort", as recommended by [user:Egor,2014-09-13]: do an outer loop from 1

Full text and comments »

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

327.
By Drew_, history, 5 years ago, In English
Invitation to TOKI Regular Open Contest #26 Dear Codeforces Community, Happy (late) Chinese New Year Codeforces! We are excited to invite you to **TOKI Regular Open Contest #26**! Key details: - Contest link: [TLX](https://tlx.toki.id/contests/troc-26) - Time: [15th February 2022, 13:05 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20220215T2005&p1=561&ah=2&am=20) - Writer: [user:Drew_,2022-02-12] [user:Nyse,2022-02-12] [user:bry_rp,2022-02-12] [user:danielcm5583,2022-02-12] [user:gansus,2022-02-12] - Duration: 2 hours 20 minutes - Problems: 7 - Score Distribution: **100 &mdash; 300 &mdash; 300 &mdash; 400 &mdash; 500 &mdash; 700 &mdash; 700** Many thanks to: - [user:prabowo,2022-02-12] for the amazing coordination of the round. - [user:hocky,2022-02-12] for helping with problem preparation. - [user:DystoriaX,2022-02-12], [user:Takeme,2022-02-12], and [user:Ayaze,2022-02-12] for testing the problems and giving invaluable feedback. - [user:fushar,2022-02-12] for the TLX platform! Hop...
://tlx.toki.id/contests/troc-26) - Time: [15th February 2022, 13:05 UTC](https://www.timeanddate.com

Full text and comments »

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

328.
By wakanda-forever, history, 13 months ago, In English
Codeforces Round 1059 (Div. 3) Editorial [problem:2162A] Idea: [user:wakanda-forever,2025-10-10] Preparation: [user:wakanda-forever,2025-10-10] <spoiler summary = "Solution"> Let's say we have a sequence of numbers with an average equal to $k$. Adding a number greater than $k$ increases the average, while adding a smaller one decreases it. Therefore, the maximum average subarray is formed by taking the maximum element, since including anything smaller would only lower the average. Hence, the final answer is the maximum element of the given array. Time Complexity: $O(n)$ per testcase. </spoiler> <spoiler summary = "Implementation"> ~~~~~ #include<bits/stdc++.h> using namespace std; #define ll long long int main(){ int t; cin >> t; while(t--){ int n; cin >> n; vector<int> a(n); for(int i = 0; i < n; i++) cin >> a[i]; cout << *max_element(a.begin(), a.end()) << endl; } return 0; } ~~~~~ </spoiler> [...
Codeforces Round 1059 (Div. 3) Editorial, > [problem:2162F] Idea: [user:tamzid1,2025-10-13], [user:wuhudsm,2025-10-13], [user:wakanda-forever

Full text and comments »

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

329.
By kyuridenamida, 16 years ago, In English
Codeforces Beta Round #61 (Div. 2) <font class="Apple-style-span" face="verdana, arial, sans-serif"><table class="standings" style="border-collapse: collapse; -webkit-border-horizontal-spacing: 0px; -webkit-border-vertical-spacing: 0px; width: 1168px; font-size: 14px; "><tbody><tr><th class="top left" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0.5em; padding-right: 0.5em; padding-bottom: 0.5em; padding-left: 0.5em; font-style: normal; font-weight: bold; text-align: center; border-top-width: initial; border-top-style: none; border-top-color: initial; border-right-width: 1px; border-right-style: solid; border-right-color: rgb(225, 225, 225); font-size: 0.9em; border-left-style: none; border-left-width: initial; border-left-color: initial; width: 2em; ">#</th><th class="top" style="margin-top: 0px; margin-right: 0px; margin-bottom: 0px; margin-left: 0px; padding-top: 0.5em; padding-right: 0.5em; padding-bottom: 0.5em; padding-left: 0.5em; font-style: normal; font-weight: b...
Codeforces Beta Round #61 (Div. 2), ="font-size: 10px; display: block; ">00:13

Full text and comments »

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

330.
By jha_saurav, history, 7 years ago, In English
Test Case Fails in problem C.Powered Addition of Round 633(Div 2) link to the question: https://codeforces.me/contest/1339/problem/C link to submission: https://codeforces.me/contest/1339/submission/76490327 After I read the question, I realised the following: step-1. if a number of the array is smaller than the previous one, then we will add-in powers of 2 to make it greater than equal to the previous number; and we need to choose those seconds or those iterations only so that we get the minimum possible number that will be greater than equal to the previous number. Step-2. having realised the above, I calculated the difference whenever a number was smaller than the previous one and simply found till when shall I add in powers of 2 so that the number gets greater than equal to the difference calculated(i.e 1+2+4+8+16......); do note here I have iterated in consecutive seconds, i.e if I got 5 seconds then it means it requires the previous 4 additions of powers of 2. step-3.now the number which I got from the previous operat...
Test Case Fails in problem C.Powered Addition of Round 633(Div 2), 13(as we will remove only 2), and if we use sub_process(i) on the example given in sub_process(ii

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

331.
By SnowLucario_Z, history, 4 years ago, In English
A Recap of My First Year in CodeForces Hello all on Codeforces! ------------------ It’s been just over a full year since I created my Codeforces account. Since then a lot has happened on my Codeforces journey so far. With everything that’s happened I want to look back at how I got to my current point, share what I learned in the process, recap some of my best moments, and laugh at whatever I was thinking on a few of these contests, because a lot happened. The only issue is that there’s no way I’m going to detail all **60** contests I took part in 2022. Instead I’ve chosen to “award” the 9 most memorable contests, wheter it be because I did exceedingly well or self destructed in almost hilarious fashion. A few notes before I begin: No full solutions for any problems are shown in this post but there are code snippets and discussions that are spoilers for these problems. I apologize in advance. ### First Contest &mdash; [Hello 2022](https://codeforces.me/contest/1621) This was the first contest held in 2022, ...
="Honourable Mention"> [Round 764 (Div 3)](https://codeforces.me/contest/1624), this was the second

Full text and comments »

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

332.
By cristian1997, history, 6 years ago, In English
FIICode Final Round [CSAcademy online mirror — rated] The FIICode Final Round will take place Saturday, 29th August, from 13:05 to 15:35 (UTC). The problems were created and prepared by [user:retrograd,2020-08-29], [user:Juve45,2020-08-29], [user:cristian1997,2020-08-29], [user:denis2111,2020-08-29], [user:Andreii,2020-08-29] and [user:pauldiac,2020-08-29]. We would also want to thank [user:sebi110,2020-08-29] and [user:lungualex00,2020-08-29] for testing the round and providing valuable feedback. We will host a parallel online mirror on [CSAcademy](https://csacademy.com/) at 13:05 (UTC). We invite everyone to join. The mirror round will be rated :) [This](https://csacademy.com/contest/fii-code-2020-final-round-mirror) is the link of the mirror. LE: The contest finalists have been automatically added to the official round. (Which is by default hidden for the rest). You can check the list of finalists [here](https://docs.google.com/spreadsheets/d/12i9uDx80-QTbgJSq8RGEZKgfFPEEVZxkc9ShLy5SMrU/)
FIICode Final Round [CSAcademy online mirror — rated], The FIICode Final Round will take place Saturday, 29th August, from 13:05 to 15:35 (UTC). The

Full text and comments »

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

333.
By MikeMirzayanov, 14 years ago, translation, In English
VK Cup 2012 Final — coming soon! <img src="http://assets.codeforces.com/images/vkcup-2012-star.png" style="width:200px;float:right;"/> Hi everybody! The VK Cup 2012 programming championship finals is going to take place very soon. The organizing committee and jury are working around the clock to set up the event that the participants will like. Let us remind you that the finals will take place from July, 13 to July, 16. We will choose the best 50 participants by the results of [contest:164]. As soon as we are absolutely sure about who can come to the finals, we will publish the list of the finalists. We’d like to share some information from the organizing committee headquarters. The finals’ participants will be accommodated in the beautiful Kempinski hotel in the centre of St. Petersburg, on the bank of the Moika. The hotel is located within a walking distance from the Vkontakte office, so there won’t be any exhausting buses and coming across the city’s traffic jams! Please note the roof restaurant with...
participants will like. Let us remind you that the finals will take place from July,13 to July

Full text and comments »

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

334.
By wuhudsm, history, 19 months ago, In English
Code Release for TheForce Round #42 Top 10 Hello, Codeforces. Today, as the main manager of a contest, I have decided to release the code for [TheForce Round # 42](https://codeforces.me/gym/105846) Top 10. The reason for this decision is that during the middle of the contest, we noticed unusual standings: ![ 2025-04-18 000415.png](https://s2.loli.net/2025/04/18/inqucELoWUXfOra.png) As a convention of codeforces, the code of all participants after the contest will be made public. I have decided to do the same thing here, and I believe that if you are a normal and honest participant, it will not infringe upon any of your rights. Also, we are checking the code of the participants and making cautious judgments. The allocation of prizes and the calculation of TheForce Rating will be delayed. Sorry for any inconvenience caused. We sincerely hope to maintain a fair and honest competitive environment for all participants. Integrity is the cornerstone of programming contests, and we believe that upholding these values...
Code Release for TheForce Round #42 Top 10, for [TheForce Round # 42](https://codeforces.me/gym/105846) Top 10. The reason for this decision

Full text and comments »

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

335.
By Nickolas, 11 years ago, translation, In English
VK Cup 2016 Wild Card Round 1: editorial All solutions use the same verb definitions to read and write data as the example: ~~~ print =: 1!:2&2 read =: 1!:1[3 ~~~ Besides, the scripts have to end with verb exit ''. #### [problem:640A] As usual, the first problem tests competitor's ability to do basic arithmetics. Even in a language so unusual as J arithmetic verbs look pretty standard. Well, except for the fact that in absence of brackets operations are performed right-to-left, without any operator precedence, and division is denoted with %. [cut] Verb [".](http://code.jsoftware.com/wiki/Vocabulary/quotedot#dyadic) converts a string to a number or an array of numbers. ~~~ n =. ". (read-.LF)-.CR print 1 + (n * (n + 1)) % 2 ~~~ #### [problem:640B] This problem hints the competitors that J also has common imperative constructs for loops and conditional execution. In this case it's convenient to use [select. case. do.](http://www.jsoftware.com/help/dictionary/csel.htm). ~~~ month =. (read-.LF)-.CR...
VK Cup 2016 Wild Card Round 1: editorial, lines is separated with characters CR (#13) and LF (#10). To find sum of numbers written in different

Full text and comments »

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

336.
By MikeMirzayanov, 16 years ago, translation, In English
Codeforces Contests <p><i>You may read complete rules <a href="/blog/entry/4088">here</a>.</i></p> <img src="http://static.codeforces.ru/cache/images/codeforces-logo.png" style="float:right;margin:0.5em;"> <p> The text contains only preliminary rules of Codeforces contests - something surely will change. In particular, I hope to help the community to find the illogic in the rules. However, I have already discussed the format with programming contests dinosaurs and made unrated alpha contests - it seems rules are OK. </p> <p> I think than the format 5 tasks x 2 hour is quite good. For this reason, in the near future we will not change it, but of course, experiments are possible. </p> <p><b> 1.</b> Before the competition all participants are divided into rooms, each room contains about 20 participants. For now random strategy works, but after a while it will be somehow correlated with the rating.[cut]</p> <p><b> 2.</b> The start of contest looks quite like ICPC: all problems immediately...
hacking, you can offer a test (or a generator program which outputs it to the standard output) on

Full text and comments »

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

337.
By MathModel, history, 13 months ago, In English
Codeforces Round 1061 (Div. 2) Editorial ### Thank you for participating ! Special Thanks to [user:hxu10,2025-10-24] for giving me the chance to write the editorial and for [user:maomao90,2025-10-24] for enhancing the editorial !. Editorial of Problems E and F are written by hxu10, and the rest are written by me. I hope they're insightful and concise, please let me hear your opinion about it or any feedback in general &#128153;. #### [problem:2156A] <spoiler summary="Hints"> <spoiler summary="Hint 1"> Since $m_1 \le m_2$, the total number of slices Alice ate is always at least as much as the total number of slices Bob ate. What's optimal construction ? </spoiler> <spoiler summary="Hint 2"> We want to try to minimize the difference between the total number of slices Alice ate and the total number of slices Bob ate. </spoiler> <spoiler summary="Hint 3"> The optimal construction is to let both $m_1$ and $m_2$ to be equals to one. The sequence of operations, denoted by $(m_1, m...
Codeforces Round 1061 (Div. 2) Editorial, Neutral Bad Didn't Solve #### [problem:2156D

Full text and comments »

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

338.
By ACGN, history, 2 years ago, In English
About 2031C (Penchick and BBQ Buns, problem C of CF Round 987), and extra challenges Author of the problem [problem:2031C] here, hope you enjoyed the contest yesterday (Almost exactly 24 hours ago...)! Looking at the votes on [the editorial](https://codeforces.me/blog/entry/136260), it's obvious that it's a very polarizing problem: an hour or so after the contest, the problem had roughly equal numbers of "likes" and "dislikes", and now (as of writing) there are around 320 likes to 200 dislikes. Of course, this is completely predictable: the opinions on this problem were quite polarized for a few reasons: 1. Troll and WA trap: it's **very** easy to fall into the trap of thinking that there is no solution for all odd $n$; thus, **over 12,900** (!) WA on pretest 2 solutions were received, as compared to only 4,700ish Accepted solutions. This ratio seems a bit extreme for a problem C; in the previous Div.2's problem C ([problem:2028C]), there were 3,500ish Rejected solutions to 2,500ish Accepted ones. 2. The construction: hard-coding the case $n=27$ seems weird an...
About 2031C (Penchick and BBQ Buns, problem C of CF Round 987), and extra challenges, negative opinions, including during testing, why was this problem still adopted? 1. There was no

Full text and comments »

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

339.
By ivanromanov, 14 years ago, In English
Bayan — live coverage Hi everybody, it's 11:10 local time at Tehran, I'll tell you how the Bayan Programming contest 2013 (1391) onsite Finals is progressing. ![ ](http://ivanromanov.ch/img/bayan/DSC04405.JPG) **22:17**. Peter50216, cerealguy and Egor are top-three! Congratulations! **22:05**. Closing ceremony. The rejudge took place for one problem. **18:30**. Not everything of Funkoders has been judged yet, so the results of this additional fun contest will come later. **18:29**. **It's over!** **18:27**. Announcement: two minutes to the end of the contest. It should have 5 though. **18:10**. It's a fun competition, so there are two guys entertaining competitors and spectators: ![ ](http://ivanromanov.ch/img/bayan/DSC04463.JPG) **18:04**. Every couple of minutes one of the baloons exploid, making a person next to it jumping up. **17:54**. Only the first submission will count. There are 15 problems. Competitors hope that the problems are not harder than in the main round. ...
count. There are 15 problems. Competitors hope that the problems are not harder than in the mainround

Full text and comments »

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

340.
By lperovskaya, history, 10 years ago, translation, In English
Three Subregionals Cup 2016 We gladly invite you to participate in the [Three Subregionals Cup 2016](http://contest.yandex.com/QF2016/ "") – a team-based online programming competition parallel to the ACM ICPC Subregionals in Moscow, Minsk and St. Petersburg. The tournament will be organized by the team of Yandex.Contest and the jury of the Subregionals. The online rounds will be held on the Yandex.Contest system. Each online contest will be available for solving for *three days* starting the day of the QF. Start times are: Moscow – [October 16, 12:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Moscow+QF&iso=20161016T1200&p1=166 ""), Saint Petersburg – [October 22, 13:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Northern+QF&iso=20161022T1300&p1=166 ""), Minsk – [November 03, 18:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Western+QF&iso=20161103T1800&p1=166 ""). Teams that participate in the onsite version of one of the three quarterfinals will ...
=Moscow+QF&iso=20161016T1200&p1=166 ""), Saint Petersburg – [October 22, 13:00 MSK](http

Full text and comments »

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

341.
By lperovskaya, history, 9 years ago, In English
Three Subregionals Cup 2017 We gladly invite you to participate in the [Three Subregionals Cup 2017](http://contest.yandex.com/QF2017/ "") – a team-based online programming competition parallel to the ACM ICPC Subregionals in Moscow, Minsk and St. Petersburg. The tournament will be organized by the team of Yandex.Contest and the jury of the Subregionals. The online rounds will be held on the Yandex.Contest system. Each online contest will be available for solving for *three days* starting the day of the QF. Start times are: Moscow – [October 22, 12:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Moscow+QF&iso=20171022T1200&p1=166 ""), Minsk – [November 2, 11:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Western+QF&iso=20171102T1100&p1=166 ""), Saint Petersburg – [November 4, 13:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Northern+QF&iso=20171104T1300&p1=166 ""). Teams that participate in the onsite version of one of the three quarterfinals ...
– [November 4, 13:00 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Northern+QF&iso

Full text and comments »

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

342.
By Xellos, 13 years ago, In English
Codeforces Trainings Season 1 Episode 10: Editorial #### **Welcome to The Editorial!** <img src="http://th04.deviantart.net/fs70/PRE/f/2013/078/b/f/mi_super_saiyan_god_remasterizado_by_salvamakoto-d5ymxyi.png" height="50%" width="50%" /> **Keep the upvotes piling up! muhehe** IZ.COMPLETE. ### A. Rasheda And The Zeriba [cut] $\ $ (difficulty: medium) The first question is: When is it possible to construct a (convex) polygon from sticks of given lengths $L_i$? This question is answered by what's sometimes known as Polygon inequality theorem, which states that the sufficient and necessary condition is for every $L_i$ to be strictly less than the sum of all other $L_i$. You can imagine that it works because for the endpoints of every side, the shortest path between them (equal to the length of that side) must be smaller than any other path, including the other one along the perimeter of the polygon; constructing such a polygon, even a convex one, is pretty easy, just imagine it as having sticks linked to each other that...
consider $R \le S_L$, this approach has time complexity (per test case) $O(N\log{S_L})=O(N\log{N}+N\log

Full text and comments »

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

343.
By balakrishnan, history, 14 months ago, In English
Solving a 4000 rated Number Theory Problem Without Terence Tao–Level Math This is about [the problem](https://codeforces.me/contest/2147/problem/G) that drew controversy in a recent Div. 1 round because it had more accepted solutions than Problem F. That was surprising since G was rated 4000+, while F was intended to be much easier. This solution path is not a polished textbook derivation. Instead, it is a poor man’s, non-mathematician programmer’s way: brute force small cases, notice patterns in the resulting fractions, and then reverse-engineer a clean formula. ### Problem in simple terms You are given an integer m. For each number x, define a sequence like this: - Start with b(0) = 1 - Then repeatedly compute b(i+1) = x ^ b(i) % m We call x "good" if this sequence eventually becomes 1 and then stays 1 forever. The question: what fraction of all positive integers x are good? (That fraction is called the density of good x.) #### Step 1: Start by brute forcing small primes Begin with a small prime modulus p. For each x = 1, 2, … up ...
a recent Div. 1 round because it had more accepted solutions than Problem F. That was surprising

Full text and comments »

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

344.
By crazyilian, 6 years ago, translation, In English
Codeforces Round #645 (Div. 2) Editorial This is our first contest for the three of us ([user:Alexdat2000,2020-05-25], [user:ilian04,2020-05-25], [user:Sevlll,2020-05-25]), so we would like to share our impressions of creating this contest. Check it if you want to! <spoiler summary="ROUND LOG"> First problem &mdash; task rejections. [user:300iq,2020-05-25] rejected about 13 problems, 6 of which were supposed to be problem D. In the end, we came up with E, and the old E moved to D. These are the verdicts with which the problems were rejected: 1. The idea is very simple here and the implementation is very simple too, this problem is definitely not D1C-D and definitely not interesting. 2. Not an interesting problem, too standard, without new ideas. 3. This is a known problem which is solved quite simply by a compressed tree. 4. Unfortunately, it seems to me that this problem does not fit D1B. It is a funny construct but it is too technical (not interesting enough) for this position and too simple for the nex...
Codeforces Round #645 (Div. 2) Editorial, . Check it if you want to! First problem — task rejections

Full text and comments »

  • Vote: I like it
  • -168
  • Vote: I do not like it

345.
By tokitsukaze, 7 years ago, In English
Codeforces Round #573 Editorial [problem:1191A] Idea: [user:tokitsukaze,2019-02-01] <spoiler summary="Tutorial"> Just enumerating the increment can pass. However, by increasing at most $2$ points, the value of her HP can always become an odd number, and thus the highest possible level is either $A$ or $B$. We can just solve case by case. </spoiler> <spoiler summary="Solution (by Claris)"> ~~~~~ #include<cstdio> int x,i,A;char B; char cal(int x){ x%=4; if(x==0)return 'D'; if(x==1)return 'A'; if(x==2)return 'C'; return 'B'; } int main(){ scanf("%d",&x); A=0; B=cal(x); for(i=1;i<=2;i++){ if(cal(x+i)<B){ A=i; B=cal(x+i); } } printf("%d %c",A,B); } ~~~~~ </spoiler> <spoiler summary="Solution (by tokitsukaze)"> ~~~~~ #include <bits/stdc++.h> using namespace std; int main() { int x; cin>>x; if(x%4==0) puts("1 A"); else if(x%4==1) puts("0 A"); else if(x%4==2) puts("1 B"); else if(x%4==3) puts("2 A"); return 0; } ~~~~~ </s...
Codeforces Round #573 Editorial, can use *Pollard's Rho Algorithm* with *Miller-Rabin Primality Test*. By *Birthday Paradox*, which is

Full text and comments »

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

346.
By JuanPabloAmezcua, history, 2 years ago, In English
Codeforces Round 978 (Div 2) Editorial Hola Codeforces community! Sorry for the delay, we were solving some details of our national contest. We hope you enjoyed and learned a lot from this contest, we made it with much love. Our team worked day and night these last days to make sure you had a valuable experience :)). If you have any doubts about the editorial, please let us know in the comments, we are happy to help you. The editorial was prepared by [user:jampm,2024-10-15] and me. Btw, [best meme of the round](https://codeforces.me/blog/entry/134997#comment-1208155). ## [problem:2022A] <spoiler summary="Step 1"> The key to maximizing happiness is to seat family members together as much as possible. If two members of the same family sit in the same row, both will be happy, and we only use two seats. However, if they are seated separately, only one person is happy, but two seats are still used. Therefore, we prioritize seating family pairs together first. </spoiler> <spoiler summary="Step 2"> Once all poss...
Codeforces Round 978 (Div 2) Editorial, was prepared by [user:jampm,2024-10-15] and me. Btw, [best meme of the round ](https

Full text and comments »

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

347.
By Topcoder_Updates, history, 5 years ago, In English
Topcoder Open 2021 Algorithm Finals The Topcoder Open Algorithm Finals will be held tomorrow Friday 19.11.2021 at 11:00 &mdash; 13:30 UTC-5 (Click [here](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20211119T110000&p1=3919) to check your local time). The competitors for this round are [ecnerwal](https://www.topcoder.com/members/ecnerwal), [tourist](https://www.topcoder.com/members/tourist), [Um_nik](https://www.topcoder.com/members/Um_nik), [ACRush](https://www.topcoder.com/members/ACRush), [SpyCheese](https://www.topcoder.com/members/SpyCheese), [neal_wu](https://www.topcoder.com/members/neal_wu), [Heltion](https://www.topcoder.com/members/Heltion) and [Petr](https://www.topcoder.com/members/Petr). The round will be streamed live on [Youtube](https://www.youtube.com/c/TopcoderOfficial/featured), [Twitch](https://www.twitch.tv/topcoder_official), and on the [Topcoder home page](https://www.topcoder.com/home). You can also join the live discussion on the [Welcome platform](https://app.experiencewelcome....
The Topcoder Open Algorithm Finals will be held tomorrow Friday 19.11.2021 at 11:00 —13:30

Full text and comments »

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

348.
By yuyue, history, 6 years ago, In English
A Confusing problem about F Magnets from Global Round 13 I came up with almost the same idea as the editorial . The only difference is that I queried $i$ and $i+1,i+2,...,n$ to find a magnet (I think it will be either the first or the second of them),instead of $i$ and $1,2,3,...,i-1$.And then I used the same approach just as the editorial says. However,I got TLE on test 6. qwq Today,I did a binary search on test 6.I get the test case that made me TLE, but it passed when I tested it locally. I do wonder why it goes wrong. You check my submission here [submission:108735158]
A Confusing problem about F Magnets from Global Round 13, However,I got TLE on test 6. qwq, Today,I did a binary search on test 6.I get the test case that made me TLE, but it passed when I

Full text and comments »

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

349.
By nitesh_gupta, 8 years ago, In English
Invitation to HackerEarth's May Easy '19 Hello Everyone! I would like to invite you to participate in [HackerEarth's May Easy '19](https://www.hackerearth.com/challenges/competitive/may-easy-19/). It will be held on [Monday, May 13 at 9:30 PM &mdash; IST](https://www.timeanddate.com/worldclock/fixedtime.html?msg=HackerEarth+May+Easy+%2719&iso=20190513T2130&p1=438&ah=3). I ([user:nitesh_gupta,2019-04-07]), [user:nir123,2019-04-07] and [user:Arpa,2019-05-07] are the setters of this round and [user:Arpa,2019-04-07] and [user:ParsaA,2019-05-07] are the testers of problems. You will be given **6** algorithmic questions to solve in **3 hours**. Partial scoring will be used (you get points for passing each test case). Although the contest is targeted towards beginners, we hope that everyone finds the tasks interesting. The contest is rated for all and the prizes will be awarded to the **top 3 beginners** (i.e. programmers with a rating of 1600 or less before the challenge starts): - First place: $75 Amazon gift card. ...
://www.hackerearth.com/challenges/competitive/may-easy-19/). It will be held on [Monday, May13 at 9

Full text and comments »

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

350.
By .o., 12 years ago, In English
Good Bye 2014 Editorial First of all, sorry for the late editorial. I was too exhausted and immediately went to bed after the round finished, and didn't write the editorial. There are many pictures in this editorial, to cover up my poor English skills! If you have detected any errors or have questions, feel free to ask questions by comments. Unfortunately, the authors only know English, so we can't answer you if you write comments in Russian. ## [problem:500A] Let's assume that I am in the cell $i$ ($1 \le i \le n$). If $i \le n-1$, I have two choices: to stay at cell $i$, or to go to cell $(i + a_{i})$. If $i = t$, we are at the target cell, so I should print "YES" and terminate. If $i > t$, I cannot go to cell $t$ because I can't use the portal backwards, so one should print "NO" and terminate. Otherwise, I must go to cell $(i + a_{i})$. Using this method, I visit each cell at most once, and there are $n$ cells, so the problem can be solved in linear time. #### What is test 13? There are 9...
there are $n$ cells, so the problem can be solved in linear time. #### What is test 13? There are

Full text and comments »

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

351.
By Harbour.Space, 5 years ago, translation, In English
Harbour.Space Scholarship Contest 2021-2022 (Div. 1 + Div. 2) <img alt="Codeforces and Harbour.Space" src="https://codeforces.me/predownloaded/d7/d0/d7d08f55e940d3b13f74ba80b556ce95b5cc1837.png" style="float:right;height: 150px; margin: 10px; max-width:50%;"/> Hey, Codeforces! We have great news for you. Harbour.Space University is excited to announce **a new contest for all interested programmers** who want to start their studies in Barcelona, Spain or Bangkok, Thailand, and join our ICPC team. The contest will be hosted on the Codeforces platform [contest_time:1553]. We have prepared 9 problems of the joined (Div1 + Div2) level. The round will be **rated and open for everyone.** UPD: Scoring distribution: 250-500-750-1250-1750-2500-3000-3750-5250 UPD2: The [editorial](https://codeforces.me/blog/entry/93105) is out! <center style="margin:2.5em;"> <a href="https://codeforces.me/contests/1553" style="text-decoration:none; font-size:16px; background-color:#685dc5; color:white; font-weight:bold; padding:0.5em 1em;">Sign up ...
round will be **rated and open for everyone.** UPD: Scoring distribution: 250-500-750-1250-1750-2500

Full text and comments »

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

352.
By sillycross, 15 years ago, In English
A bug about hacking I think I found a bug about hacking. I did 2 successful hacks during Codeforces Round #115, but after contest it showed there's only one hack. The other one is 'ignored'. But I think it should be a successful hack. My hack: **38336 Apr 14, 2012 1:25:35 PM sillycross Skyly A --- Robot Bicorn Attack Ignored** The victim's submission history: **00:13:50 Accepted [pretests] → 1532327** **01:39:54 Accepted [final tests] → 1535677** And submission 1532327's status **By Skyly, contest: Codeforces Round #115, problem: (A) Robot Bicorn Attack, Hacked, #** Obviously the submission done in 00:13:50 was hacked by me ( I'm the only one who hacked this solution ) . But the hack was ignored. I think it was caused by my another hack using the same input. **38343 Apr 14, 2012 1:30:08 PM sillycross helThazar A --- Robot Bicorn Attack Successful hacking attempt** I knew that the codeforces judge would ignore same hacking inputs and only keep the last o...
I think I found a bug about hacking. I did 2 successful hacks during Codeforces Round #115, but

Full text and comments »

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

353.
By ch_egor, 6 years ago, translation, In English
Codeforces Round #707 (Div.1, Div.2, based on Moscow Open Olympiad in Informatics, rated) Hello! Right now happens the first tour of the Open Olympiad in Informatics, and tomorrow will be the second one. This contest is prepared by Moscow Olympiad Scientific Committee that you may know by Moscow Team Olympiad, Moscow Olympiad for Young Students and Metropolises Olympiad (rounds <a href="https://codeforces.me/blog/entry/21185">327</a>, <a href="https://codeforces.me/blog/entry/23309">342</a>, <a href="https://codeforces.me/blog/entry/43615">345</a>, <a href="https://codeforces.me/blog/entry/47769">376</a>, <a href="https://codeforces.me/blog/entry/50613">401</a>, <a href="https://codeforces.me/blog/entry/54350">433</a>, <a href="https://codeforces.me/blog/entry/55201">441</a>, <a href="https://codeforces.me/blog/entry/57981">466</a>, <a href="https://codeforces.me/blog/entry/58229">469</a>, <a href="https://codeforces.me/blog/entry/61638">507</a>, <a href="https://codeforces.me/blog/entry/62440">516</a>, <a href="https://codeforces.me/blog/entry/65433">541</a...
Codeforces Round #707 (Div.1, Div.2, based on Moscow Open Olympiad in Informatics, rated), round based on it, which will happen on [contest_time:1500] and will be based on **both** days of

Full text and comments »

  • Vote: I like it
  • -695
  • Vote: I do not like it

354.
By ssvb, 5 years ago, In English
$O(N^2)$ solution to Facebook Hacker Cup 2021 Round 1 problem A2 (part one) Right after the end of Facebook Hacker Cup 2021 Round 1, [user:wjomlex,2021-09-25] posted the following [comment](https://codeforces.me/blog/entry/94726?#comment-839269) in the discussion section under the announcement blog: > A common issue was people writing O(N^2) solutions to problem A when O(N) solutions are necessary. You won't be able to run an O(N^2) solution in 6 minutes when N = 800,000. But is this really true? Challenge accepted! ##### Problem A1 <div> <spoiler summary="Spoiler"> First of all, here is an $O(N)$ solution for [problem A1](https://www.facebook.com/codingcompetitions/hacker-cup/2021/round-1/problems/A1): <spoiler summary="Spoiler"> ~~~~~ #include <iostream> #include <vector> #include <stdint.h> using namespace std; /* * This is a solution for problem A1. Time complexity: O(N) * Characters in the input buffer are remapped: 'F' => 0, 'X' => 1, 'O' => 2 */ static int32_t solve_a1(const int8_t *arr, int n) { int32_t ans = 0, h...
$O(N^2)$ solution to Facebook Hacker Cup 2021 Round 1 problem A2 (part one), Right after the end of Facebook Hacker Cup 2021 Round 1, [user:wjomlex,2021-09-25] posted the

Full text and comments »

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

355.
By DoomzGay, history, 8 years ago, translation, In English
Holy geez, GreenGrape, please... Good evening, codefroces! I'd like to spread this topic (for a while it was only in russian), to engage more users to this problem. Well, i'm quite lying, not so much good in this evening. Why? I think, you already know the main idea. Yea, it's another round from [user:GreenGrape,2018-08-19]! It all started on a carefree Sunday morning. Nothing signs a trouble for me. In a long waiting of evening rated contest I was watching past 'The International' matches (Winstrike versus IG to be more precise), when i had got a PM message: "Hey, today is a GreenGrape round!". With trembling hands i typed codeforces.com in the address bar, and saw [contest:1025] announcement. Yeah, exactly he is. With a spoiled mood and not so enthusiastically you're still waiting for a contest, which will bring you only more pain and another portion of disappointment... Let's finish with a lyrical part, and start more constructive analysis. At the beginning i'd like to say, that i have nothing against ...
? I think, you already know the main idea. Yea, it's another round from [user:GreenGrape,2018-08-19

Full text and comments »

  • Vote: I like it
  • -132
  • Vote: I do not like it

356.
By godjersavestheworld, 11 years ago, In English
Problem with AIM Tech Round (Div. 2) A's Jury Solution Hi everyone, Although I ranked 4th in the round, I found out that the jury's output has too few decimal places that it would REJECT contestants' output even if it has less than 10^-6 absolute error. Please see this submission: [submission:15819369] Test 13: ``` Expected: 0.60590128755364806866952789699571 Jury: 0.605901 Mine: 0.6059020876 ``` Edit: they have fixed the solution
Problem with AIM Tech Round (Div. 2) A's Jury Solution, Test 13:

Full text and comments »

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

357.
By Michael, 13 years ago, In English
Yandex.Algorithm Online Round 1 Analysis In the first online round of Yandex.Algorithm competition 609 participants submitted at least one solution and 396 submitted at least one correct solution. Problems _Non-Squares_ and _Kingdom Division_ were fairly easy, both resulted in approximately 300 correct submissions. Problem _Stacks of Coins_ was moderately easy and was solved by 145 participants. The three other problems proved to be more difficult. _Stickers_ could be a very challenging string problem, but small input size allowed for dynamic programming solution, which 22 contestants got right. _Assistants_ was solved by 13 participants; it required binary search, greedy, and some basic data structures to get it under time limit.During the contest, nobody was able to solve _State Roads_, which was a neat graph-theoretical problem with a simple to code, but a quite tricky solution. Congratulations to [user:Kenny_HORROR,2013-07-15] who was the only one to solve five problems, and to [user:Petr,2013-07-15], [user:tourist,20...
Yandex.Algorithm Online Round 1 Analysis, In the first online round of Yandex.Algorithm competition 609 participants submitted at least one

Full text and comments »

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