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.
Congratulations: Tourist has reached a rating of 4000!
By MikeMirzayanov, history, 2 years ago, In English
Congratulations: Tourist has reached a rating of 4000! Hello, As you may have already noticed, [user:tourist,2024-08-31] has reached the symbolic milestone of 4000 rating points. This is the first time in the history of competitive programming. I, personally, and the entire Codeforces team, congratulate Gennady [user:tourist,2024-08-31] Korotkevich on this incredible achievement! Right now, we have assigned a new rank “Tourist” to the 4+ rating. This highlights the uniqueness of the moment! However, in the future, I would like to change this name to something a bit more neutral (or leave it Tourist?). Would you help me with this? I’d appreciate your cool suggestions in the comments! Here are a few options from me. Please, vote: - Epic Grandmaster - Ultimate Grandmaster - Godlike Grandmaster - Tourist - 4K Grandmaster - Grandmaster 4K - Legendary Grandmaster 4K - Joke option: Ultra HD Grandmaster - from [user:Tlatoani,2024-08-30]: Champ...
] - Tourist - 4K Grandmaster - Grandmaster 4K - Legendary Grandmaster

Full text and comments »

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

2.
Codeforces Round #712
By Monogon, history, 5 years ago, In English
Codeforces Round #712 omg hi! I am pleased to invite you to participate in [contest:1503] and [contest:1504]! You will be given **6 problems** and **2 hours 15 minutes** to solve them. I'm happy to announce the theme of this round is déjà vu! I would like to thank the following people: - <a class="rated-user user-red" href="https://images.emojiterra.com/twitter/512px/1f921.png" title="The Entire Circus">antontrygubO_o</a> for accepting all of my problems <span style="color:white;">at gunpoint</span> - <a class="rated-user user-orange" href="/profile/Nika_Tamliani" title="Useless Tester Nika_Tamliani">Nika_Tamliani</a>, <a class="rated-user user-violet" href="/profile/arvindr9" title="Useless Tester arvindr9">arvindr9</a>, <a class="rated-user user-red" href="/profile/dorijanlendvaj" title="Useful Tester dorijanlendvaj">dorijanlendvaj</a>, <a class="rated-user user-blue" href="/profile/I_Love_YrNameCouldBeHere" title="Useful Tester I_Love_YrNameCouldBeHere">I_Love_YrNameCouldBeHere</a>, <a class="r...
Tester nor">nor,

Full text and comments »

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

3.
Hello 2024
By maomao90, history, 3 years ago, In English
Hello 2024 Hello Codeforces, We are very glad to invite you to participate in [contest:1919], which will start on [contest_time:1919]. You will be given **8 problems** and **2.5 hours** to solve them. One of the problems will be divided into two subtasks. The round will be rated for everyone. There will be at most 2024 interactive problems, so please read the [guide for interactive problems](https://codeforces.me/blog/entry/45307) before the contest. All the problems are written and prepared by me. <spoiler summary="Spoiler"> The first tester tested on 10 October **2022**. </spoiler> We would like to give our sincere thanks to: - [user:errorgorn,2024-01-02] for his wonderful coordination! - [user:Alexdat2000,2024-01-02] for translating problem statements. - [user:dario2994,2024-01-02] for coming up with the solution to one of the problems. - [user:conqueror_of_tourist,2024-01-02], [user:iLoveIOI,2024-01-02], [user:Um_nik,2024-01-02], [user:oolimry,2024-01-02], [user:thenymphs...
-11-22] for the great codeforces and polygon platform. - , . - You <https://codeforces.me/profile/> for participating

Full text and comments »

Announcement of Hello 2024
  • Vote: I like it
  • +2422
  • Vote: I do not like it

4.
Codeforces Round #736
By Agnimandur, 5 years ago, In English
Codeforces Round #736 Hello, Westeros! I'm glad to invite you to [contest:1548] and [contest:1549], which will be held on [contest_time:1548]. The round will be rated for both divisions. Each division will have 5-7 problems and 2 hours and 15 minutes to solve them. There **will not** be an interactive problem, so yay!!! This round would not have been possible without the following individuals: 1. [user:Aleks5d,2021-07-30], for awesome coordination of my round. 2. [user:Benq,2021-07-30], for extensive testing and contributions throughout the round, especially for [problem:1548E]. 3. [user:1-gon,2021-07-30], for discussing problems and statements with me for hours on Discord. 4. [user:amgfrthsp,2021-08-01], for translating statements into Russian. 5. [user:MikeMirzayanov,2021-08-01], for Codeforces and Polygon. #### 32 testers The round had a total of 32 testers. I tried to get a "rainbow" of testers to help guarantee a most balanced round. Thank to you to each and every one of them! - ...
definitely reaching the rank of Legendary Grandmaster!

Full text and comments »

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

5.
Multiple accounts for one person should be banned
By dotorya, history, 8 years ago, In English
Multiple accounts for one person should be banned Recently, There seems to be so many multiple accounts among various rating ranges. In top 10, there is [user:CongLingDanPaiShang3k5,2018-10-14], who became Legendary Grandmaster in 2 months. He should be a great genius, right? There is better hypothesis: He is someone's smurfing account. Everybody knows that [user:jiry_2,2018-10-14] = [user:Syloviaely,2018-10-14]. He performed quite a long ago, but it's the fact that he has multiple accounts, both having 2900+ ratings. In Div2 contests, many black-colored people are at top of the scoreboards. Why there are always a lot of talented newcomers? You will know the reason. Why don't Codeforces ban those multiple accounts? They ruins contest scoreboard and rating system. For example, [user:CongLingDanPaiShang3k5,2018-10-14] "absorbed" other participants rating for about 5-6 contests to be Legendary Grandmaster. On those contest's scoreboard, there were always him on top pages. One account for one person. That was the rule. Sm...
5-6 contests to be Legendary Grandmaster. On those contest's scoreboard, there were always him on, , there is [user:CongLingDanPaiShang3k5,2018-10-14], who became Legendary Grandmaster in 2 months. He, In top 10, there is [user:CongLingDanPaiShang3k5,2018-10-14], who became Legendary Grandmaster in 2

Full text and comments »

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

6.
Codeforces Round 872 (Div. 1 & 2)
By RedLycoris, history, 3 years ago, In English
Codeforces Round 872 (Div. 1 & 2) Hello Codeforces! （你好，代码部队） We are glad to invite you to participate in [contest:1824] and [contest:1825] on [contest_time:1824]. **Please note the unusual start time.** This round is rated for **all the participants**. You will be given 5 problems (one of which is divided into two subtasks) and 2 hours to solve them in each division. Assume you are [user:YuezhengLing,2023-04-30], and in this round, your best friend [user:luotianyi,2023-04-23] will give you several problems to solve. ![ ](https://cdn.luogu.com.cn/upload/image_hosting/6xkxdj7x.png) ([user:luotianyi,2023-04-23] is the left one and [user:yuezhengling,2023-04-30] is the right one) We would like to thank: 1. [user:RedLycoris,2023-04-22], [user:CrTsIr,2023-04-22], [user:Gyy_cj,2023-04-22], [user:SanweiTreap,2023-04-22] and [user:Gezhiyuan,2023-02-06] for writing the problems. 2. [user:Artyom123,2023-04-22] for coordinating the round. 3. [user:MikeMirzayanov,2023-05-06] for great Codeforces and Pol...
,2023-05-02] for gray testing the round. 11. [ You ](/profile, -legendary">You

Full text and comments »

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

7.
Codeforces Round 1000 (Div. 2)
By chromate00, 20 months ago, In English
Codeforces Round 1000 (Div. 2) Hello Codeforces, and the legends of across $999$ and more rounds! ------------------------------------------------------------------ --- [user:wuhudsm,2024-12-25], [user:Yugandhar_Master,2025-01-15], and I are *beyond excited* to invite you to [contest:2063] at [contest_time:2063]. <b style="color:red;">Please note the unusual time of the round ($\color{red}{2.5}$ hours before the usual time)!</b> The contest contains $6$ carefully crafted tasks, one of them divided into two subtasks, to be solved in $2$ hours. You will solve tasks themed around Little John and his shenanigans aimed towards getting his own dream home (featuring, probably, galvanized square steel). This round could not exist without the thankful help of these so many people: - ~FairyWinx,2025-01-15 for <strike>rejecting more tasks than are used in the final problemset,</strike> coordinating the round and translating the problems; - ~rewhile,2025-01-15 for some very important "technical assistance"; - ...
the problemset; - [user:antontrygubO_o,2025-01-21] for , ; - [user:antontrygubO_o,2025-01-21] for nutella <> testing, In that sense, I want

Full text and comments »

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

8.
CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!)
By maomao90, history, 3 years ago, In English
CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!) Hello Codeforces, We are very glad to invite you to participate in [contest:1896], which will start on [contest_time:1896]. You will be given **8 problems** and **2.5 hours** to solve them. The round will be rated for everyone. All the problems are written and prepared by [user:lanhf,2023-11-22], [user:Mike4235,2023-11-22], [user:thenymphsofdelphi,2023-11-22], [user:xuanquang1999,2023-11-22] and me. We would like to give our sincere thanks to: - [user:errorgorn,2023-11-22] for his wonderful coordination! - [user:Alexdat2000,2023-11-22] for translating problem statements. - [user:Um_nik,2023-11-22] and [user:conqueror_of_tourist,2023-11-22] for Legendary Grandmaster testing. - [user:jeroenodb,2023-11-22], [user:Kuroni,2023-11-22], [user:dario2994,2023-11-22] and [user:dreamoon_love_AA,2023-11-22] for International Grandmaster testing. - [user:generic_placeholder_name,2023-11-22], [user:MofK,2023-11-22], [user:minhcool,2023-11-22], [user:dvdg6566,2023-11-22] and [user:mag...
-22] for Legendary Grandmaster testing. - [user:jeroenodb,2023-11-22], [user:Kuroni,2023-11-22, . - [user:Um_nik,2023-11-22] and [user:conqueror_of_tourist,2023-11-22] for Legendary Grandmaster testing

Full text and comments »

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

9.
How to use Codeforces [GUIDE]
By SlavicG, 5 years ago, In English
How to use Codeforces [GUIDE] I see a lot of newcomers struggling to use the website to it's fullest, so I decided to write a blog that has all important information about how to use Codeforces in a single place. I will update it with time, so feel free to write your suggestions/questions in case I missed something and I will be glad to add it to the post! I would like to thank [user:_Vanilla_,2022-02-05] and [user:mesanu,2022-02-05] for helping me write the blog, and [user:Monogon,2022-02-05], [user:down,2022-02-05] and [user:AlperenT,2022-02-05] for proofreading and giving suggestions. #### Navigating through pages ![ ](https://media.discordapp.net/attachments/705371983650619454/928235498487570442/bandicam_2022-01-05_12-36-00-134.jpg?width=991&height=110) It's possible to navigate through most pages of Codeforces using the bar on the top, I will talk about what each tab does more in depth below: #### The Help Page The help page contains the answer to a lot of questions about Codeforces, such as rati...
red — international grandmaster ([2600, 2999] rating) - black-red — legendary

Full text and comments »

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

10.
How LEGENDARY programmers solve the A + B problem
By PurpleThinker, 5 years ago, In English
How LEGENDARY programmers solve the A + B problem Hello, Codeforces! For many of us, the A + B problem was the first one we've solved and we think of it as just a really easy problem. But what if I told you there is a way to flex your programming skills by solving this problem _with style_? On this wonderful day of March 32nd, I will present a few ways to solve this interesting problem. I will only consider `a` and `b` strictly larger than `0`. Noob approach ================== ~~~~~ std::cout << a + b; ~~~~~ Almost-noob approach ================== Notice that we can interpret a + b as a incrementing a number `a` times, then `b` times. We get: ~~~~~ int ans = 0; for (int i = 1; i <= a; i++) ans++; for (int i = 1; i <= b; i++) ans++; std::cout << ans; ~~~~~ Slightly clever approach ================== Of course, we cannot stop there. A wise man once said: "every competitive programming problem is a dynamic programming problem if you try hard enough". So... let's be a little bit more imaginative! We define `dp[i][...
How LEGENDARY programmers solve the A + B problem, to solve this problem. What separates good programmers from LEGENDARY programmers, ++, Python and Java and use a simplist language, like Brainfuck. Legendary programmers already use this, What separates good programmers from LEGENDARY programmers ==================

Full text and comments »

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

11.
Codeforces Round 899 (Div. 2)
By windva, history, 3 years ago, In English
Codeforces Round 899 (Div. 2) Hello, Codeforces! I am pleased to invite you to participate in [contest:1882], which will be held on [contest_time:1882]. All problems were written and prepared by me. You will be given **5 problems, and one of them is divided into two subtasks**. You will have **2 hours** to solve them. I would like to thank: - [user:irkstepanov,2023-09-21] for excellent coordination and Russian translation! - [user:Golovanov399,2023-09-21] for providing useful feedbacks. - [user:kizen,2023-09-21] for helping me much with one problem of the contest. - [user:ko_osaga,2023-09-21] for Nutella testing. - [user:leinad2,2023-09-21], [user:Numbering,2023-09-21], [user:qwerasdfzxcl,2023-09-21], [user:kizen,2023-09-21], [user:Golovanov399,2023-09-21] for Red testing. - [user:Kaling,2023-09-21], [user:Mingyu331,2023-09-21], [user:chaeyihwan,2023-09-21], [user:Kawaii2DIdolOfGSHS,2023-09-21], [user:azberjibiou,2023-09-21], [user:mjhmjh1104,2023-09-21], [user:DELTARUNE,2023-09-21], [...
last but not least, You <https://codeforces.me/profile/>, - And last but not least,

Full text and comments »

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

12.
Hello 2026
By wangmarui, history, 8 months ago, In English
Hello 2026 Happy new year, Codeforces! We are glad to invite you to take part in [contest:2183], which will start on [contest_time:2183]. You will be given **9 problems** and **3 hours** to solve them. **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. This round is open and rated for everyone. Problems are authored by [user:wangmarui,2025-12-23], [user:Gold14526,2025-12-23], [user:Hoks_,2025-12-23], [user:Neil_Qian,2025-12-23], [user:Network_Error,2025-12-23], [user:jiazhichen844,2025-12-23] and [user:xvchongyv,2025-12-23]. We would like to thank: - [user:Um_Nik,2025-12-23] for pre-reviewing the round. - [user:Proof_by_QED,2025-12-23] for his wonderful coordination. - [user:Alexdat2000,2025-12-23] for Russian translation. - [user:Geothermal,2025-12-23], [user:StarSilk,2025-12-23], and [user:Dominater069,2025-12-23] for nutella testing. - [user:Mindeve...
Codeforces and Polygon platforms. -

Full text and comments »

Announcement of Hello 2026
  • Vote: I like it
  • +1039
  • Vote: I do not like it

13.
Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2)
By Intellegent, 4 months ago, In English
Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2) <center> <img src="https://i.imgur.com/lPGWfOR.png" style="width: 300.0px;max-width: 100.0%;max-height: 100.0%;"></center> <center> <h1> Greetings Codeforces! </h1> </center> [user:sammyuri,2026-05-18], [user:myst-6,2026-05-18] and I are absolutely chuffed to bits to invite you all to have a go at Codeforces Round ${12}_{10}$ ([contest:2229]), kicking off at [contest_time:2229]. There will be **9** absolute cinema problems for you to solve over the course of **3 hours**, some problems will have multiple parts. This round will be combined for Division 1 and Division 2 and will be rated for everyone. I’d like to raise a glass to the following brilliant minds for making this whole thing possible: - [user:dominater069,2026-05-18] for splendid coordination. - [user:um_nik,2026-05-18] for preliminary review. - The fine assembly of testers: [user:arvindf232,2026-05-18], [user:evenimage,2026-05-18], [user:geothermal,2026-05-18], [user:sana,2026-05-18], [user:wansur,20...
Codeforces and Polygon. - , class="rated-user user-legendary" href="https://codeforces.me/profile/" style="background-position

Full text and comments »

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

14.
Thanks to Codeforces - An OIer's Narration
By cz_xuyixuan, history, 7 years ago, In English
Thanks to Codeforces - An OIer's Narration Hello there, I'm a senior high school student from China. For a long time, I've been devoting my life to Olympiad in Informatics. I’ve made progress all along the way with a few partners. But after the entrance of university was granted, they quitted OI, one after another, while I kept going, hoping to take part in IOI, which is definitely not easy in China. This has kept me wondering, “What if I fail?” “What if all the efforts of me turn out to be meaningless?” From time to time, I suffer from such thoughts in agony, but luckily, I haven’t given up. Yesterday, I became a Legendary Grandmaster on Codeforces, which has been a wild dream of mine since I knew the website. Thanks to Codeforces, this appellation exhilarates me so much that I suddenly find my efforts did count, they are at least recognized here. Perhaps, because of this, I won’t feel that bad even if I fail in the upcoming selections to IOI. And thanks for reading this mess in me. Hope you all make your life **L...
suffer from such thoughts in agony, but luckily, I haven’t given up. Yesterday, I became aLegendary, And thanks for reading this mess in me. Hope you all make your life **Legendary ** as well., Yesterday, I became a Legendary Grandmaster on Codeforces, which has been a wild dream of mine

Full text and comments »

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

15.
Codeforces Round 929 (Div. 3)
By erniepsycholone, 3 years ago, In English
Codeforces Round 929 (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, Codeforces! We are proud to present [contest:1933], and we hereby invite all of you to take part in it. This round will start on [contest_time:1933]. You will have **2 hours and 15 minutes** to solve **7 problems**. The **penalty** for a wrong submission is equal to **10 minutes**. This round will be rated for participants with ratings lower than 1600. However, all of you who wish to take part and have a rating of 1600 or higher, are welcome to 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. Remember that only the trusted participants of the third division will be included in the official standings table. As stated in [this blog](https://codeforce...
- [user:arvindf232,2024-02-25] for Legendary Grandmaster testing;, ] for Legendary Grandmaster testing; - [user:step_by_step,2024-02-25] for International Grandmaster

Full text and comments »

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

16.
Codeforces Round #873 (Div. 1 & 2)
By Mike4235, 3 years ago, In English
Codeforces Round #873 (Div. 1 & 2) Hello, Codeforces! [user:thenymphsofdelphi,2023-05-09], [user:lanhf,2023-05-09], and I are delighted to invite you to take part in [contest:1827] and [contest:1828] which are going to take place at [contest_time:1827]. Participants with a rating lower than 1900 will participate in Division $2$, while participants with a rating of at least 1900 will participate in Division $1$. In both divisions, you will be given **2 hours** to solve **6 problems** (one of which is divided into two subtasks), all of which were authored and prepared by me, [user:lanhf,2023-05-09], and [user:thenymphsofdelphi,2023-05-09]. We would like to thank the following people who made our round possible: - [user:74TrAkToR,2023-05-09] for his great coordination and help with the problems' preparation during the last 4 months. - [user:khuepr123,2023-05-09] for doing nothing but being the mascot. - [user:A05,2023-05-09], [user:Kawaii,2023-05-09], [user:SeehEternity,2023-05-09], [user:yanglake,2023-05-09], ...
the Legendary Grandmaster title!

Full text and comments »

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

17.
Codeforces Round 911 (Div. 2)
By NemanjaSo2005, history, 3 years ago, In English
Codeforces Round 911 (Div. 2) Hello, Codeforces! [user:Riblji_Keksic,2023-11-25] and I are glad to invite you to [contest:1900], which will start on [contest_time:1900]. You will be given **6** problems and **2** hours to solve them. The round will be rated for participants of Division 2 with a rating lower than **2100**. Division 1 participants can participate unofficially. All problems are invented and prepared by [user:Riblji_Keksic,2023-11-25] and me. Special thanks go to [user:n0sk1ll,2023-11-25] and [user:TimDee,2023-11-25] for their great work during the testing process of the round. And of course, I would love to thank the people who made this round possible: - [user:pashka,2023-11-25] for his great coordination of the round! - [user:IgorI,2023-11-25] for helping host the round! - [user:Alexdat2000,2023-11-25] for helping translate the round! - [user:prvocislo,2023-11-25], [user:wxhtzdy,2022-06-02], [user:valeriu,2023-11-25], [user:satyam343,2023-11-25], [user:n0sk1ll,2023-11-25...
platforms! - You <https://codeforces.me/profile/>, - You <https://codeforces.me/profile/> for

Full text and comments »

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

18.
The Second Revolution of Colors and Titles
By MikeMirzayanov, 11 years ago, translation, In English
The Second Revolution of Colors and Titles Over the last several months the Codeforces team has been looking anxiously at the inflation in the rating caused by both an influx of new users and the imperfect calculating formulas. In the end it lead to noticeable shifts in colors and titles. For example, getting red in 2015 became much easier than in 2013. We conducted a [survey about the way to introduce the color bounds](/blog/entry/20629). We are happy to announce the updated colors and titles! A summary of the main changes goes like that: * a new color: greenish-blue color or cyan &mdash; just like the name implies, this color takes its place between green and blue, now the participants of the second division will be better differentiated; * all the colors shift upwards along the rating scale &mdash; see the table below. Now reaching the top positions will be harder; * the legendary grandmaster &mdash; the new title and color for those who reached the sky high rating 2900. The cold colors (gray, green, cyan an...
below. Now reaching the top positions will be harder; * the legendary grandmaster — the new, reaching the top positions will be harder; * the legendary grandmaster — the new title and color, ;border: 1.0px solid black;">Красный, ="legendary-user-first-letter">Red , ="legendary-user-first-letter">Красный

Full text and comments »

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

19.
What if tourist goes rainboy mode? (Simulation)
By ACGN, 5 years ago, In English
What if tourist goes rainboy mode? (Simulation) DISCLAIMER: NO TOURISTS AND RAINBOYS WERE PINGED Ah yes, two names that most people on Codeforces have heard -- <b>t<span style="color:red;">ourist</span></b> and <b><span style="color:purple;">rainboy</span></b>, one known as the CP Legend, and one as the user who does everything reverse. Such a great idea to put them together &mdash; a hypothetical user with the same ability as <b>t<span style="color:red;">ourist</span></b>, and solves problems the <b><span style="color:purple;">rainboy</span></b> way. _For those unaware of the "rainboy way", it means solving the problems in reverse order. In particular, if he cannot solve the final problem, he solves no problems in the contest._ Unfortunately, <b><span style="color:purple;">rainboy</span></b> had not yet reached red, peaking at 2398 rating. How far can this user go? We shall simulate this user through all the contests that tourist and rainboy took part in comparably, which adds up to 60 contests from [contest:745] to [cont...
-legendary">turingboy, ;">+1353092Became , turingboy <> →

Full text and comments »

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

20.
Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2)
By Amir_Parsa, 3 years ago, In English
Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Salam, Codeforces! $\color{white}{\text{ «Be attentive about your thought that becomes your behavior» «Be attentive about your behavior that becomes your speech» «Be attentive about your speech because it becomes your habit»«Be attentive about your habit because it becomes your personality»«Be attentive about your personality because it becomes your destiny» Said by: Imam Ali}}$ We're so excited to invite you to take part in our round [contest:1864] which will start on [contest_time:1864]. The round will be **rated and open for everyone**. The problems were prepared and authored by [user:amenotiomoi,2023-08-19], Dhruvil [user:Psychotic_D,2023-08-19] Kakadiya, Han [user:wuhudsm,2023-08-19] Jinlong, Amir Hossein [user:Amir_Parsa,2023-08-19] Farhadi, Matthew [user:Chromate00,2023-08-19] Roh, [user:JohnVictor,2023-08-19], [user:odt,2023-08-19], [user:ugly2333,2023-08-19], [user:lavine,2023-08-19], [user:RiverHamster,2023-08-19], [user:flowerletter,2023-08-19] and [user:Aquamoon...
[user : Heltion,2022-12-18] for LGM <> testing, -legendary">Orz , ="rated-user user-legendary">LGM testing; - [user:hibye1217,2023-08-19], [user : alireza_kaviani

Full text and comments »

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

21.
First Ever Users to Reach Some Rating Milestones
By orz, history, 4 years ago, In English
First Ever Users to Reach Some Rating Milestones Hi there! Recently after [contest:1696] [user:Um_nik,2022-06-29] [noticed](https://t.me/umnik_team_eng/2201) that he might be the ninth or tenth person to reach <b>3600</b> rating points, but still he did it earlier than [user:Petr,2022-06-29]. I wondered whether [user:Um_nik,2022-06-29] really was <i>that</i> attentive to know for sure how many people reached <b>3600</b> before him. As this is an objective truth or an objective misconception, I decided to simply check it. [cut] After several hours of programming and abusing Codeforces API I am ready to state that [user:Um_nik,2022-06-29] was indeed correct — he and [user:jiangly,2022-06-29] both broke through the <b>3600</b> mark simultaneously, being the ninth and tenth person to achieve it. I wanted to get more interesting facts from the fetched information — for example, although [user:Petr,2022-06-29]'s maximum is <b>3597</b> and he hasn't got to <b>3600</b> so far, he was the second one to get to <b>3550</b> points, and ...
-legendary">3000 [user:tourist,2012-07-12] , ="rated-user user-red">2998 3000 <>

Full text and comments »

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

22.
Codeforces Global Round 30
By Xiaohuba, 10 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...
class="rated-user user-legendary">You, ,2025-11-04] for [ LGM , ="rated-user user-legendary">LGM ](#) testing. - [user:GroupMatrix,2025-11-04

Full text and comments »

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

23.
Problems that I authored so far
By TheScrasse, history, 3 years ago, In English
Problems that I authored so far Hi everyone, after [contest:1854], maybe it's time to collect all my problems here. For now, I've mainly invented easy-ish problems. I wish to invent a very hard problem sooner or later :) <spoiler summary="Update after Pinely Round 3"> Done :D </spoiler> I'm putting the story of each problem under spoiler, because it may contain parts of the solution. I invented many problems by just trying random setups until I came up with something solvable, but some problems (especially the harder ones, for example [problem:1854D]) may have more interesting stories. Fun facts: - I struggled a lot to find a suitable div2A for [contest:1654]. I proposed a lot of problems that turned out to be unsuitable (for example, because they were too hard), then I used them somewhere else. - While I was writing this blog, I realized that [problem:1849E] is identical to my problem [preoii_allenamento \- Allenamento su ChinaForces](https://training.olinfo.it/#/task/preoii_allenamento/statement),...
variations. Later, , ="Legendary Grandmaster tourist" class="rated-user user-legendary">

Full text and comments »

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

24.
Codeforces Round #362
By PrinceOfPersia, history, 10 years ago, In English
Codeforces Round #362 &mdash; Hey, It's me again. Plain to see again... &mdash; Oh crap, it's PrinceOfPersia again :| I'm here to introduce you: Codeforces round 362. It's gonna take place on [196th day of 2016](http://timeanddate.com/worldclock/fixedtime.html?day=14&month=7&year=2016&hour=19&min=35&sec=0&p1=166). I'm the writer of this round. Not as always, there are **6** problems. I hope you enjoy. I want to thank [user:LiTi,2016-07-14] and [user:Haghani,2016-07-11] for testing this round, [user:dans,2016-07-11] and [user:GlebsHP,2016-07-11] for helping me prepare the problems and [user:MikeMirzayanov,2016-07-11] for legendary platforms of Codeforces and Polygon. The main character of this round is Barney Stinson (high five ;)) and you're gonna help him with his problem. ![ ](http://viberstickers.ru/_data/stickers/159/sticker_viber_159_00.png) I wish you all lots of Accepted solutions and hope to see no Skipped solutions ;) Scoring will be posted soon. GL & HF! **UPD:**...
[user:MikeMirzayanov,2016-07-11] for legendary platforms of Codeforces and Polygon.

Full text and comments »

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

25.
CEOI 2020 Online Mirror
By mraron, history, 6 years ago, In English
CEOI 2020 Online Mirror Hi Codeforces! The [27th Central-European Olympiad in Informatics](http://ceoi2020.inf.elte.hu/) takes place from 23-29 August in Nagykanizsa, Hungary. The mirror contests will be held on [contest_time:1402] and [contest_time:1403] (one day after each official contest day) here on Codeforces in the usual IOI format (it is _unrated_, the best scoring submission counts, scoreboard is not visible during the contest and there's full feedback throughout the whole contest). ![CEOI2020 logo](/predownloaded/7f/dd/7fdd51c47c48b966d43f95b5184fe54b76a487cc.png) In this year's CEOI, the 4 best problem solvers going to secondary schools of Austria, Croatia, Czech Republic, Germany, Hungary, Italy, Lithuania, Poland, Romania, Slovakia, Slovenia, Switzerland, and The Netherlands will compete. Due to the current situation, unfortunately not everyone will be able to make it onsite, but we hope the offsite participants will also enjoy the event, although without the magical week in Nagykanizsa....
everyone from newbie to legendary grandmaster will have fun solving the problems (well,legendary

Full text and comments »

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

26.
Codeforces Round 960 (Div. 2)
By wuhudsm, history, 2 years ago, In English
Codeforces Round 960 (Div. 2) Hello Codeforces! I have the pleasure of inviting you to participate in [contest:1990], which will start on [contest_time:1990]. The problems were prepared and authored by [user:wuhudsm,2024-06-26]. You will be given **6 problems** and **2 hours** to solve, one of the problems is divided into two subtasks. One of the problems may be **interactive**. So, please refer to the guide on [interactive problems](https://codeforces.me/blog/entry/45307) if you are unfamiliar with them. I would like to thank: - [user:Akulyat,2024-04-26] for coordinating the round; - [user:BurnedChicken,2024-02-26] for the only <a class="rated-user user-legendary">LGM</a> testing; - [user:physics0523,2024-02-26], [user:liympanda,2024-02-26], [user:culver0412,2024-02-26], [user:Dominater069,2024-02-26], [user:TheScrasse,2024-02-26], [user:Andreasyan,2024-02-26],[user:satyam343,2023-11-20] for <a class="rated-user user-red">GM</a> and <a class="rated-user user-red">IGM</a> testing; - [user:Er...
only LGM <> testing; - [user:physics0523,2024-02-26, ; - [user:BurnedChicken,2024-02-26] for the only LGM <> testing

Full text and comments »

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

27.
Educational Codeforces Round 142 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 142 [Rated for Div. 2] Hello Codeforces! On [contest_time:1792] [contest:1792] 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-01-23] Dalabaev, Vladimir [user:vovuh,2023-01-23] Petrov, Ivan [user:BledDest,2023-01-23] Androsov, Ma...
experience, featuring ICPC world champions winners and finalists, as well as legendary names from the, finalists, as well as legendary names from the field of competitive programming: Mike Mirzayanov

Full text and comments »

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

28.
CF Sweatshirt signed by legends at ICPC World Finals
By SecondThread, history, 5 years ago, In English
CF Sweatshirt signed by legends at ICPC World Finals Good morning! ICPC World Finals just concluded in Moscow. I was lucky enough to be participate representing the University of Central Florida, who finished in a respectable 17th place. While there, friends, acquaintances, and CF Legends signed my Codeforces sweatshirt in their handle with their current color. The most common request of the people I asked was to show off what it ended up looking like on a blog post of Codeforces, so here that is! ![ ](https://wumbogames.github.io/cfPictures/IMG_2102.png) ![ ](https://wumbogames.github.io/cfPictures/IMG_2101.png) <spoiler summary="Famous Signings"> ![ ](https://wumbogames.github.io/cfPictures/IMG_2075.png) ![ ](https://wumbogames.github.io/cfPictures/IMG_2078.png) </spoiler> #### Signers: - [user:MikeMirzayanov,2021-10-11] the creator and maintainer of Codeforces and Polygon who deserves our eternal thanks, and [user:Una_Shem,2021-10-11] without whose work there would be no sweatshirt to sign. - [user:tourist,2021-1...
[user:jcvb,2021-10-11] - [user:andrewzta,2021-10-11] legendary coach of ITMO and author of all ASC sets, ] - [user:andrewzta,2021-10-11] legendary coach of ITMO and author of all ASC sets - [user:davidberard,2021-10-11

Full text and comments »

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

29.
random quotes
By Lyde, history, 3 years ago, In English
random quotes Oh hi! Welcome to 24 random quotes! I'm a competitive programmer, but I'm also pretty much a fan and often visit here to see some recent actions. I have a pretty unusual hobby: Collecting some sentences from blogs and comments and saving them as pictures, which I could use later for memes. Later I realized that I couldn't use it that much and after 4 years, it became a collection of well, memories. So I had the idea of sharing some of it with you guys for nostalgia! Most of them are light-hearted, and all of them are pretty memorable in my mind. If you are an experienced member here you might realize some of them, so I will make it a challenge: Guess where this is from! (No prizes sadly) The spoiler to the link of the comment/blog and my personal opinion (or s/p) will be right below the quote. Anyways, enjoy. > If newcomers find it confusing, then that's their bugaboo <spoiler summary="s/p"> [Link](https://codeforces.me/blog/entry/91480#comment-800196) Still rem...
A recent one. Just legendary.

Full text and comments »

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

30.
Congratulations to LLI_E_P_JI_O_K for reaching Legendary Grandmaster
By antontrygubO_o, 4 weeks ago, In English
Congratulations to LLI_E_P_JI_O_K for reaching Legendary Grandmaster After [contest:2255], [user:LLI_E_P_JI_O_K,2026-08-09], ranking $6$, has finally reached the title of Legendary Grandmaster! (Maybe he will be ranked even higher after the cheaters are removed). All the long years of practice have finally paid off. I hope he inspires everyone in CF community, proving that nothing is impossible if you put in hard work. ![ ](https://gcdnb.pbrd.co/images/4G5aQr4mPcVs.png)
Congratulations to LLI_E_P_JI_O_K for reaching Legendary Grandmaster, of Legendary Grandmaster! (Maybe he will be ranked even higher after the cheaters are removed

Full text and comments »

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

31.
Codeforces Round 1019 (Div. 2)
By Blagoj, 17 months ago, In English
Codeforces Round 1019 (Div. 2) Hello, Codeforces! [user:NemanjaSo2005,2025-4-15] and I are glad to invite you to [contest:2103], which will start on [contest_time:2103]. You will be given **6** problems and **2** hours to solve them. The round will be rated for participants of Division 2 with a rating lower than **2100**. Division 1 participants can participate unofficially. All problems are invented and prepared by [user:NemanjaSo2005,2025-4-15] and me. We would like to thank: - [user:MikeMirzayanov,2025-4-15] for the Codeforces and Polygon platforms! - [user:maomao90,2025-4-15] for his great coordination of the round! - [user:Alexdat2000,2025-4-15] for helping translate the round! - [user:prvocislo,2025-04-19] for being the MVT (Most Valuable Tester)! - [user:A_G,2025-4-15] for nutella testing! - [user:milisav,2025-4-15], [user:N_z__,2025-4-15], [user:_istil,2025-4-15], [user:TimDee,2025-4-15], [user:culver0412,2025-4-15] and [user:Error_Yuan,2025-4-15] for red testing! - [user:Pe...
- You <https://codeforces.me/profile/> for, ] for blue testing! - You <https://codeforces.me/profile/>

Full text and comments »

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

32.
Codeforces Round 1103 (Div. 3)
By eyfxrby, 3 months ago, translation, In English
Codeforces Round 1103 (Div. 3) #Шумбрат, Сәлам, Привет Codeforces! Мы очень рады позвать вас принять участие в [contest:2236] в [contest_time:2236] — очередном Codeforces раунде для третьего дивизиона. В этом раунде будет 7-8 задач, которые подобраны по сложности так, чтобы составить интересное соревнование для участников с рейтингами до 1600. **Однако все желающие, чей рейтинг 1600 и выше, могут зарегистрироваться на раунд вне конкурса**. Раунд пройдёт по правилам образовательных раундов. Таким образом, во время раунда задачи будут тестироваться на предварительных тестах, а после раунда будет 12-часовая фаза открытых взломов; после её завершения все успешные попытки будут перетестированы на успешных взломах. Мы постарались сделать приличные тесты — так же как и вы, мы будем расстроены, если у многих будут падать решения после окончания контеста. Вам будет предложено 7-8 задач и 2 часа 30 минут на их решение. **Штраф** в этом раунде будет равняться 10 минутам. [Напоминаем](https://codeforces...
- And, of corse, thanks a lot , - И, конечно, большое спасибо

Full text and comments »

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

33.
Statistics of New Year Magic
By -is-this-fft-, history, 5 years ago, In English
Statistics of New Year Magic #### Introduction New Year's traditional masquerade of colors and ranks is going to end pretty soon, and before it goes away, I decided to download a snapshot of everyone's true ratings and current handle colors to see how everyone's using the feature. I regret that I only have one snapshot; I only managed to push myself to finish this today. It would have been really cool to see how people's usage of the feature has evolved &mdash; perhaps an initial surge of masquerading as a nutella, then slowly coming to one's senses and opting for something milder? Data was collected on January 9th, at about 01:00 UTC. I collected the data by scraping the pages of the "rating" tab (sorry for making a lot of requests!) &mdash; the table contains people's actual ratings, and by looking at the title-text of people's handles, I could also get their possibly-magicked ranks. I only included the active people because it was already taking a lot of time, and I believe we got most of the interesting ...
(I)GM LGM , "> IGM LGM , ">International Grandmaster22.22% , > GM IGM LGM

Full text and comments »

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

34.
Hello 2026 Editorial
By wangmarui, history, 8 months ago, In English
Hello 2026 Editorial We'd like to thank you all for participating in the contest, and hope you enjoyed it. Any feedback would be appreciated! <spoiler summary="Rate The Contest!"> - Great contest - Good contest - Average contest - Bad contest </spoiler> ## [2183A &mdash; Binary Array Game](https://codeforces.me/contest/2183/problem/A) Idea & Preparation: [user:wangmarui,2025-12-23] <spoiler summary="Rate The Problem!"> - Good Problem - Okay Problem - Bad Problem - Didn't Solve </spoiler> <spoiler summary="Hint 1"> If the sequence $a$ consists entirely of $1$ s, what will Alice do? </spoiler> <spoiler summary="Hint 2"> Consider discussing the values of $a_1$ and $a_n$. </spoiler> <spoiler summary="Solution"> First, if the entire sequence consists of $1$ s, Alice wins immediately by operating on the whole sequen...
## [2183E — LCM is Legendary Counting Master](https://codeforces.me/contest/2183/problem/E)

Full text and comments »

Tutorial of Hello 2026
  • Vote: I like it
  • +146
  • Vote: I do not like it

35.
First Ever Users to Reach Some Rating Milestones Revised: ratings above 1500 and greatest falls
By orz, history, 4 years ago, translation, In English
First Ever Users to Reach Some Rating Milestones Revised: ratings above 1500 and greatest falls Several days ago I published a [table](https://codeforces.me/blog/entry/104320) with first people to reach certain ratings. It was a bit raw because, firstly, it was based on top 20000 Codeforces users by rating, and, secondly, because it only gave information about ratings divisible by 50. Now I have prepared a table that is of more complex design, but both issues are resolved. Good luck understanding what is going on in it. [cut] For several reasons I firstly put another table. This is the table of greatest rating falls in the history of Codeforces. The reasons are: 1. I have collected so much data from Codeforces that it would be blasphemy not to use it in as many ways as possible. 2. These tables might intersect a lot: it's easier to get a terrific fall in ratings if you are high-rated. 3. Someone recently posted a table with greatest rating rises and falls. I wasn't able to find this table to check whether it was right, but if someone finds it, you're welcome to pu...
first person to get ratings from 3784 <> to , -legendary">3058 2960 <>–, :1148] 1743rd place , > 1743rd place 3330 <> →

Full text and comments »

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

36.
Codeforces Round 1060 (Div. 2)
By Intellegent, 11 months ago, In English
Codeforces Round 1060 (Div. 2) <center> <img src="https://i.imgur.com/Brilqkh.png" style="width: 125.0px;max-width: 100.0%;max-height: 100.0%;"></center> <center> <h1> Hi Codeforces! </h1> </center> I am very excited to invite you to participate in [contest:2154], starting at [contest_time:2154]. There will be **6** wowee problems for you to solve in **2 hours**, some problems will have multiple parts. 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 very strong individuals for making this round possible: - [user:satyam343,2025-10-16] for epic coordination. - [user:um_nik,2025-10-16] for preliminary review. - The army of testers: [user:Dominater069,2025-10-16], [user:sammyuri,2025-10-16], [user:__baozii__,2025-10-16], [user:Andreasyan,2025-10-16], [user:potatoo,2025-10-16], [user:_istil,2025-10-16], [user:nifeshe,2025-10-16], [user:anango,2025-10-16], [user:cry,2025-10-16], [...
polygon. -

Full text and comments »

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

37.
Hacking [GUIDE]
By qwexd, 4 years ago, In English
Hacking [GUIDE] _I've seen quite a lot of people asking about hacking but I couldn't find any guide in codeforces so I decided to make this blog._ --- ### **What is Hacking?** $\ $ In a codeforces round, test cases might not be enough to judge your code. It's very normal since we can't expect setters to consider every single wrong solution to add new test cases. In other words, if your code gets Accepted during the contest, this doesn't mean your submission is necessarily correct. To avoid incorrect solutions that get Accepted due to the lack of enough test cases to judge during the round we use Hacking. $\ $ There are two types of Hacking, one of them is after the contest and the other is during the contest; but the general idea of hack is providing a test case where you think someone's solution fails. The judge checks this specific test case you provided and determine if the solution actually fails. (Comparing outputs with actually working pre-made jury code to check if i...
mistake _(unless you are NOT

Full text and comments »

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

38.
Codeforces Round #726 (Div. 2)
By SlavicG, history, 5 years ago, In English
Codeforces Round #726 (Div. 2) #### Hello Codeforces! [user:ssense,2021-06-15] and I are very glad to invite you to [contest:1537] which will take place on [contest_time:1537]. The round will be **rated for participants with a rating lower than 2100**. Division 1 participants are also welcomed to take part in the competition but it will be unrated for them. The round was originally planned to be a division 3 round so the problems might be slightly easier than average Div 2. You will be given **6 problems** and **2 hours** to solve them. We would like to thank the following people: - <a class="rated-user user-red" href="/profile/1-gon" title="yo-yo master">1-gon</a> for amazing coordination of our round! - <a class="rated-user user-red" href="/profile/antontrygubO_o" title="orz Tester">antontrygubO_o</a> for testing, translating statements and providing useful ideas! - <a class="rated-user user-legendary" href="/profile/Maksim1744" title="orz Tester">Maksim1744</a>, <a class="rated-user user-re...
- Maksim1744 <>, -legendary" href="/profile/Maksim1744" title="orz Tester">Maksim1744,

Full text and comments »

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

39.
Group tutoring
By Errichto, 3 years ago, In English
Group tutoring Hi. I offer classes for groups of 2-3 students. I teach competitive programming with a focus on problem-solving. There won't be many lectures because I can send you an article/video link instead. The lesson cycle is usually: I choose a problem, you say your thoughts and ideas, I comment on incorrect ideas, and we talk about the valid solution(s), possibly with drawings and pseudocode. In beginner groups, I might ask you to implement something, C++ or Python preferred. There's a lot of homework and you're expected to practice a few hours per week. We might spend half a lesson talking about 1-2 homework problems from last week. This is intended. We use Google Meet, shared whiteboard, and a collaborative editor Codebunk. After a lesson, you get a video recording and a codebunk with code/text history like this one https://codebunk.com/pb/3501100331621/. This allows you to copy links and code easily. There's a Discord group chat to ask questions between classes. - 1.5h les...
competitions, IOI gold medalist coach. At some point: CF legendary grandmaster, TC target, CF top, some point: CF legendary grandmaster, TC target, CF top contributor. I have a Youtube channel

Full text and comments »

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

40.
Codeforces Round 1005 (Div. 2)
By Intellegent, history, 19 months 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...
-user user-legendary" href="https://codeforces.me/profile/" style="background-position: 83% 50, . - [user:Alexdat2000,2025-02-16] for translating the statements into russian. -

Full text and comments »

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

41.
Codeforces Round #842 (Div.2)
By thanhchauns2, history, 4 years ago, In English
Codeforces Round #842 (Div.2) Hi Codeforces! ================== [user:Igorfardoc,2020-01-05], [user:Vladithur,2020-02-09], [user:alexdat2000,2019-08-18], [user:gluchie,2021-03-10], [user:DeMen100ns,2020-09-19], [user:Spyofgame,2021-10-03] and me (spelling "thanh-chau-n-s-2") are delighted to invite you to participate in [Codeforces Round #842 (Div. 2)](https://codeforces.me/contests/1768). **This round will be rated for all participants with a rating lower than 2100.** - Start time: [contest_time:1768] - Duration: **120 minutes**. - Number of tasks: **6**. <img align="right" src="https://media.discordapp.net/attachments/961567157622276126/1056248841348841594/received_3472327789705304.webp?width=541&height=676" width="30%" height="40%"> <spoiler summary="This contest is brought to you by"> - <a href = "https://www.facebook.com/HocvienPTIT">PTIT</a>, my university. - <a href = "https://discord.gg/codemely">Code Mely</a>, a Vietnamese fanpage for Computer Science. </spoiler> Special thanks to: ...
Codeforces and Polygon. - Last but not least,

Full text and comments »

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

42.
You can do it, too!
By kpw29, 4 years ago, In English
You can do it, too! Introduction ------------------------------- So, I set myself [that challenge](https://codeforces.me/blog/entry/81383) to retire as a red coder before 24.09.2020... and I failed **miserably**. At least I am less delayed than most civil infrastructure projects. This blog will be a recap of this _short_ challenge with a mixture of some tips on practicing (for all levels!), some random life advice and, of course my bad sense of humour. It is dedicated to all those who aren't wonderkids, go from failure to failure and feel like banging their head into a wall during most of their competitive programming journey. Whatever your goal is, I'd like to strengthen your beliefs &mdash; you can do it! How it all started ------------------ My skill level has been in constant stagnation for years. I've always thought that I'm just not talented enough to be a grandmaster. Although I've been red twice in the past, it was quite lucky and the next contests were solid $-137$ and $-189$ so th...
make you rich. Before you declare you want to be a Legendary grandmaster (while cyan at the moment

Full text and comments »

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

43.
Codeforces Round 1106 (Div. 2)
By Friendiks, 2 months ago, translation, In English
Codeforces Round 1106 (Div. 2) ### Hello, Codeforces! We are glad to announce that [contest:2238] will take place at [contest_time:2238]. The round will be rated for participants with rating below $2100$. You will be offered $6$ problems, with $2$ hours to solve them. All problems were created and prepared by [user:lewc,2026-06-25], [user:KotlechkovEgor,2026-06-25] and me. We express our HUGE gratitude to the following people, without whom the round could not have taken place: * [user:74TrAkToR,2026-06-25] for incredible coordination. * [user:Um_nik,2026-06-25] and [user:244mhq,2026-06-25] for preliminary review of the round. * [user:zhiganov_v,2026-06-25], [user:wxhtzdy,2026-06-25], [user:JYJin,2026-06-25], [user:abc864197532,2026-06-26] and [user:OG_Matveychick1,2026-06-25] for red testing of the round. * [user:XaRDKoDblCH,2026-06-25], [user:pskobx,2026-06-25], [user:Mark_Pr,2026-06-25] and [user:_lemur_,2026-06-25] for orange testing of the round. * [user:_liravel_,2026-06-25], [user:mirach0ck,202...
:)" class="rated-user user-legendary">Вас за участие, . * , ="/profile/" title="Legendary grandmaster You :)" class="rated-user user- legendary">

Full text and comments »

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

44.
Codeforces Round 974 (Div. 3)
By RobinFromTheHood, history, 2 years ago, In English
Codeforces Round 974 (Div. 3) Hello Codeforces! Greetings from Nottingham, England! We are delighted to invite you to _Legend of Robin Hood_, a round inspired by our local folklore. [contest:2014] will start on [contest_time:2014]. 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 ...
-user user-legendary" href="https://codeforces.me/profile/">You for participating in the round, 7. You <https://codeforces.me/profile/> for

Full text and comments »

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

45.
Grandmasters HATE this one weird trick!!! Top ten tips to speed up your program (NUMBER THREE WILL SHOCK YOU!!)
By Sharon, history, 8 years ago, In English
Grandmasters HATE this one weird trick!!! Top ten tips to speed up your program (NUMBER THREE WILL SHOCK YOU!!) It is currently 12:00AM, March 32nd. I was digging through the deep web and I found out about a couple tricks that legendary grandmasters have been using on this website for ages, though it was kept secret from the rest of humanity. These tricks are too dangerous for dangerous people to know (Kim Jong Un if you are reading this please stop). However, I am personally sick of the inequality and I think it is time to let the world know the secrets to make your programs run super fast. Trick 1: The O(N) to O(1) trick. Consider [this problem](http://codeforces.me/problemset/problem/955/C). The bounds are clearly too large for an O(N) solution (looping from L to R). However, what if I told you that you could easily modify your O(N) code to make it O(1)? Consider this piece of code: ~~~~~ long sum = 0; for(long i = 0; i < N; i++){ sum += i; } ~~~~~ We can clearly see that for large N, such as 10^18, the program will take a long time to run. BUT!!! We can turn every...
couple tricks that legendary grandmasters have been using on this website for ages, though it was kept

Full text and comments »

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

46.
Greeting and an interview with the legendary Gennady Korotkevich
By Una_Shem, 7 years ago, translation, In English
Greeting and an interview with the legendary Gennady Korotkevich _Hi, Codeforces!_ My name is Una and recently I became a part of the Codeforces team. Unfortunately, I’m not a programmer, but I’m happy to help with other things. For example, if you win a T-shirt, you'll receive a message asking you to update your personal information, and I do it. ;) As a new person in this area, I am interested in all the news. Recently I read an interesting interview with the legendary Gennady [user:tourist,2019-06-15] Korotkevich on the ITMO news portal. The interview is dedicated to the victory in the “Science and Life” category of the "TOP 50. The Most Famous People of St. Petersburg" award of the Sobaka.ru magazine. Codeforces team join others in congratulating! The editors of the portal allowed to share the article on the Codeforces pages (and we are very grateful for this). Original article published at [http://news.ifmo.ru/ru/university_live/achievements/news/8550/](http://news.ifmo.ru/ru/university_live/achievements/news/8550/). Gennady doesn'...
Greeting and an interview with the legendary Gennady Korotkevich, interview with the legendary Gennady [user:tourist,2019-06-15] Korotkevich on the ITMO news portal. The, with the legendary Gennady [user:tourist,2019-06-15] Korotkevich on the ITMO news portal. The

Full text and comments »

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

47.
Codeforces Round 901 (Div. 1, Div. 2)
By Gellyfish, 3 years ago, In English
Codeforces Round 901 (Div. 1, Div. 2) Hello, Codeforces! I'm pleased to invite you to [contest:1874] and [contest:1875]. It starts on [contest_time:1874]. It also means, the National Day of China arrives during the round. Wish you a nice vacation! &#127881;&#127881;&#127881; For both divisions, you will have **3 hours** to solve **7 problems**. I would like to thank: - [user:errorgorn,2023-09-27] for his wonderful coordination. - [user:Alexdat2000,2023-09-27] for Russian translation and [user:Vladosiya,2023-09-30] for helping us with Russian clarifications. - [user:GeZhiyuan,2023-09-27] for providing all the problems and "a few" rejected problems. - [user:znstz2018,2023-09-27] and [user:SanweiTreap,2023-09-27] for helping me prepare the problems. - [user:Um_nik,2023-09-27], [user:wangziji,2023-09-27], [user:Heltion,2023-09-27], [user:Kevin114514,2023-09-27] and [user:flowerletter,2023-09-27] for Legendary Grandmaster Testing. - [user:sjcsjcsjc,2023-09-27], [user:He_Ren,2023-09-27], [user:Gary,20...
Legendary Grandmaster Testing. - [user:sjcsjcsjc,2023-09-27], [user:He_Ren,2023-09-27], [user:Gary, ], [user:Kevin114514,2023-09-27] and [user:flowerletter,2023-09-27] for Legendary Grandmaster Testing.

Full text and comments »

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

48.
A useful blog about how to become master
By Sparky_WCH_Master1226, history, 4 years ago, In English
A useful blog about how to become master Dear Codeforces community, Today I realised I should teach more people the secrets on how to become a Master in Codeforces like [user:20llmc,2022-11-14]. The key to reaching orange is to just acquire some 4-anilino-4'-nitroazobenzene and spread it all over your keyboard. This will ensure that you absorb the most orange powers while you type code. **If you are going for Legendary Grandmaster, replace that with squid ink.** Regarding 4-anilino-4'-nitroazobenzene, this dye is useful in conducting experiments with flash photolysis due to the isomerization effect between the trans-4A4N and cis-4A4N states that occurs during photo relaxation. Hence, I believe it will have the maximum effect on helping you become a Master in Codeforces. If you are too poor to buy / chemically synthesize it, then you are having a skill issue. An easy solution to this is to bake some lemon tart. The following is a procedure written in English (not C++, sorry in advance) on how to bake lemon tart: ...
you absorb the most orange powers while you type code. **If you are going for Legendary Grandmaster, you are going for Legendary Grandmaster, replace that with squid ink.**

Full text and comments »

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

49.
Please allow rated participation of purple-rating users in Div. 2 contests
By VLamarca, history, 8 years ago, In English
Please allow rated participation of purple-rating users in Div. 2 contests Hi! The main objective of my post is to make most **Div. 2 only** rounds rated for purle users. This is beneficial because it would distinguish their rating better. It would also mean a more frequent participation for those people, which is good for the growth of the plataform. It makes no sense to make a purple coder wait for a Div. 1 round, which is rare due to the difficulty to come up with a Div1 D/E problem, when in most cases those users don't even read these harder problems at all. Another reason is because most Div. 2 rounds are hard enough for people with purple rating. I assume the difficulty of contests should be sufficient to not transform them in a "type race", which means that it is good that few people solve all the problems. I will try to convince you that we can make div2 contests rated for people with higher rating without breaking this principle. **EDIT:** Originally the title of this blog was "Please increase div2 upper rating limit" but this was missl...
contestants could not solve 2 of the contests' problems. Also 3 legendary grand masters contestants, legendary grand masters contestants could not solve all the problems. With that being said I suggest

Full text and comments »

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

50.
Codeforces Round 1034 (Div. 3)
By reirugan, 14 months ago, In English
Codeforces Round 1034 (Div. 3) Hello, Codeforces! ================== I am very excited to invite you to my first-ever contest, [contest:2123], which will start on [contest_time:2123]! In this contest, you will be given **2 hours and 15 minutes** to solve **7 problems**. The round will be hosted by the rules of educational rounds (extended ICPC). Thus, all solutions will be judged on preliminary tests during the round, and after the round, there will be a 12-hour phase of **open hacks**. After the open hack phase, all accepted solutions will be rejudged on successful hacks. Also, note that there is no score distribution &mdash; rank will be determined by number of problems solved, followed by penalty; wrong submissions will incur the usual penalty of **10 minutes**, following the rules of educational rounds. [As a reminder](https://codeforces.me/blog/entry/59228), only trusted participants of the third division will be included in the official standings table. This is a compulsory measure for combating unspo...
Codeforces and Polygon platforms; - and most importantly of all, , class="rated-user user-legendary" href="https://codeforces.me/profile/" style="background-position: 83

Full text and comments »

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

51.
Codeforces Round 968 (Div. 2)
By zltzlt, history, 2 years ago, In English
Codeforces Round 968 (Div. 2) (After 3 months) Hello again, Codeforces! We are glad to invite you to participate in [contest: 2003], which will start on [contest_time: 2003]. You will be given **6 problems** and **2 hours** to solve them. Two problems are divided into two subtasks. 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 me. I would like to thank: - [user: 244mhq, 2024-8-23] for perfect coordination. - [user: A_G, 2024-8-23], [user: wutongchun, 2024-8-23], [user: yeminghan, 2024-8-23] for red testing. - [user: DisconnectedGraph, 2024-8-23], [user: small_peter, 2024-8-23], [user: JWRuixi, 2024-8-23] for orange testing. - [user: yinhee, 2024-8-23], [user: QwQwf, 2024-8-23], [user: Jryno1, 2024-8-23], [user:sinsop90,2024-08-23] for purple testing. - [user: dieselhuang, 2024-8-23], [user: WRuperD, 2024-8-23], [user: CSQ31, 2024-8-23], [user: gdf_yhm, 2024-8-23...
-5-29] for the great Codeforces and Polygon platforms. - [ You , -user user-legendary">You

Full text and comments »

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

52.
Who wanna take apart in friendly competition?
By Life_Is_A_Game, history, 4 years ago, In English
Who wanna take apart in friendly competition? **Hello Guys!** I think everyone who is on this site in one way or another likes to solve problems! So I would like to offer you a _little competition_ :) All you need is just to: 1. **Write your goal** you would like to achieve before new year, current rating and the number of solved problems. 1. **Solve many different interesting tasks** and raise your rating in the rounds until the new year! 1. **In the new year**, I will write all the progress of each of the users who participate in a new post, and we can start the new year with new ideas! (List will be updated) Participants: Legendary Grandmasters [user:Vercingetorix,2022-10-17], Grandmasters [user:physics0523,2022-10-17], [user:jjang36524,2022-10-17], [user:dmga44,2022-10-17], [user:Artyom123,2022-10-17], [user:SecondThread,2022-10-17], [user:FairyWinx,2022-10-17], International Masters [user:anpoli99,2022-10-17], Masters [user:swift-zym,2022-10-17], [user:jucason_xu,202...
Legendary Grandmasters

Full text and comments »

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

53.
The Relationship between CF Rating and WPM [Results]
By bedirhan, 5 years ago, In English
The Relationship between CF Rating and WPM [Results] Hello again, Codeforces. I'm back with the results. First, I want to say thank you to all 267 people who sent their reports. I was busy thinking about this for a while(smh), and finally, I think I finally concluded. The results may or may not surprise you, but for me. It was more surprising. So, I'll start with the general chart then move on to each chart of ranks one by one. By the way, colors represent the rank of the person. For the charts with no-trendlines, I prepared an interactive graph, so you can see the WPM, rating & accuracy of that person. Check the last line for the link. Also, you can find all of the charts in this blog as grouped through the links. This is the plot of WPM vs. rating for all the respondents. Again, thank you for your participation. ![ ](/predownloaded/25/fb/25fb9b774ae5c55edca15f37ee4078f6be72af40.png) Now with the trendlines. ![ ](/predownloaded/4b/07/4b076a541dcc1e5355e4deceab6d1fd0adbe2be2.png) From this chart, we can conclude that th...
/Legendary Grandmasters. (12 International Grandmasters & 7 Legendary Grandmasters, At the end, we have International Grandmasters/Legendary Grandmasters. (12 International

Full text and comments »

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

54.
April Fools Day Contest 2022 Editorial
By Agnimandur, history, 4 years ago, In English
April Fools Day Contest 2022 Editorial All problems were created and prepared by me and [user:magnus.hegdahl,2022-04-01]. Thanks to [user:BucketPotato,2022-04-01], [user:Monogon,2022-04-01], and [user:Priyam2k,2022-04-01] for valuable feedback and testing. Special thanks to [user:MikeMirzayanov,2022-04-01] for coming up with the idea and preparing the unique checker for [problem:1663H]. I hope you enjoyed the contest, and found it to be an interesting series of puzzles. Example solution code written by [user:Agnimandur,2022-04-01] is provided for each problem. ### [problem:1663A] <spoiler summary="Clue 1"> The problem statement is the title of the problem. </spoiler> <spoiler summary="Clue 2"> Re-read the original announcement blog. </spoiler> <spoiler summary="Solution"> If you carefully read [the announcement blog](https://codeforces.me/blog/entry/101364), you will notice that I especially thanked [user:BucketPotato,2022-04-01] for testing. Just print "BucketPotato". </spoiler> <spoiler summary=...
3000 is the cutoff for the highest rating: Legendary Grandmaster

Full text and comments »

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

55.
Codeforces Round 930 (Div. 1, Div. 2)
By Psychotic_D, 3 years ago, In English
Codeforces Round 930 (Div. 1, Div. 2) _"You are braver than you believe, stronger than you seem, and smarter than you think." &mdash; A.A. Milne_ Hello Codeforces! I have the pleasure of inviting you to participate in [contest:1936] and [contest:1937], which will start on [contest_time:1936]. You will be given **6 problems** and **2 hours** to solve them in both divisions. One of the problems may be **interactive**. So, please refer to the guide on [interactive problems](https://codeforces.me/blog/entry/45307) if you are unfamiliar with them. The problems were prepared and authored by [user:wuhudsm,2024-02-26], [user:chromate00,2024-02-26], [user:Psychotic_D,2024-02-26] and [user:MagicalFlower,2024-02-26]. We would like to thank : - [user:irkstepanov,2024-02-26] for coordinating the round; - [user:BurnedChicken,2024-02-26] for the only <a class="rated-user user-legendary">LGM</a> testing; - [user:amenotiomoi,2024-02-26],[user:siganai,2024-02-26], [user:vgtcross,2024-02-26], [user:amethyst0,2024-02...
the only LGM <> testing; - [user:amenotiomoi,2024-02-26, ; - [user:BurnedChicken,2024-02-26] for the only LGM <> testing

Full text and comments »

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

56.
Invitation to TheForces Round #26 (Readall-Forces, TheForces-Rated, Prizes!)
By physics0523, history, 3 years ago, In English
Invitation to TheForces Round #26 (Readall-Forces, TheForces-Rated, Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #26 (Readall-Forces)**](https://codeforces.me/contestInvitation/9975a3db598ae549fd0f1f0a3107d6d064b1c140), which will take place on **[contest_time: 104802]**. As you can see in the subtitle, you are highly encouraged to **read all the problems!** <spoiler summary="What is TheForces Round?"> TheForces Rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community. You can join our discord server with more than 1000 members for more information about the contests : https://discord.gg/h9N2vGmwep You will have **150 minutes** to solve **7 problems**. The round is **TheForces rated**! After the round you can find your rating changes [here](https://theforces.netlify.app/leaderboard). **Prizes**: the participant in the $i$th place will receive $2^{3-i}$ dollars $(1 \leq i \leq 3)$ as a prize. In addition, we will randomly select $\lfloor \frac...
thank You <https://codeforces.me/profile/> for, - Also we want to thank

Full text and comments »

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

57.
Educational Codeforces Round 141 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 141 [Rated for Div. 2] Hello Codeforces! On [contest_time:1783] [contest:1783] 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-01-07] Dalabaev, Vladimir [user:vovuh,2023-01-07] Petrov, Ivan [user:BledDest,2023-01-07] Androsov, Ma...
experience, featuring ICPC world champions winners and finalists, as well as legendary names from the field, finalists, as well as legendary names from the field of competitive programming: Mike Mirzayanov

Full text and comments »

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

58.
Country statistics
By Sorting, 9 years ago, In English
Country statistics Hi guys! I have prepared for you some statistics on how countries are performing against each other in Codeforces which I hope you will find interesting! ## Top 5 countries with the most users with certain rank: ![ ](/predownloaded/15/0d/150df04ac1d17beab569ac076e50fc114f7c5f83.png) ## Top 5 countries with highest percentage of their users in a certain rank: (Here I don't count countries that have less than 10 Codeforces users) ![ ](/predownloaded/3b/f0/3bf088e64b43df38721a048501e8b85c2ed81241.png) #### Newbie: ![ ](/predownloaded/0d/44/0d446aaa1317d5b095bf4591643da55edbf965c9.png) #### Pupil: ![ ](/predownloaded/ad/23/ad2304a7f229e8d2a5e7b99055f9d8eaeb909911.png) #### Specialist: ![ ](/predownloaded/78/a9/78a93ca3b698de2b72b0b600cbb73561bff49386.png) #### Expert: ![ ](/predownloaded/e6/d5/e6d52596fab286b83c02d5ebe894a0af3c1650dc.png) #### Candidate Master: ![ ](/predownloaded/9a/88/9a88461e5859c0ae7d5c7f9c972fbcf2e6b7192b.png) #### Master: ![ ](/pre...
#### Legendary grandmaster: ![ ](/predownloaded/29/9e/299ed661a3f4a662a0a92fdb8ab74bdfbdec3707.png)

Full text and comments »

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

59.
USACO Guide: Curated Resources for Competitive Programming & USACO
By thecodingwizard, history, 6 years ago, In English
USACO Guide: Curated Resources for Competitive Programming & USACO **11/7/2020 Update**: Now open sourced at https://github.com/cpinitiative/usaco-guide [![USACO Guide Banner](/predownloaded/cd/f4/cdf40be60dc184cc6d1cb18e13d508a2853f75eb.jpg)](https://usaco.guide/) Link: https://usaco.guide/ Recently, a group of experienced USACO contestants (led by the legendary [user:Benq,2020-07-21]) have put together a "USACO Guide" that's designed to take you from any division to Platinum and beyond. It can be accessed here: https://usaco.guide/. Though it's structured around USACO, it can still be used by non-USACO contestants! The guide provides a curated list of tutorial resources you can use to learn a particular topic, as well as a lot of practice problems for you to practice your implementation & application skills. It also comes with progress-tracking tools to help you stay motivated :) This guide is still in the **pre-release** stage: a large number of modules, particularly the more advanced ones, are still incomplete. **We are looking for ...
Recently, a group of experienced USACO contestants (led by the legendary [user:Benq,2020-07-21, legendary [user:Benq,2020-07-21]) have put together a "USACO Guide" that's designed to take you from

Full text and comments »

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

60.
Why we won't revoke AhmetKaan ban
By Vladosiya, history, 6 months ago, In English
Why we won't revoke AhmetKaan ban Hello, Codeforces! The situation involving [user:AhmetKaan,2026-03-11] has generated some discussion. I would like to summarize the information we have reviewed and explain the reasoning behind our final decision. #### About evidence First of all, it is important to note that we cannot have absolute proof in such cases. We cannot see private conversations with AI tools, chats with other people, or other external sources of help. The only reliable data available to us are the submissions. Because of this limitation, some decisions are based on some red flags we see rather than a single definitive proof. If we do not act this way, we will get overwhelmed by a wave of cheaters. Therefore, we believe this is the only effective way to respond to the recent increase in cheating. After the appeal, we reviewed the case and collected the following observations. #### 1. Codeforces Round 1085 - The submissions [submission:365891594], [submission:365892799], [submission:365894412] ...
minutes. Only a few legendary grandmasters achieved a similar speed. At the same time, there was a, solved E2 in only 4.5 minutes. Only a few legendary grandmasters achieved a similar speed. At the same

Full text and comments »

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

61.
Invitation to TheForces Round #34 (ABC-Forces,TheForces Rated,Prizes!)
By wuhudsm, history, 2 years ago, In English
Invitation to TheForces Round #34 (ABC-Forces,TheForces Rated,Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #34 (ABC-Forces)**](https://codeforces.me/contestInvitation/e8e5b9982188285b10dc653e4284513a422e07df), which will take place on **[contest_time:105350]** <spoiler summary="What is TheForces Round?"> ![ ](https://i.postimg.cc/cL4T7MJm/download.png) TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2200$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces div(1 + 2) rounds before ;) so join us now! [Discord link](https://discord.com/servers/theforces-901910143342608405) [TheF...
- Also we want to thank , You <https://mirror.codeforces.com/profile/> for

Full text and comments »

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

62.
Invitation to TheForces #25 (5^2-Forces, TheForces-Rated, Prizes!)
By k1r1t0, history, 3 years ago, In English
Invitation to TheForces #25 (5^2-Forces, TheForces-Rated, Prizes!) Hello, Codeforces! We are glad to invite you to [**TheForces Round #25 (5^2-Forces)**](https://codeforces.me/contestInvitation/f2a8e94a92234cb0d130fba154dd7291dbec6064), which will take place on **[contest_time: 104743]** You will be given **6 problems** and **2 hours** to solve them.<br> The round is **TheForces rated**! After the round you can find your rating changes [here](https://theforces.netlify.app/leaderboard). **Prizes**: the participant in the $i$th place will receive $2^{3-i}$ dollars $(1 \leq i \leq 3)$ as a prize. In addition, we will randomly select $\lfloor \frac{p}{30} \rfloor$ lucky participants and give each of them $1$ dollar as a prize, where $p$ is the number of participants. Please actively participate! You can get more information about **theforces rating** and **prizes** in **[our discord server](https://discord.gg/h9N2vGmwep)**. We want to thank: - [user:physics0523,2023-10-27], [user:wuhudsm,2023-10-27] $-$ for coordinating the round. ...
- Also we want to thank

Full text and comments »

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

63.
Invitation to TheForces Round #27 (3^3-Forces, TheForces-Rated, Prizes!)
By physics0523, history, 3 years ago, In English
Invitation to TheForces Round #27 (3^3-Forces, TheForces-Rated, Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #27 (3^3-Forces)**](https://codeforces.me/contestInvitation/461c0cbd6ae0d9ebe01c5c23c65f0ae56a11e76b), which will take place on **[contest_time: 104855]** [Editorial](https://codeforces.me/blog/entry/123192) is out! <spoiler summary="What is TheForces Round?"> TheForces Rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community. You can join our discord server with more than 1000 members for more information about the contests : https://discord.gg/h9N2vGmwep You will have **120 minutes** to solve **6 problems**. **Note**:there is an **interactive problem** in this round. If you are unfamiliar with interaction problems,you can read the guide for interactive problems [here](https://codeforces.me/blog/entry/45307). The round is **TheForces rated**! After the round you can find your rating changes [here](https://theforces.netlify.ap...
- Also we want to thank

Full text and comments »

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

64.
Osijek Competitive Programming Camp, Fall 2023
By -is-this-fft-, 3 years ago, In English
Osijek Competitive Programming Camp, Fall 2023 Hi everyone! <center><a href="https://ocpc.mathos.unios.hr"><img src="https://ocpc.mathos.unios.hr/images/ocpc.svg" height="100px"></a> <a href="https://icpc.foundation/"><img src="https://ocpc.mathos.unios.hr/images/ICPC.svg" height="100px"></a></center> <center> <b>Sponsored by</b><br> <a href="https://www.janestreet.com/join-jane-street/open-roles/?type=students-and-new-grads&location=london"> <img src="/predownloaded/ee/f2/eef26616a3661c658d1545f18ed21fabb14d5871.svg" height="50px" style="margin: 5px 5px 5px 5px;"> </a> <a href="https://pinely.com/"> <img src="/predownloaded/0a/0f/0a0f3f67435d1f6e467bc7203d4a2090ba8f92cc.svg" height="50px" style="margin: 5px 5px 5px 5px;"> </a> </center> After a successful camp last February ([announcement](https://codeforces.me/blog/entry/110945), [wrap-up](https://codeforces.me/blog/entry/113438)), we are happy to announce that Osijek camp will be returning on **16.-24. September 2023** &mdash; just in time to prepare for th...
Legendary Grandmaster. - ~jtnydv25,2023-07-20 — author of over 50 problems. - ~Claris,2023-07

Full text and comments »

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

65.
Milestones: ratings above 1500 and greatest falls (2024 edition)
By orz, history, 2 years ago, In English
Milestones: ratings above 1500 and greatest falls (2024 edition) <i>Note.</i> This is an updated version of [this post](https://codeforces.me/blog/entry/104681). If you like [this style](https://codeforces.me/blog/entry/104320) more, please tell me in the comments. Since [user:tourist,2024-09-05]'s [breakthrough](https://codeforces.me/blog/entry/133401), I've received a lot of requests to update my old posts with rating achievements. However, I wasn't able to do it immediately since my method of doing it requires to download the rating change history of every user, which, in turn, requires to perform several hundred thousand requests to Codeforces, about which the website (and Cloudflare) is not happy. It took more that three days, but finally the job is done! Below are two tables. The first one is the greatest (by absolute value) negative rating changes. The second one is the first users ever to reach some rating value. [cut] First table: <spoiler> <table> <tr> <th>Place</th> <th>&Delta;</th> <th>Person</th> </tr> ...
">2910 → 3058 <> , th place 3321 <> →

Full text and comments »

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

66.
TheForces Round #44 (DIV3.5-Forces, TheForces Rated, Prizes!)
By wuhudsm, history, 12 months ago, In English
TheForces Round #44 (DIV3.5-Forces, TheForces Rated, Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #44 (DIV3.5-Forces)**](https://codeforces.me/contestInvitation/fa49752704e242f1bfee8cdbb49519302d5c6e47), which will take place on **[contest_time:106049]** <spoiler summary="What is TheForces Round?"> TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2500$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces Div($1 + 2$) rounds before ;) So join us now! [Discord link](https://discord.com/servers/theforces-901910143342608405) [TheForces website](https://theforces.netlify....
- Also we want to thank

Full text and comments »

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

67.
TheForces Round #45 (DIV3-Forces2, TheForces Rated, Prizes!)
By wuhudsm, history, 10 months ago, In English
TheForces Round #45 (DIV3-Forces2, TheForces Rated, Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #45 (DIV3-Forces2)**](https://codeforces.me/contestInvitation/2dc50117b1117d7ca1b044a747e210ad5278a12d), which will take place on **[contest_time:106177]** <spoiler summary="What is TheForces Round?"> TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2500$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces Div($1 + 2$) rounds before ;) So join us now! [Discord link](https://discord.com/servers/theforces-901910143342608405) [TheForces website](https://theforces.netlify.a...
- Also we want to thank , ="rated-user user-legendary" href="https://mirror.codeforces.com/profile/">You for participating in

Full text and comments »

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

68.
ICPC World Finals: Ecnerwala vs Errichto Kotlin Match
By PavelKunyavskiy, history, 4 years ago, In English
ICPC World Finals: Ecnerwala vs Errichto Kotlin Match Hello, codeforces. To unveil the full power of Kotlin and JetBrains tools, as well as their advantages in algorithmic problem-solving, we’ve invited two competitive programming stars to match their skills in solving Kotlin problems on stage at the ICPC World Finals. Andrew ~ecnerwala,2022-11-06 He, one of the top competitive programmers in the world, will compete in a match against Kamil ~Errichto,2022-11-06 Debowski, Codeforces "Legendary Grandmaster" and Topcoder "Target." The match will be commentated by none other than Roman ~elizarov,2022-11-06 Elizarov, Kotlin Lead Language Designer. You can join the stream on [Kotlin by JetBrains youtube channel](https://youtu.be/watch?v=5V0ctpzng34) at [contest_time:1755] and view submissions in the special Codeforces round [contest:1755]. Only ~ecnerwala,2022-11-06 and ~Errichto,2022-11-06 can participate in the round, while you will be able to join as spectators. We will reuse some problems from previous Div3 rounds. We most...
in a match against Kamil ~Errichto,2022-11-06 Debowski, Codeforces "Legendary Grandmaster" and, ~Errichto,2022-11-06 Debowski, Codeforces "Legendary Grandmaster" and Topcoder "Target." The match

Full text and comments »

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

69.
Invitation to TheForces Round #39 (1000-Forces, TheForces Rated, Prizes!)
By wuhudsm, 19 months ago, In English
Invitation to TheForces Round #39 (1000-Forces, TheForces Rated, Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #39 (1000-Forces)**](https://codeforces.me/contestInvitation/19cfbb125a2eb91d20e8e0a3c6260d4adde8a6c6), which will take place on **[contest_time:105672]** <spoiler summary="What is TheForces Round?"> TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2500$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces Div($1 + 2$) rounds before ;) So join us now! [Discord link](https://discord.com/servers/theforces-901910143342608405) [TheForces website](https://theforces.netlify.app/) ...
- Also we want to thank

Full text and comments »

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

70.
Ten Years of Competitive Programming 5
By Arpa, history, 11 months ago, In English
Ten Years of Competitive Programming 5 Hey, Codeforces! I’m AmirReza PourAkhavan, the former Codeforces Contest Coordinator. I let the story become complete, and I’m sharing it now. The story is about a 16-year-old competitive programmer who left his family and migrated to another city alone to follow competitive programming. After seven years, he advanced to the International Collegiate Programming Contest World Finals twice. Read the previous parts: [1](https://codeforces.me/blog/entry/107465), [2](https://codeforces.me/blog/entry/108838), [3](https://codeforces.me/blog/entry/114356), [4](https://codeforces.me/blog/entry/122483). **Read the Persian version** [**here**](https://docs.google.com/document/d/1TN8pnS_8te7MLDYzMjlDxFrElNVjE4ZWjo1Ak-JJdmc/edit?tab=t.isfroku1gx3e). This part covers from December 2016 to November 2017. ## The Codeforces Contest Our contest was held on Codeforces, and it broke several records. - The record for the highest number of upvotes on an editorial. - The record f...
flipped. We ended up **23rd** overall and won no prizes. The same legendary team of Haghani and, upcoming years, we finished **second!** We even beat the legendary team of **Ali Haghani

Full text and comments »

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

71.
Creating Gravity Defied tracks using Codeforces rating graph
By awoo, history, 11 years ago, translation, In English
Creating Gravity Defied tracks using Codeforces rating graph Introduction ============ <img src="http://cs624422.vk.me/v624422694/36ac0/8jKq7pMzPOc.jpg" style="float: right;"></img> Hi everybody! Recently I have decided to refresh memories about good old times and play Gravity Defied on my phone. It wasn't really hard to find port of that legendary game from J2ME to modern platforms. It rapidly gained glory among students of past decade. Key points of Gravity Defied success were nice gameplay (biker completing different stages with high cliffs and deep pits), convinient physics (ability to rotate mid-air) and simplicity of modmaking. As for me, it was a bit more than usual game. When I had completed over thousand tracks, I began earning money on helping others to progress. Only later even more difficult games were developed: HOMM 3, Far Cry and Dark Souls... Predevel story ============ <img src="http://cs624422.vk.me/v624422694/370dd/wU1hi77t6U8.jpg" style="float: right;"></img> And now Gravity Defied is on my phone again! Not o...
Defied on my phone. It wasn't really hard to find port of that legendary game from J2ME to modern, old times and play Gravity Defied on my phone. It wasn't really hard to find port of thatlegendary

Full text and comments »

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

72.
TheForces Round #43 (DIV2-Forces, TheForces Rated, Prizes!)
By wuhudsm, history, 13 months ago, In English
TheForces Round #43 (DIV2-Forces, TheForces Rated, Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #43 (DIV2-Forces)**](https://codeforces.me/contestInvitation/3410fdc34789c0176f60676a4d22dfcb5980a321), which will take place on **[contest_time:106014]** At the same time, we welcome you to participate in the **official** DIV1/DIV2 round scheduled on the 31st! <spoiler summary="What is TheForces Round?"> TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2500$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces Div($1 + 2$) rounds before ;) So join us now! [Discord link]...
class="rated-user user-legendary" href="https://mirror.codeforces.com/profile/">You for, - Also we want to thank

Full text and comments »

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

73.
Invitation to TheForces Round #31 (Div2.9-Forces,TheForces Rated,Prizes!)
By wuhudsm, history, 2 years ago, In English
Invitation to TheForces Round #31 (Div2.9-Forces,TheForces Rated,Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #31 (Div2.9-Forces)**](https://mirror.codeforces.com/contestInvitation/e67f2e5ea744568b5100fe2235aee21cb3ea502a), which will take place on **[contest_time:105245]** <spoiler summary="What is TheForces Round?"> ![ ](https://i.postimg.cc/cL4T7MJm/download.png) TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2200$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces div(1 + 2) rounds before ;) so join us now! [Discord link](https://discord.com/servers/theforces-901910143342608405...
- Also we want to thank

Full text and comments »

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

74.
Invitation to TheForces Round #38 (Tree-Forces, TheForces Rated, Prizes!)
By wuhudsm, history, 21 month(s) ago, In English
Invitation to TheForces Round #38 (Tree-Forces, TheForces Rated, Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #38 (Tree-Forces)**](https://codeforces.me/contestInvitation/f60305cb9aa29f4360a5f7cc3b6a7255c5209ca4), which will take place on **[contest_time:105621]** <spoiler summary="What is TheForces Round?"> TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2500$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces Div($1 + 2$) rounds before ;) So join us now! [Discord link](https://discord.com/servers/theforces-901910143342608405) [TheForces website](https://theforces.netlify.app/) ...
- Also we want to thank , ="rated-user user-legendary" href="https://mirror.codeforces.com/profile/">You for participating

Full text and comments »

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

75.
Invitation to TheForces Round #41 (Magical-Forces, TheForces Rated, Prizes!)
By wuhudsm, history, 17 months ago, In English
Invitation to TheForces Round #41 (Magical-Forces, TheForces Rated, Prizes!) Hello, Codeforces! <div style="text-align: center;"> <img src="https://s2.loli.net/2025/03/30/g3ov1BSIcrqseOf.png" alt="示例图片"> </div> We are happy to invite you to [**TheForces Round #41 (Magical-Forces)**](https://codeforces.me/contestInvitation/f9d058e868f71c9dcb6eef79c97796e0c5e7c76c), which will take place on **[contest_time:105805]** **UPD: Due to a conflict with the AtCoder round, the start time has been postponed by 30 minutes.** <spoiler summary="What is TheForces Round?"> TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2500$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention ...
- Also we want to thank

Full text and comments »

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

76.
Invitation to TheForces Round #24 (DIV3-Forces, TheForces-Rated, Prizes!)
By wuhudsm, history, 3 years ago, In English
Invitation to TheForces Round #24 (DIV3-Forces, TheForces-Rated, Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #24 (DIV3-Forces)**](https://mirror.codeforces.com/contestInvitation/143c52068d5bb4ccff419dc669e30fccd976aca0), which will take place on **[contest_time: 104683]** <spoiler summary="What is TheForces Round?"> TheForces Rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community. You can join our discord server with more than 1000 members for more information about the contests : https://discord.gg/h9N2vGmwep You will have **135 minutes** to solve **7 problems**. The round is **TheForces rated**! After the round you can find your rating changes [here](https://theforces.netlify.app/leaderboard). **Prizes**:the participant who ranked $i$ will received $(6-i)$ dollars $(1 \leq i \leq 6)$ as a prize.In addition,we will randomly select $5$ lucky participants and give them $1$ dollar as a prize.Please actively participate! (We only support...
- Also we want to thank

Full text and comments »

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

77.
Invitation to TheForces Round #37 (Brute-Forces1, TheForces Rated, Prizes!)
By wuhudsm, history, 22 months ago, In English
Invitation to TheForces Round #37 (Brute-Forces1, TheForces Rated, Prizes!) Hello, Codeforces! <img src="https://images-ext-1.discordapp.net/external/5mlHQR-1EiWcWMGls69eqZ5qBTGaLa6k57dYbi7LvXU/https/s8.uupload.ir/files/f8103cf6-6656-4f16-a0e7-a7cddc1158a6_bvk.png?format=webp&quality=lossless&width=976&height=549 " style="width: 800px; height: 480px;" alt="图片描述" /> We are happy to invite you to [**TheForces Round #37 (Brute-Forces1)**](https://codeforces.me/contestInvitation/c81affbb3b2571df8d267bdbdb529f7519e5e3c5), which will take place on **[contest_time:105491]** <spoiler summary="What is TheForces Round?"> TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2500$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting...
- Also we want to thank

Full text and comments »

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

78.
CEOI 2019 Mirror
By majk, 7 years ago, In English
CEOI 2019 Mirror [The 26th Central European Olympiad in Informatics](https://ceoi.sk/) will take place in Bratislava, Slovakia, during **July 23rd-29th 2019**. The most gifted high school students from 13 countries will have the opportunity to prove their knowledge and skills in informatics. Codeforces will organise the online mirror for this year's competition. The online mirrors will take place after the finish of each of the 2 competition days, having the same scoring format. The online mirror schedules are the following: - [contest_time:1192] - [contest_time:1193] **Contest format** - The contest will be unrated for all users. - You will have to solve 3 tasks in 5 hours. - There will be full feedback throughout the entire contest. - The scoreboard will be hidden until the end of the contest. - The tasks will have partial scoring. The maximum score for each problem will be 100 points. - Among multiple submissions only the one that achieves the maximum score is counted towards t...
enough fun for all colours ranging from newbie to international grandmaster. Legendary grandmasters can, for all colours ranging from newbie to international grandmaster. Legendary grandmasters can spice it

Full text and comments »

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

79.
Murasame's Contest 1 (Div. 2.5) Announcement
By Murasame-chan, history, 8 months ago, In English
Murasame's Contest 1 (Div. 2.5) Announcement Hello Codeforces! I'm glad to invite you to my first contest, [Murasame's Contest 1 (Div. 2.5)](https://codeforces.me/contestInvitation/bbbb4ddb6f3fc3f77ea467a10a06e35181e87b5f)! Whether you are looking to sharpen your skills or enjoy some interesting problems, everyone is welcome to join. The contest will start at [01.16.26 17:50 (UTC+8, China Standard Time)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Murasame%27s+Contest+1&iso=20260116T1750&p1=33) and last for 8 days. There are 5 problems in total, with difficulty ranging from Div. 3 to Div. 2 (I guess). All the problems are authored by me. Since this is a long contest, feel free to solve the problems at your own pace. I hope you find the problem set interesting and educational. I would like to thank the following people for making the contest possible: - <a class="rated-user user-legendary" href="/profile/" title="Legendary Grandmaster You"><span class="legendary-user-first-letter">Y</span>ou</a> for p...
following people for making the contest possible: - , - <>

Full text and comments »

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

80.
Invitation to TheForces Round #40 (Maths-Forces, TheForces Rated, Prizes!)
By wuhudsm, history, 18 months ago, In English
Invitation to TheForces Round #40 (Maths-Forces, TheForces Rated, Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #40 (Maths-Forces)**](https://mirror.codeforces.com/contestInvitation/910bff61a51f15df4e7282097ee6aad30a75e44d), which will take place on **[contest_time:105767]** <spoiler summary="What is TheForces Round?"> TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2500$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces Div($1 + 2$) rounds before ;) So join us now! [Discord link](https://discord.com/servers/theforces-901910143342608405) [TheForces website](https://theforces.netlif...
want to thank You <https://mirror.codeforces.com/profile/>, - Also we want to thank

Full text and comments »

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

81.
Rutgers Programming Contest Fall 2025
By nickbelov, history, 10 months ago, In English
Rutgers Programming Contest Fall 2025 <img src="/predownloaded/fc/ef/fcef5ca1e0134bbfc1cf9613f346cf5e2392b914.png" alt="RUCP Logo" style="float: right;" width="300px"/> ### Hear ye, hear ye! We are excited to invite you to participate in the open mirror of the [Rutgers Programming Contest Fall 2025](https://rucp-contest.github.io/), which will start [Sunday, November 23, 2025 at 1:00 PM EST (UTC-5)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Fall+2025+Rutgers+Programming+Contest&iso=20251123T13&p1=5276&ah=5). The problems were prepared and authored by [user:jdurie,2025-11-16], [user:nickbelov,2025-11-16], [user:nadya271,2025-11-16], and [user:ScalarField,2025-11-16]. The contest is a **5-hour long** ICPC-style team contest consisting of **15 problems**. Team sizes can be anywhere from 1 to 3 people. Teams of more than one person are kindly requested to only use one computer for the contest. At least one of the problems will be interactive, so please read [the guide](https://codeforces.me/blog/e...
href="/profile/"> You for participating! , -legendary">You

Full text and comments »

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

82.
Invitation to TheForces Round #35 (LOL-Forces, TheForces Rated, Prizes!)
By wuhudsm, history, 23 months ago, In English
Invitation to TheForces Round #35 (LOL-Forces, TheForces Rated, Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #35 (LOL-Forces)**](https://codeforces.me/contestInvitation/8be905e8de4e2c21c4b77958fdf39d6cfc672bf2), which will take place on **[contest_time:105390]** **Registration is open!** <spoiler summary="What is TheForces Round?"> TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2500$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces Div($1 + 2$) rounds before ;) So join us now! [Discord link](https://discord.com/servers/theforces-901910143342608405) [TheForces website](http...
thank You <https://mirror.codeforces.com/profile/> for, - Also we want to thank

Full text and comments »

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

83.
TheForces Round #42 (Ultimate-Answer-Forces, TheForces Rated, Prizes!)
By wuhudsm, history, 17 months ago, In English
TheForces Round #42 (Ultimate-Answer-Forces, TheForces Rated, Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #42 (Ultimate-Answer-Forces)**](https://codeforces.me/contestInvitation/2f00d5af212537b8492b56c09a21186f8994c4c2), which will take place on **[contest_time:105846]** [The source of the name] (https://en.wikipedia.org/wiki/Phrases_from_The_Hitchhiker%27s_Guide_to_the_Galaxy#The_Answer_to_the_Ultimate_Question_of_Life,_the_Universe,_and_Everything_is_42) <spoiler summary="What is TheForces Round?"> TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2500$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created...
- Also we want to thank

Full text and comments »

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

84.
Codeforces Round 864 (Div. 2)
By rui_er, history, 3 years ago, In English
Codeforces Round 864 (Div. 2) Hello, Codeforces! [user:AC-Automation,2023-04-05] and I [user:rui_er,2023-04-05] are glad to invite you to participate in [contest:1797], which will be held on [contest_time:1797]. **Please note the unusual start time.** This round is rated for the participants with ratings strictly lower than **2100**. You will be given **6 problems** and **2 hours** to solve them. All the problems are prepared by [user:AC-Automation,2023-04-05] and me. We would like to thank: - [user:darkkcyan,2023-04-05] for a perfect coordination and help with the problem preparation. - [user:AC-Automation,2023-04-05] for providing some <s>rejected</s> problems and helping me a lot in preparation. - [user:zplqwq,2023-04-05] for polishing English statements and editorials. - [user:Alexdat2000,2023-04-05] for the Russian translations. - [user:N_z__,2023-04-05], [user:HQJ2007,2023-04-05], [user:2_3_3,2023-04-05], [user:ShmilyTY,2023-04-05], [user:tlsdydaud1,2023-04-05], [user:fishy15,2023-04-05], [use...
Polygon platforms. - [ You ](/profile/) for participating in, great Codeforces and Polygon platforms. - [ You

Full text and comments »

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

85.
(Intermediate Part) — Bits That Changed My CP Thinking !
By 0t0infinity, history, 3 months ago, In English
(Intermediate Part) — Bits That Changed My CP Thinking ! This is the **Part-2** of my Bitwise Operations Blog. In this part, I focused more on intermediate-level bitwise tricks, Common CP Patterns and a few slightly advanced techniques that appear frequently in contest. &mdash; [**Part-1 &mdash; Click Here**](https://codeforces.me/blog/entry/153600) I tried to explain the intuition and thinking process behind each trick as clearly and simple as possible. And as always, Heartfelt thanks to `Raha Ahmed` for her endless encouragement, strongest support and constant belief in me ! --- # Core Concepts You Must Understand First :- --- Intermediate level Bitwise Problems in CP rarely ask you to just "check" or "set" a bit. Instead, they require you to use the Mathematical Properties of bits to optimize your code. Before we jump into the 8 Master Pattern, you need to firmly understand these 5 core concepts. If you understand these the upcoming patterns will feels like magic ! --- <spoiler summary="Core Explan...
### The Legendary One Liner Loop :, There is a legendary one liner loop that skips all invalid numbers and jumps **Only** to the valid

Full text and comments »

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

86.
2026 Codeforces Rating Distribution With Advanced Analytics!
By AlexandruINV, 6 months ago, In English
2026 Codeforces Rating Distribution With Advanced Analytics! Hello, Codeforces ! I'm excited to share my first contribution to the community: a complete analysis of Codeforces rating distributions, as the last one I know about is [this one from 2024](https://codeforces.me/blog/entry/126802). After several days of collecting and processing data through the Codeforces API, I built a set of analytics covering user rating brackets, average time needed to reach specific rating milestones, and other interesting insights about progression on the platform. I’m also looking to build a community around future projects, learning programming, and helping each other improve. No matter your current rank on Codeforces, you’re welcome to join our newly created [Discord server](https://discord.gg/9RJHWfYUw9) ! Now let's get started with the data. I collected information only for users who have participated in at least 6 contests. I also categorized them based on their recent activity: 6 months, 1 year, 3 years, and all time. If interested in what s...
Grandmaster | 206 | 0.283 | 3.49 | 3.768 | | Legendary Grandmaster | 53 | 0.058 | 4.697 | 4.862 |, each bracket gets smaller quite quickly. Ranks such as Master, Grandmaster, and Legendary, | | Legendary Grandmaster | 116 | 0.045 | 4.462 | 4.572 | , | | Legendary Grandmaster | 166 | 0.039 | 4.189 | 4.53 |, | | Legendary Grandmaster | 70 | 0.053 | 4.697 | 4.803 | , % | | International Grandmaster | Legendary Grandmaster | 18.62% |, Ranks such as Master, Grandmaster, and Legendary Grandmaster make up only a small part of the total

Full text and comments »

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

87.
Invitation to TheForces Round #30 (Good-Forces,TheForces Rated,Prizes!)
By wuhudsm, 2 years ago, In English
Invitation to TheForces Round #30 (Good-Forces,TheForces Rated,Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #30 (Good-Forces)**](https://codeforces.me/contestInvitation/9716539c71d4c7ba5fce96be3b74bfc975a707a0), which will take place on **[contest_time:105137]** <spoiler summary="What is TheForces Round?"> ![ ](https://i.postimg.cc/cL4T7MJm/download.png) TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2200$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces div(1 + 2) rounds before ;) so join us now! [Discord link](https://discord.com/servers/theforces-901910143342608405) [The...
user-legendary" href="https://mirror.codeforces.com/profile/">You for participating in our round, - Also we want to thank

Full text and comments »

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

88.
Invitation to TheForces Round #32 (2^5-Forces,TheForces Rated,Prizes!)
By wuhudsm, history, 2 years ago, In English
Invitation to TheForces Round #32 (2^5-Forces,TheForces Rated,Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #32 (2^5-Forces)**](https://mirror.codeforces.com/contestInvitation/000a2dfa80cc4353a7b0637c6bcc91a2067b8c0d), which will take place on **[contest_time:105270]** <spoiler summary="What is TheForces Round?"> ![ ](https://i.postimg.cc/cL4T7MJm/download.png) TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2200$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces div(1 + 2) rounds before ;) so join us now! [Discord link](https://discord.com/servers/theforces-901910143342608405) ...
- Also we want to thank

Full text and comments »

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

89.
Invitation to TheForces Round #36 (Starters-Forces, TheForces Rated, Prizes!)
By wuhudsm, history, 22 months ago, In English
Invitation to TheForces Round #36 (Starters-Forces, TheForces Rated, Prizes!) Hello, Codeforces! <img src="https://s8.uupload.ir/files/9c2ddb60-6104-481a-92f9-964506ba27b2_w6xi.png" style="width: 600px; height: 600px;" alt="图片描述" /> We are happy to invite you to [**TheForces Round #36 (Starters-Forces)**](https://codeforces.me/contestInvitation/1b713966aec95ad27894354018c3c3523aef7fbb), which will take place on **[contest_time:105445]** <spoiler summary="What is TheForces Round?"> TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2500$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces Div($1 + 2$) rounds before ;) So...
- Also we want to thank

Full text and comments »

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

90.
First Iranian legendary grandmaster!!
By ParsaF, history, 3 years ago, In English
First Iranian legendary grandmaster!! Congratulations to [user:alireza_kaviani,2023-12-24] on becoming the first legendary grandmaster from Iran. I wanted to congratulate on behalf of all Iranians for achieving this great accomplishment. (Kavi) is one of the best teachers I’ve ever had. He is one of the kindest and most well-mannered people I know. I am realy happy for him reaching this huge milestone. And I hope more Iranians become LGM. and a special thanks on behalf of all his students.
First Iranian legendary grandmaster!!, Congratulations to [user:alireza_kaviani,2023-12-24] on becoming the first legendary grandmaster

Full text and comments »

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

91.
Invitation to TheForces Round #33 (Wow-Forces,TheForces Rated,Prizes!)
By wuhudsm, history, 2 years ago, In English
Invitation to TheForces Round #33 (Wow-Forces,TheForces Rated,Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #33 (Wow-Forces)**](https://codeforces.me/contestInvitation/ce841525d3bdce31587a167b0c34138aa6e998b9), which will take place on **[contest_time:105293]** <spoiler summary="What is TheForces Round?"> ![ ](https://i.postimg.cc/cL4T7MJm/download.png) TheForces is a project uniting individuals with a shared interest in competitive programming contests. You can join our discord server with more than $2200$ members to communicate with founders and members of TheForces. In the other words TheForces rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community, It's where anyone can propose and prepare his own interesting problems and receive money! Not to mention that we've already created **two** official codeforces div(1 + 2) rounds before ;) so join us now! [Discord link](https://discord.com/servers/theforces-901910143342608405) [TheF...
- Also we want to thank , ="rated-user user-legendary" href="https://mirror.codeforces.com/profile/">You for participating in

Full text and comments »

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

92.
Codeforces Round 1023 (Div. 2)
By sunkuangzheng, 16 months ago, In English
Codeforces Round 1023 (Div. 2) Hello, Codeforces! [user:auiunu,2025-04-30], [user:nahc0el,2025-04-30] and me are glad to invite you to the last round with 10 binary bits &mdash; [contest:2107], which will start on [contest_time:2107]. You will be given 6 problems and 1 subtask with 2 hours 15 minutes to solve them. The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1 participants can participate unofficially. All problems are authored by [user:auiunu,2025-04-30], [user:nahc0el,2025-04-30] and me. We would like to thank: - [user:Dominater069,2025-04-30] and [user:TheScrasse,2025-04-30] for their wonderful coordination and huge help in preparing the round. - [user:Alexdat2000,2025-05-02] for the Russian translations. - [user:hyman00,2025-04-30], [user:le0n,2025-04-30], [user:Flamire,2025-04-30], [user:jeroenodb,2025-04-30] for LGM testing. - [user:Sana,2025-04-30], [user:N_z__,2025-04-30], [user:Wuyanru,2025-04-30], [user:Halzion,2025-04-30], [user:platter,...
Codeforces and Polygon platforms. - , -legendary" href="https://codeforces.me/profile/">You for participating.

Full text and comments »

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

93.
Invitation to TheForces Round #28 (Epic-Forces, TheForces-Rated, Prizes!)
By wuhudsm, history, 2 years ago, In English
Invitation to TheForces Round #28 (Epic-Forces, TheForces-Rated, Prizes!) Hello, Codeforces! We are happy to invite you to [**TheForces Round #28 (Epic-Forces)**](https://codeforces.me/contestInvitation/13e87c03605971c4f08b7aa6eeaae0ecc8fecd60), which will take place on **[contest_time: 105028]** <spoiler summary="What is TheForces Round?"> TheForces Rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community. You can join our discord server with more than 1000 members for more information about the contests : https://discord.gg/h9N2vGmwep You will have **180 minutes** to solve **6 problems**. The round is **TheForces rated**! After the round you can find your rating changes [here](https://theforces.netlify.app/ratings). Prizes: the participant in the $i$th place will receive $2^{3-i}$ dollars $(1 \leq i \leq 3)$ as a prize. In addition, we will randomly select $\lfloor \frac{p}{30} \rfloor$ lucky participants and give each of them $1$ dollar as a prize, where $p$ is the nu...
- Also we want to thank

Full text and comments »

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

94.
‍My Coding Journey in Detail
By alireza_kaviani, history, 3 years ago, In English
‍My Coding Journey in Detail Hey Everyone, Thank you all for your awesome messages congratulating me on becoming a Legendary Grandmaster! You’re all amazing. I have some exciting news to share! I’m going to have an interview with 'Algorithms with Shayan' on [YouTube](https://www.youtube.com/@AlgorithmswithShayan). Shayan was my coach in IOI 2022, where I won a Gold medal. We'll talk about how I went from being a complete newbie to becoming a Legendary Grandmaster in coding. It's going to be super cool! In this interview, I'll share tips for people who want to start coding, and I'll tell some really exciting stories from my coding adventures! Here's where you come in! If you have any questions about competitive programming or anything else, ask them in the comments below. I’ll pick some of your questions to answer in the interview. And guess what? I have a surprise! I'm going to give some awesome gifts to people who ask questions and watch our interview. So, don’t miss it! Stay tuned for the inter...
how I went from being a complete newbie to becoming a Legendary Grandmaster in coding. It's going to, Hey Everyone, Thank you all for your awesome messages congratulating me on becoming aLegendary, Thank you all for your awesome messages congratulating me on becoming a Legendary Grandmaster

Full text and comments »

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

95.
Codeforces Round 1065 (Div. 3)
By reirugan, 10 months ago, In English
Codeforces Round 1065 (Div. 3) <img src="https://c.tenor.com/G25fbL0QjmYAAAAd/tenor.gif" style="width: 400.0px;float: right;margin: 0 1.0em 1.0em 1.0em;max-width: 100.0%;max-height: 100.0%;"> Hello, Codeforces! ================== I am very excited to invite you to my second-ever contest, [contest:2171], which will start on [contest_time:2171]! In this contest, you will be given **2 hours and 30 minutes** to solve **7 problems, two of which have been split into subtasks**. The subtasks for a given problem are not necessarily placed adjacently in the problemset. The round will be hosted by the rules of educational rounds (extended ICPC). Thus, all solutions will be judged on preliminary tests during the round, and after the round, there will be a 12-hour phase of **open hacks**. After the open hack phase, all accepted solutions will be rejudged on successful hacks. Also, note that there is no score distribution &mdash; rank will be determined by number of problems solved, followed by penalty; wrong submissions...
platforms; - and most importantly of all, , -legendary" href="https://codeforces.me/profile/" style="background-position: 83% 50% !important

Full text and comments »

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

96.
Codeforces Round 896 (Div. 1, Div. 2)
By sszcdjr, 3 years ago, In English
Codeforces Round 896 (Div. 1, Div. 2) Hello, Codeforces! & Happy Chinese Teachers' Day! We (OICon Team) are so excited to invite you to take part in OICon Round 1 ([contest:1868] and [contest:1869]) which will start on [contest_time:1868]. You will be given 6 problems and 2.5 hours to solve them in both divisions. * **Please notice the unusual starting time!** * One of the problems has two versions but their statement are not exactly the same, which means that you **can't** pass the easy version using the code of the hard version. However, you can only make hacks when you pass both versions. * There will be $0$ interactive problem in each division so you needn't read the [guide for interactive problems](https://codeforces.me/blog/entry/45307). * Score distribution: * Div. 1: $500-(500+750)-1000-1750-2500-3000$ * Div. 2: $500-750-1250-(1250+1500)-2500-3250$ The problems were authored and prepared by [user:Error_Yuan,2023-09-03], [user:duck_pear,2023-09-03], [user:programpiggy,2023-09-03] and me. We...
Legendary GrandMaster testing 👽👽👽 * [user:sansen,2023-08-29], [user:Kubic, ], [user:gyh20,2023-08-29], [user:flowerletter,2023-08-29], [user:Heltion,2023-08-31] forLegendary GrandMaster

Full text and comments »

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

97.
Codeforces Round 1022 (based on LCOSHP, Div. 2)
By eugenechka.boyko.2_0-0, 16 months ago, translation, In English
Codeforces Round 1022 (based on LCOSHP, Div. 2) こんにちは, Codeforces! ======================== Since our first round, we've learned a lot, and now we're excited to invite you to participate in [Codeforces Round 1022 (Div. 2)](https://codeforces.me/contest/2108), which will be held at [contest_time:2108]. The round will feature **6 OR 7** <s>full Leetcode implementation</s> **problems**, where **OR** means the bitwise "we don't know" operation, and you'll have **2 hours** to solve them. Some of the problems might be interactive — you can read more about interactive problems [here](https://codeforces.me/blog/entry/45307). The round will be rated **for all participants with a rating below 2100**, but everyone is welcome to participate out of competition as well. All problems were authored and prepared by [user:m3tr0,2025-04-28], [user:suprend,2025-04-28], and me. We would like to express our huge thanks to [user:Akulyat,2025-04-28] for the fantastic coordination of the round and playing $\text{Tower Defense}$, as well as to...
-legendary" href="https://codeforces.me/profile/" style="background-position: 83.0% 50.0% !important, ://www.youtube.com/watch?v=2HjXshFK0lY) Codeforces and Polygon platforms, and , ://www.youtube.com/watch?v=2HjXshFK0lY) платформы Codeforces и Polygon, а также

Full text and comments »

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

98.
DO NOT READ THIS POST IN THE EU !!!!HIGHLY ILLEGALL!!!!
By Sharon, history, 7 years ago, In English
DO NOT READ THIS POST IN THE EU !!!!HIGHLY ILLEGALL!!!! **DISCLAIMER: DO NOT READ THIS POST IF YOU ARE IN PORTUGAL FOR WORLD FINALS OR LIVE IN THE EUROPEAN UNION** Attention World Finalists: ========================== As you may know, Article 13 has been voted on by the European Union and all memes are now illegal. It is imperative that when you travel to Portugal you must LEAVE YOUR MEMES AT HOME, or they will be deleted at airport security and you will be arrested. The contents of this post must be viewed at your own risk. <spoiler summary="European-SFW mode:"> ...![ ](https://i.kym-cdn.com/photos/images/original/001/381/981/c32.jpg) </spoiler> <spoiler summary="Normal mode:"> ...It is March 32, 2, and I'm back with more expert algorithm analysis that the legendary grandmasters don't want you to see. I have to take extra discretion with this one, since the government of an entire continent decided to ban my means of passing information. Ladies and gentlemen, I present to you: The Log Trick 2 --------------- [I...
analysis that the legendary grandmasters don't want you to see. I have to take extra discretion with

Full text and comments »

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

99.
THE OPTIMAL PRACTICE STRATEGY (**NOT CLICKBAIT**)
By galen_colin, 2 years ago, In English
THE OPTIMAL PRACTICE STRATEGY (**NOT CLICKBAIT**) Spoiler: it's clickbait. Sorry. Titles like those are fun. ...but, it's the same style of clickbait as my [roadmap](https://www.youtube.com/watch?v=bSdp2WeyuJY) [spoiler 2: if you haven't seen that, it markets itself as a standard roadmap (y'know, soulless and devoid of purpose), but then a few minutes in, says "ok but roadmaps are stupid and here's the advice that you really need" and completely changes the direction of the video]. That's my style of clickbait, and that's the vibe this blog goes for. [cut] <br><br> So... hear me out, please. The start ------------------ First, a couple meta-notes. I will likely exaggerate my tone a bit here for dramatic effect. Don't take it personally, please. Also, **this applies to almost all ratings**. At the very least, I recommend you process the main point of this blog and see whether or not you already do something similar (for most people... probably not?) The problem ------------------ I'm sure if you've looked at the...
wrong with it. And those legendary blogs I mentioned earlier are **still incredibly useful too

Full text and comments »

Tags hi
  • Vote: I like it
  • +207
  • Vote: I do not like it

100.
Midnight Code Cup Finals 2026: Problems, Winners and More
By MidnightCodeCup, 2 months ago, In English
Midnight Code Cup Finals 2026: Problems, Winners and More This weekend concluded the second Midnight Code Cup: 24 hour final round took place in Belgrade on July 4-5. <br /> 29 teams competed for the champions title, team members coming to Serbia from 20 different countries. ![ ](/predownloaded/89/70/89701277a496498890a22d1f4e0582e6364761cb.jpg) Credits -------- The champions: team taxi confidently took the lead and performed strongly throughout the whole round. A close game was played in the rest of the top places up until the end, teams superfight and itmo_1.2017 ended up taking second and third place respectively. Final results: https://2026.midnightcodecup.org/standings/ <br /> Problems: https://2026.midnightcodecup.org/problems/ <br /> First Photos (more will be added to the same folder later): [Folder](https://drive.google.com/drive/folders/1-WMYJ8we8XEA0dY55QYuPR41YYK8RGVE?usp=sharing) <br /> Instagram: https://www.instagram.com/midnightcodecup <br /> X: https://x.com/midnightcodecup <br /> Amazing Jury: [user:Aks...
### [L: Legendary Grandmaster](https://2026.midnightcodecup.org/problems/L/) In this problem the

Full text and comments »

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

101.
[Tutorial] How to format a blog
By DuyMinh3005, 3 months ago, In English
[Tutorial] How to format a blog <i>This blog focuses more on the functions (which help you format a blog), not the tips and tricks.</i> <br> Since many recent blogs are hurting my eyes (I'm talking to you, [user:MEGATRON_HACKER,2026-06-15]...), I decided to write a blog to share some tips and tricks about how to format a blog. <b> This post has been written with my best knowledge. If something is incorrect please let me know! </b> <b style="color:white;font-size:5px"> I copied this sentence from [<b style="color:white;font-size:5px">this blog</b>](https://codeforces.me/blog/entry/104522)...</b> <br> Here's a table of contents if you guys need it: ### <b>Table of Contents:</b> <ol> <li> <b>Codeforces specific features</b> </li> <li> <b>Math</b> </li> <li> <b>Emoji</b> </li> <li> <b>Change font, font size, color, background color of text, and text's alignment</b> </li> <li> <b>Tables</b></li> <li> <b>YouTube videos</b> </li> </ol> <p style="font-size:0px"> This blog was written by ...
is still a pupil), and when you hover the link, it says "Legendary Grandmaster DuyMinh3005", ://codeforces.com/profile/DuyMinh3005 "Legendary Grandmaster DuyMinh3005")

Full text and comments »

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

102.
[Tutorial] An introductory guide to the worst sorting algorithms
By pikamonstruosa, history, 3 years ago, In English
[Tutorial] An introductory guide to the worst sorting algorithms With the broad availability of quick and efficient sorting algorithms, that can sort arrays in $O(N*logN)$ complexity, little attention has been given to the vast and interesting world of the bad sorting algorithms. Because of this, I will, in this blog, explore this area. To make this list more interesting, we are only going to consider the algorithms in which play a role in the sorting process. That is, there won't be algorithms that use a _wait_ function or an infinite loop. ### Bogosort -This may be the most famous bad sorting algorithm. Its legendary strategy consists of randomly shuffling and array until it is sorted. <spoiler summary="Code"> ~~~~~ #include<bits/stdc++.h> using namespace std; vector<int> v = {10,9,8,7,6,5,4,3,2,1}; bool sorted() { bool unsorted = false; for(int i = 1; i < v.size(); i++) if(v[i] < v[i-1]) unsorted = true; return !unsorted; } int main() { bool unsorted = false; while(!is_sorted(v.begin(),v.e...
### Bogosort -This may be the most famous bad sorting algorithm. Its legendary strategy consists

Full text and comments »

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

103.
Congratulations to djq_cpp, the new youngest LGM!
By 1.618, history, 7 years ago, In English
Congratulations to djq_cpp, the new youngest LGM! In [contest:1261], [user:djq_cpp,2019-11-25], aged 14, smashed the world record of the youngest Legendary Grandmaster with a rating of 3055! Jiangqi Dai is undoubtedly the best OIer(i.e. competitive programmer) in junior middle school all over China(perhaps the world). He is likely to get a perfect score in CSP2019-S2, the first round of the selection of IOI participants in China. Also, he has got gold medals in APIO and the Winter Camp(rank 12). It is widely believed that his age is the only obstruction keeping him from an IOI gold medal, because of China's policy. ![ ](/predownloaded/f8/1b/f81b00445dacbcbf120d563ac6ed041004b14d8f.jpg)
Legendary Grandmaster with a rating of 3055!

Full text and comments »

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

104.
fix problem ratings pls (the rainboy effect)
By galen_colin, 2 years ago, In English
fix problem ratings pls (the rainboy effect) [The first few paragraphs of this blog, above the first spoiler, are just for story purposes and are irrelevant to the problem statement] One fateful day, a naive and young version of me from about 5 days ago had a dream. A dream to stop being so terrified of hard problems. A dream to conquer the most challenging stuff that CF ever had to offer. A dream to... ok, enough of that, that's so stupid. Basically, I've been grinding 3500s lately, mostly for fun (and my god, has it been fun). Two days prior, I found myself solving [1919G](https://codeforces.me/contest/1919/problem/G). That went fine, but after getting it, I noticed that despite G being 3500, it wasn't even the hardest problem in the contest &mdash; that honor went to the next problem, [1919H](https://codeforces.me/contest/1919/problem/H) (the subject of this blog), which had **no solves in-contest**. I concluded that I would have to be insane to try that, and moved on to other problems. Well, yesterday, I decided I...
bad, but come on, its only solvers were jiangly <>,

Full text and comments »

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

105.
Codeforces Round #366
By PrinceOfPersia, history, 10 years ago, In English
Codeforces Round #366 Hello ladies and gentlemen. I'm honored to announce you that Codeforces Round #366(or should I say, IOI 2016 opening CF contest) is gonna take place on [August 7th](http://www.timeanddate.com/worldclock/fixedtime.html?day=7&month=8&year=2016&hour=17&min=5&sec=0&p1=166) and I'm the writer. **Please note that the timing is unusual.** As usual, there are 5 problems in each division and duration is 2 hours. I want to thank [user:LiTi,2016-08-05] for testing this round, [user:GlebsHP,2016-08-05] for helping me prepare it and [user:MikeMirzayanov,2016-08-05] for legendary and unique platforms of Polygon and CF. The main characters of this round are **The Avengers**! ![ ](http://codeforces.me/predownloaded/d8/17/d817ca073dc127de1656e885f241d1986299c5cf.png) I wish you all Accepted solutions and Successful hacks. Scoring will be posted soon. Problems are sorted by their expected difficulty, but I strictly recommend you to **read all the problems**. GL & HF! **P.S...
helping me prepare it and [user:MikeMirzayanov,2016-08-05] for legendary and unique platforms of Polygon, -08-05] for helping me prepare it and [user:MikeMirzayanov,2016-08-05] for legendary and unique

Full text and comments »

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

106.
Codeforces Round 1081 (Div. 2)
By Jamshed11, 7 months ago, In English
Codeforces Round 1081 (Div. 2) Hello Codeforces !!! I am very excited to invite you to participate in [Codeforces Round 1081](https://codeforces.me/contests/2192), which will be held on [contest_time:2192]! You will be given **$\mathbf{2}$ hours** to solve **$\mathbf{6}$ problems**. This round will be rated for all participants with **rating below 2100**. This is my first time hosting an official Codeforces round, and all the problems are authored by me. I hope you will enjoy the round. This round would not be possible without the help of the following people: - [user:Proof_by_QED,2026-02-18] for excellent coordination and improving the problems. - [user:flamestorm,2026-02-18] and [user:ScarletS,2026-02-18] for initial coordination of the round. - [user:Alexdat2000,2026-02-18] for russian statement translation. - All the testers for testing and sharing valuable feedback: [user:__baozii__,2026-02-18], [user:YuukiS,2026-02-18], [user:N_z__,2026-02-18], [user:sammyuri,2026-02-18], [user:Ari,2026-02-18],...
class="rated-user user-legendary" href="https://codeforces.me/profile/">You for participating in, the great Codeforces and Polygon platforms. -

Full text and comments »

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

107.
Osijek Competitive Programming Camp, Winter 2025
By adamant, 20 months ago, In English
Osijek Competitive Programming Camp, Winter 2025 Hi everyone! <center><a href="https://ocpc.camp"><img src="https://ocpc.camp/images/ocpc.svg" height="100px"></a> <a href="https://icpc.foundation/"><img src="/predownloaded/43/08/43086529a28ccb5c9f2f2eec560ffa85e09c6881.svg" height="100px"></a></center> <center> <b>Supported by</b><br> <a href="https://www.quantco.com/"><img src="https://ocpc.camp/images/quantco.svg" height="60px" style="margin: 10px 10px 10px 10px;"></a> <a href="https://ordercapital.com/"> <img src="https://ocpc.camp/images/OrCa.svg" height="60px" style="margin: 10px 10px 10px 10px;"> </a> <a href="https://www.janestreet.com/join-jane-street/open-roles/?type=students-and-new-grads&location=london"> <img src="/predownloaded/ee/f2/eef26616a3661c658d1545f18ed21fabb14d5871.svg" height="60px" style="margin: 10px 10px 10px 10px;"></a> <a href="https://pinely.com/"> <img src="/predownloaded/0a/0f/0a0f3f67435d1f6e467bc7203d4a2090ba8f92cc.svg" height="60px" style="margin: 10px 10px 10px 10px;"></a> </cent...
IOI gold medalist, Codeforces Legendary Grandmaster. - [user:Pyqe,2025-01-04] — IOI gold medalist, . - [user:dorijanlendvaj,2025-01-04] — double IOI gold medalist, Codeforces Legendary Grandmaster

Full text and comments »

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

108.
Rutgers Programming Contest Spring 2026
By MattTheNub, history, 5 months ago, In English
Rutgers Programming Contest Spring 2026 <img src="/predownloaded/47/d3/47d3afac8389f8863b7ca526b7f5436eaee00971.png" alt="RUCP Logo" style="float: right;" width="300px"/> Rutgers Competitive Programming is excited to invite you to participate in the open mirror of the [Spring 2026 Rutgers Programming Contest](https://contest.rucp.org), which will start [Saturday, April 11, 2026 at 1:00 PM EDT (UTC-4)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Spring+2026+Rutgers+Programming+Contest&iso=20260411T13&p1=5276&ah=5)! The problems were prepared and authored by [user:jdurie,2026-04-05], [user:nickbelov,2026-04-05], [user:nadya271,2026-04-05], [user:ScalarField,2026-04-05], [user:dbaumg,2026-04-05], [user:MattTheNub,2026-04-05], [user:snowythecat,2026-04-05], and [user:mgoldy925,2026-04-05]. The contest is a **5-hour long** ICPC-style team contest consisting of **14 problems**. Team sizes can be anywhere from 1 to 3 people. Teams of more than one person are kindly requested to only use one computer for the con...
-legendary">You

Full text and comments »

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

109.
Codeforces Round 942 (Div. 1, Div. 2)
By rui_er, history, 2 years ago, In English
Codeforces Round 942 (Div. 1, Div. 2) 久别无恙, Codeforces! We are glad to invite you to take part in [contest:1967] and [contest:1972], which will start on [contest_time:1967]. You will be given **6 problems** and **2 hours and 30 minutes** to solve them in both divisions. Some problems will be divided into two subtasks. The problems were authored and prepared by [user:N_z__,2024-04-28], [user:wyrqwq,2024-04-28], [user:yinhy09,2024-04-28] and me [user:rui_er,2024-04-28]. We would like to thank: - [user:TheScrasse,2024-04-28] for his perfect coordination. - [user:Alexdat2000,2024-04-28] for Russian translation. - [user:negative1,2024-04-28], [user:tzl_Dedicatus545,2024-04-28] and [user:lelml,2024-04-28] for providing some <s>rejected</s> problem proposals and discussing problems with us. - [user:peti1234,2024-04-28] and [user:A_G,2024-04-28] for LGM testing. - [user:10circle,2024-04-28], [user:le0n,2024-04-28], [user:Clein.qwq,2024-04-28], [user:AC-Automation,2024-04-28], [user:LMydd0225,2024-04-28] and [user:p...
and Polygon platforms. - [ You , class="rated-user user-legendary">You ](/profile/) for participating in this round. Score

Full text and comments »

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

110.
Codeforces Round 1083 (Div. 2)
By Leftist_G, 6 months ago, In English
Codeforces Round 1083 (Div. 2) #### 你好, Codeforces! <img src="/predownloaded/ee/40/ee40e93b2b5e01607ec07e0bea1ff7d7c2dadfaf.png" style="width: 300.0px;float: right;margin: 0 1.0em 1.0em 1.0em;max-width: 100.0%;max-height: 100.0%;"> We (DBOI Team) are very glad to invite you to participate in [contest:2205], starting at [contest_time:2205]. There will be **7 problems** for you to solve in **2 hours and 30 minutes**. All problems were authored and prepared by [user:cool_milo,2026-02-19], [user:StayAlone,2026-02-19] and me. This round will be rated for all participants with **rating below 2100**. I would like to thank the following list of very strong individuals for making this round possible: - [user:Error_Yuan,2026-02-19] for the excellent coordination and for making problems better. - [user:Alexdat2000,2026-02-19] for Russian translation. - [user:CTHOOH,2026-02-19], [user:LiHn,2026-02-19], [user:Angelic717,2026-02-19], [user:StayAlone,2026-02-19] and me for providing some rejected problems. - All ...
Codeforces and Polygon systems. -

Full text and comments »

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

111.
Your Future Ratings Predictor is here!! (upd:1.0 UI Added)
By luctivud, 5 years ago, In English
Your Future Ratings Predictor is here!! (upd:1.0 UI Added) **Update 1.0** : The app is now live [here](https://cffrpredict.netlify.app/). Hello Codeforces, So, I got some requests to predict the future ratings from my fellow coders and I simply didn't ignore it. I have worked a way through which a user can get their future ratings predicted by a piece of code. It was inspired by [user:stefdasca,2021-06-21]'s blog but since I am a bit weak in geometry and graphs so I decided to write a code for it (ignoring the fact that I am weak in coding too). I have tested it rigourously for like 2-3 times and it did work as the results were satisfactory. For Eg: The case of 1-gon's profile: <spoiler summary="Screenshot proof"> <img src="https://i.ibb.co/fQDt7gT/Pics-Art-06-21-06-26-14.jpg" alt="Pics-Art-06-21-06-26-14" border="0"> </spoiler> #### How to get your future ratings:<br> <spoiler summary="Using Web hosted page"> I have made a UI for my app in DHTML. You can give it a try and your review. It is currently deployed [h...
Sister", "Indigenous Gangbastad", "Legendary Grandma", "Insanity" };

Full text and comments »

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

112.
Codeforces Round 1035 (Div. 2)
By CutieSmileHaruka, history, 14 months ago, In English
Codeforces Round 1035 (Div. 2) 你好，Codeforces！ We (FeOI and WAOI Team) are glad to invite you to take part in [contest:2119], which will start on [contest_time:2119]. You will be given **6 problems** and **2 hours** to solve them. The round will be rated for participants of Division 2 with a rating lower than **2100**. Division 1 participants can participate unofficially. All problems are authored by [user:lizhous,2025-06-28], [user:Lyz09,2025-06-28], [user:ma2021tyoi0037,2025-06-28] and me. I would like to thank the following people for making this round possible: - [user:abc864197532,2025-06-28] for the excellent coordination. - [user:Alexdat2000,2025-06-28] for Russian translation. - [user:lizhous,2025-06-28], [user:Lyz09,2025-06-28], [user:Rebex,2025-06-28], [user:hzy_mod,2025-06-28] and me for providing some rejected problems. - [user:Z-301,2025-06-28] for Legendary Grandmaster Testing. He was promoted from IGM to LGM four days after testing, congratulations! - [user:Fysty,2025-06-28], [user:_...
providing some rejected problems. - [user:Z-301,2025-06-28] for Legendary Grandmaster Testing. He was, ] for Legendary Grandmaster Testing. He was promoted from IGM to LGM four days after testing

Full text and comments »

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

113.
Codeforces Round 602(Div.1, Div.2) and Technocup — Elimination Round 3
By RDDCCD, 7 years ago, In English
Codeforces Round 602(Div.1, Div.2) and Technocup — Elimination Round 3 This weekend, on [contest_time:1261] we will hold [Codeforces Round 602](https://codeforces.me/contests/1261,1262). It is based on problems of Technocup 2020 Elimination Round 3 that will be held at the same time. Technocup is a major olympiad for Russian-speaking high-school students, so if you fit into this category, please register at [Technocup 2020 website](https://technocup.mail.ru/) and take part in [contest:1227]. Problem authors are me, [user:nocriz,2019-11-23], [user:BledDest,2019-11-23], [user:adedalic,2019-11-23] and [user:MikeMirzayanov,2019-11-23]. Many thanks to the testers: [user:KAN,2019-11-23], [user:Supermagzzz,2019-11-23], [user:Stepavly,2019-11-23], [user:AdvancerMan,2019-11-23] and [user:unreal.eugene,2019-11-23]! Div. 1 and Div.2 editions are **open and rated for everyone**. As usual, the statements will be provided **in English and in Russian**. Register and enjoy the contests! Have fun! Scoring distribution: Technocup: 500 1000 1250 (500+150...
And congratulations for [user:djq_cpp,2019-11-26] to be the youngest Legendary GrandMaster in the, ] And congratulations for [user:djq_cpp,2019-11-26] to be the youngest Legendary GrandMaster in the

Full text and comments »

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

114.
Competitive Programming Panda: The Story (Prologue)
By Valar.Morghulis, history, 4 years ago, In English
Competitive Programming Panda: The Story (Prologue) Background ========== Maybe you have watched the classic Kung Fu Panda movie. Well, today we introduce the Competitive Programming version! Let me present to you the cast... [user:jiangly,2022-08-08] (based off of Master Po) ------------------------------------------- ![ ](https://upload.wikimedia.org/wikipedia/en/3/3d/Po_from_DreamWorks_Animation%27s_Kung_Fu_Panda.png) The hero of our story, jiangly is the prophesied **Dragon Warrior**, and the bright young future of competitive programming. He has risen to the highest levels of this ancient activity, and has faced many obstacles and enemies on his way. [user:Errichto,2022-08-08] (based off of Master Shifu) ---------------------------------------------- ![ ](https://static.wikia.nocookie.net/kungfupanda/images/a/a6/KFP3-promo-shifu.jpg/revision/latest/scale-to-width-down/350?cb=20160223200109) The famous coach and youtuber, Errichto represents a father figure to many young and energetic competitive programmers....
famous for his legendary speed, extreme skill, and no-nonsense approach to problem solving. He is widely

Full text and comments »

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

115.
Your Codeforces rating in CS:GO ranking system
By Mistra, history, 8 years ago, In English
Your Codeforces rating in CS:GO ranking system I enjoy both Codeforces and _Counter-Strike: Global Offensive_ , and I was wondering what would my Codeforces rating be in CS:GO ranking system. Well, I did the math, enjoy! The method ================== I used [this](https://csgo-stats.com/ranks) CS:GO rank distribution to find out the percentage of players in each skill group. - Silver I: 3.90% - Silver II: 4.23% - Silver III: 4.37% - Silver IV: 5.21% - Silver Elite: 6.44% - Silver Elite Master: 7.78% - Gold Nova I: 8.76% - Gold Nova II: 8.79% - Gold Nova III: 9.05% - Gold Nova Master: 8.08% - Master Guardian I: 7.55% - Master Guardian II: 6.61% - Master Guardian Elite: 5.24% - Distinguished Master Guardian: 4.15% - Legendary Eagle: 3.25% - Legendary Eagle Master: 3.20% - Supreme Master First Class: 2.64% - The Global Elite: 0.75% At the time of writing this blog, there were 21275 active users in Codeforces. I listed the ratings of all active users, sorted the list and divided the list into skill groups ...
Guardian Elite: 5.24% - Distinguished Master Guardian: 4.15% - Legendary Eagle: 3.25% -Legendary, % - Legendary Eagle: 3.25% - Legendary Eagle Master: 3.20% - Supreme Master First Class: 2.64, ;font-weight:bold">1743..1851 - Legendary

Full text and comments »

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

116.
Codeforces Round 1062 (Div. 4)
By Muhammadali__, 11 months ago, In English
Codeforces Round 1062 (Div. 4) Assalamu alaykum, Codeforces! ------------------ We are extremely excited to invite you to **first-ever-Uzbek** contest [contest: 2167], which starts on [contest_time:2167]. You will be given $7$ problems and $2$ hours and $15$ minutes to solve them. We hope you will find the problems interesting. The problems were authored by [user:khba,2025-10-14], [user:Muhammadali_2009, 2025-08-28], [user:JahonaliX,2025-08-25], [user:BehruzbekX,2025-10-14] and [user:Isamatdin,2025-10-14]. 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 recalculated - by default, only "trusted" participants are shown in the results table (but the rating will be recalculated for all with initial ratings less...
least, You <https://codeforces.me/profile/> for, ="rated-user user-legendary" href="https://codeforces.me/profile/">You for participating! Good

Full text and comments »

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

117.
Codeforces Round 949 (Div. 2)
By zltzlt, history, 2 years ago, In English
Codeforces Round 949 (Div. 2) Hello, Codeforces! We are glad to invite you to participate in [contest: 1981], which will start on [contest_time: 1981]. **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: sinsop90, 2024-5-29], [user: yinhee, 2024-5-29] and me. I would like to thank: - [user: 244mhq, 2024-5-29] for his wonderful coordination. - [user: sinsop90, 2024-5-29] and [user: yinhee, 2024-5-29] for providing problem ideas and discussing the problems with me. - [user: AFewSuns, 2024-5-29] and [user: crazy_sea, 2024-5-29] for providing a better solution to one of the problems. - [user: Um_nik, 2024-5-29] for the only LGM testing. - [user: A_G, 2024-5-29], [user: antontrygubO_o, 2024-5-29], [user: StarSilk, 2024-5-29], [user: CharlieV, 2024-5-29], [us...
-legendary">You

Full text and comments »

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

118.
Codeforces Round 1107 (Div. 3)
By wakanda-forever, 2 months ago, In English
Codeforces Round 1107 (Div. 3) #### Hello Codeforces!!! I am more than happy to invite you to my first solo round [Codeforces Round 1107 (Div. 3)](https://codeforces.me/contest/2241), which starts on [contest_time:2241]. You will be given $7$ problems and $2$ hours $15$ minutes to solve them. All the problems were authored and prepared by me. The round will be hosted by the rules of educational rounds (extended <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 — rank will be determined by the number of problems solved, followed by penalty; wrong submissions will incur the usual penalty of 10 minutes, following the rules of educational rounds. [Remember](https://codeforces.me/blog/entry/59228) that only the trusted participants of the third division will...
[user:KAN,2026-06-26] for the legendary platforms.

Full text and comments »

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

119.
OPC March 2026 Editorial
By NPsolved.cpp, history, 6 months ago, In English
OPC March 2026 Editorial Thank you for participating in $\mathbf{OPC\ March\ 2026}$! This editorial outlines the key ideas and solution approaches for each problem. We hope it helps you gain deeper insights and further strengthen your problem-solving skills in competitive programming. We would greatly appreciate your feedback. Please share your thoughts through this [Google Form](https://docs.google.com/forms/d/e/1FAIpQLSf2jvScUIwpxy16neU-CKQj7wIFx9diAO7vFY7TJSERR_PFwQ/viewform) Contest Link: [Link](https://codeforces.me/group/hUywLYmr80/contest/678537) ### [A. Find Sum](https://codeforces.me/group/hUywLYmr80/contest/678537/problem/A) <spoiler summary="Hint 1"> To make a sum of differences as large as possible, you want to subtract the smallest available numbers and add the largest available numbers. </spoiler> <spoiler summary="Solution"> The cost function is $Cost = |a_n - a_1| + \sum_{i=2}^{n} |a_i - a_{i-1}|$. This is equivalent to the total distance traveled if you start...
Read the hints of Problem D

Full text and comments »

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

120.
Congrats to errorgorn on reaching LGM**
By rama_pang, history, 4 years ago, In English
Congrats to errorgorn on reaching LGM** <a href="/profile/errorgorn" title="Legendary Grandmaster errorgorn" class="rated-user user-legendary"><span class="legendary-user-first-letter">e</span>rrorgorn</a> just passed 3000 rating after Round #819, making him <strike>probably</strike> the first LGM in the ASEAN region. Many congratulations to Sir Ashley. P.S. minum susu gaming **EDIT**: round unrated ~~<a href="/profile/errorgorn" title="International Grandmaster errorgorn" class="rated-user user-red">igmrrorgorn</a> forever &#128557;~~ **EDIT 2**: After over 2 years, with a spectacular performance in Round #989, let us (re)celebrate [user:errorgorn,2024-12-01]'s long-awaited well-deserved achievement.

Full text and comments »

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

121.
Invitation to Replay of JU BitFest Season One 2023
By twoplusthree, 3 years ago, In English
Invitation to Replay of JU BitFest Season One 2023 Hello Codeforces! We ([user:twoplusthree,2023-05-28], [user:VS-Codes,2023-05-28], [user:Anupam_Ghosh,2023-05-28] and [user:om_mittal7,2023-05-28]) are glad to invite everyone to [Replay of JU BitFest Season One 2023](https://codeforces.me/contests/445869) which is scheduled on [contest_time:445869]. BitFest is an annual ICPC-style Programming Contest organised for freshers and sophomores of Jadavpur University. This year marked the very first edition of this contest, which consisted of two rounds &mdash; online Prelims and on-site Finals. We hope you like the problems we have created! You will be offered **$10 - 15$ problems** (from the combined problemset of both the rounds), and **$4$ hours** to solve them. You may participate alone, or in teams of not more than $3$ people. The problems vary in difficulty, ranging from **Easy** to **Intermediate**. Some of the problems may also require a classical solution. Note that the contest is **unrated**. We would also like to than...
the contest. - **[ You

Full text and comments »

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

122.
The 75 Hard coding challenge!
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...
. Participants range from **newbies** to **Legendary Grand Master**! It would definitely be interesting to

Full text and comments »

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

123.
300iq challenge (to be continued)
By peltorator, 8 years ago, In English
300iq challenge (to be continued) A few days ago [user:300iq,2018-11-01] wrote in the [blog](http://codeforces.me/blog/entry/62324) that he'll dye his hair pink for a week if he doesn't become a legendary grandmaster before the new year. But he has already become a legendary grandmaster((( Actually we have one more chance! If we get 300 <s> iq </s> likes under this post [user:300iq,2018-11-01] **WILL** dye his hair pink! Let's do it together.
) that he'll dye his hair pink for a week if he doesn't become a legendary grandmaster before the new

Full text and comments »

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

124.
Prosort [114] (Div. 3)
By MiracleMagician, 8 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...
**Prizes:** Top $\ge 1$ people will get **membership of the Legendary Club Foobar**.

Full text and comments »

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

125.
Interview with Pajaraja + great problemset
By MladenP, 2 years ago, In English
Interview with Pajaraja + great problemset Recently, I've had a wish to sit down with great competitive programmers that I find interesting and pick their brains about different topics. For the first iteration, I talked to my good friend [user:Pajaraja,2024-05-04], as I'm sure he's unknown to many of you, but he's well known in Serbia as one of the best &mdash; both problemsetters and competitive programmers (and especially competitive mathematicians). Some of his accomplishments: - [2x Gold medalist at the International Mathematical Olympiad (as well as a Silver medalist)](https://www.imo-official.org/participant_r.aspx?id=27601) - [Silver medalist at the International Olympiad in Informatics](https://stats.ioinformatics.org/people/6650) - 3x ICPC World Finals participant (including a recent 15th place in Luxor) - IOI Problemsetter (IOI 2021 &mdash; Fountain Parks) - [Google HashCode finalist](https://cphof.org/profile/codeforces:Pajaraja) - many more! We discuss differences between competitive math and competit...
everyone (from newbies to legendary grandmasters) will find something interesting to do. We, variety of difficulties, from div2C to div1E/F — we believe everyone (from newbies tolegendary

Full text and comments »

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

126.
Codeforces Round 1105 (Div. 1, Div. 2)
By Gold14526, history, 2 months ago, In English
Codeforces Round 1105 (Div. 1, Div. 2) #### 你好，Codeforces! We are delighted to invite you to participate in [contest:2239] or [contest:2240], both of which will be held on [contest_time:2239]. For both division 1 and division 2, you will be given **$2.5$ hours** to solve **$6$ problems** in each division. The problems were authored and prepared by [user:Gold14526,2026-06-22], [user:Milkcat2009,2026-06-22] and [user:wangmarui,2026-06-22]. We would really like to thank the following people for making this round possible: - ~Um_nik,2026-06-26 for the preliminary review of the round - [user:cadmiumky,2026-06-22] for the great coordination. - ~Alexdat2000,2026-06-29 for providing Russian translations. - [user:hcywoi,2026-06-22] and [user:Network_Error,2026-06-22] who also prepared problems that were ultimately not used in this round. - [user:lkrqwq,2026-06-22] for optimizing many details of problems. - [user:Starsilk,2026-06-23] and [user:errorgorn,2026-06-22] for black red testing. - [user:Network_Error,202...
. - You <https://codeforces.me/profile/> for

Full text and comments »

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

127.
[Educational] DSU Study Notes (1)
By Black_Fate, history, 4 years ago, In English
[Educational] DSU Study Notes (1) Hello Codeforces! Data Structure is a legendary subject that it's really hard for me write it down completely in a single blog, so let's discuss simple DSU first. DSU is really easy for beginners to understand. Also, this blog talks about more than the simplest DSU. **UPD 2023-1-19:** Time complexity analysis updated, thanks [user:Everule,2023-01-19] for help. ### **Part 0** &mdash; How does DSU works? Firstly, DSU is short for "Disjoint Set Union". Let's go to a simple task then. > There are $n$ elements, the $i$-th element is in the $i$-th set initially, and now you can do $m$ queries below: > &mdash; `M a b`, to merge the set that $a$ belongs to and the set that $b$ belongs to into a new set. If $a$ and $b$'ve been in a set already, then do nothing. > &mdash; `Q a b`, to tell if $a$ and $b$ are in the same set. Let's go straight to the problem solution. **Solution：** Let's consider contructing a graph. Initially we have self-cycles for all vertecies, whi...
Data Structure is a legendary subject that it's really hard for me write it down completely in a

Full text and comments »

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

128.
Invitation to CodeChef Starters 144(Rated for All) — 24th July
By satyam343, 2 years ago, In English
Invitation to CodeChef Starters 144(Rated for All) — 24th July We invite you to participate in CodeChef’s [Starters144](https://www.codechef.com/START144), this Wednesday, 24th July. It will be rated for all and is my last contest as contest admin. Time: [8:00 PM — 10:00 PM IST](https://www.timeanddate.com/worldclock/fixedtime.html?msg=CodeChef+Starters+144&iso=20240724T20&p1=44&ah=2) Joining us on the problem setting panel are: - Setter: Satyam [user:satyam_343,2024-07-22] Kumar Roy. - Testers: Apoorv [user:tyr0Whiz,2024-07-22] Kumar, Takuki [user:tabr,2024-07-22] Kurokawa. - Text Editorialist: Nishank [user:iceknight1093,2024-07-22] Suresh. - Statement Verifier: Kanhaiya [user:notsoloud,2024-07-22] Mohan. - Contest Admin: Satyam [user:satyam_343,2024-07-22] Kumar Roy. **On the difficulty** The Division 1 problemset features problems with **difficulties from div2A to div1E**. We expect the contest to be interesting enough for <a class="rated-user user-legendary">LGMs</a> as well. Written editorials will be avai...
enough for LGMs <> as well. Written editorials will be, the contest to be interesting enough for LGMs <> as well.

Full text and comments »

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

129.
What I learned from creating a chess engine of ~1700 ELO
By Alikraken, 2 years ago, In English
What I learned from creating a chess engine of ~1700 ELO Hello, <a href="/profile/"><span class="rated-user user-legendary">%username%</span></a> Recently, I made a chess engine in pure C++, which I named Mufasa, making wordplay on the phrase "move faster". Here is the corresponding [GitHub page](https://github.com/kanin9/mufasa) (make sure you **star** it if you find it resourceful!) Because of that I wanted to share what interesting things that relate to competitive programming you might come across while developing a similar project. #### 1. Branchless programming and bitmasks There is a beauty in a fact that each cell on the chessboard can be represented by a long integer as there are exactly 64 cells. This concept is called bitboard and is used by almost every fast chess engine. Why? Because it allows for less branching during move generation. For example, consider we want a mask of left pawn attacks. A naive approach would be to loop through each and every pawn and get the corresponding left square. But with bitmasks we can...
Hello, %username% <>

Full text and comments »

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

130.
On the question of diversity on Codeforces
By crazyilian, 6 years ago, In English
On the question of diversity on Codeforces #### Rating Codeforces has ranks "candidate master", "master", "grandmaster", "international grandmaster" and "legendary grandmaster". I propose renaming these titles for the following reasons: 1. They are insultive to differently-abled people who can't reach high results and thus can't "master" competitive programming. 2. "master" sounds like a reference to master/slave terminology, it needlessly references awful history. I believe it's inappropriate for such a great platform as Codeforces. I think the following titles should be used instead: 1. "candidate master" -> "candidate professional" 2. "master" -> "professional" 3. "grandmaster" -> "genius" 4. "international grandmaster" -> "international genius" 5. "legendary grandmaster" -> "legendary genius" Additionally, I believe "genius" is more descriptive than "master" or "grandmaster". I want to note that a similar change was adopted by many projects: 1. [Python](https://bugs.python.org/issue34605) — Avoid m...
"legendary grandmaster". I propose renaming these titles for the following reasons:, grandmaster" and "legendary grandmaster". I propose renaming these titles for the following reasons, " -> "genius" 4. "international grandmaster" -> "international genius" 5. " legendary grandmaster

Full text and comments »

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

131.
How to solve problems
By caohash, 6 years ago, In English
How to solve problems ### Introduction After receiving many messages asking how to solve problems, I've decided to create a blog post about it! Of course, as I am a CM (which has low edit distance to LGM), I am obviously very good at problemsolving. ### Rephrasing the Problem One of the most powerful strategies in problem solving is rephrasing the problem. Usually, when people talk about this, they often say things like "try to view the problem as a graph problem" or "rephrase as a geometry problem (yuck!)" However, to become a Legendary Candidate Master like me, you need to multiply these pieces of advice together and divide by their greatest common divisor to realize that it's not enough to simply rephrase the problem -- you need to rephrase problem solving itself. Let's view problem solving as a graph, where one node represents the problem and another node represents the solution. In between, there are several edges (observations, algorithms, interesting data structures, bitset) which allow y...
"rephrase as a geometry problem (yuck!)" However, to become a Legendary Candidate Master like me, you, nodes you visit can become quite large. Luckily, Legendary Grandmaster + 2 time IOI winner + CEO of, !)" However, to become a Legendary Candidate Master like me, you need to multiply these pieces of

Full text and comments »

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

132.
Codeforces Round 1020 (Div. 3)
By SpyrosAliv, 17 months ago, In English
Codeforces Round 1020 (Div. 3) <center> <h1> Hello, Codeforces! </h1> </center> [user:cry,2025-04-19] and I are _very very very_ excited to invite you to participate in [contest:2106], which will take place on [contest_time:2106]. You will be given **7 problems** and **2 hours & 15 minutes** to solve them. There will be **at least one** interactive problem, so please make sure to read [this guide](https://codeforces.me/blog/entry/45307) if you are not familiar with the format. One of the problems will be split into two subtasks. The round will be hosted by rules of educational rounds (extended ICPC). Thus, all solutions will be judged on preliminary tests during the round, and after the round, there will be a 12-hour phase of **open hacks**. After the open hack phase, all accepted solutions will be rejudged on successful hacks. Also, note that there is no score distribution but the usual penalty of **10 minutes** for each wrong submission, following the rules of educational rounds. [Remind](https://codef...
class="rated-user user-legendary" href="https://codeforces.me/profile/" style="background-position, ; - [user:MikeMirzayanov,2025-04-19] for the amazing Polygon & Codeforces platforms; -

Full text and comments »

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

133.
Petition to change Bugabooset back to Problemset (with valid reasons)
By demoralizer, history, 5 years ago, In English
Petition to change Bugabooset back to Problemset (with valid reasons) So long story short, Problemset got renamed to Bugabooset. [(Full story if you're interested)](https://codeforces.me/blog/entry/91134) Don't get me wrong, I personally find it extremely amazing, but I still want this change to be reverted. I have some valid reasons:- - Whenever some newcomer asks me for advice... I say something like, _"Go to the Codeforces Problemset and sort the problems by difficulty and then solve a few everyday"_, now recently what is happening is that, a lot of newcomers can't find the problemset (because it does not exist anymore!!). - If I tell them to go to the bugabooset, they will ask me what is that and what it means, and that's one story that I do not want to explain to someone for the 348th time! - The link still points to **"http://codeforces.me/problemset"**, I think this discrepancy is very confusing... Now some might say, we can change it to **"http://codeforces.me/bugabooset"** but that'll unnecessarily ruin many people's bookmarks (un...
foresee that somewhere in the future, some Legendary Grandmaster might write a blog saying that people who, the future, some Legendary Grandmaster might write a blog saying that people who say "bugaboo" have

Full text and comments »

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

134.
Codeforces Round 1082 (Div. 1, Div. 2)
By chromate00, 6 months ago, In English
Codeforces Round 1082 (Div. 1, Div. 2) Hello again! After merely **eight days** (personal record!) from my last contest, I gladly invite you to [Codeforces Round 1082](https://codeforces.me/contests/2201,2202) [(Div. 1](https://codeforces.me/contests/2201), [Div. 2)](https://codeforces.me/contests/2202) &mdash; which will be held on [contest_time:2201]! For both divisions, you will be given $\mathbf{2.5}$ hours to solve $\mathbf{7}$ problems, where some problems may be divided into subtasks. All problems of the contest are invented and prepared by myself. I would like to thank: - [user:Sugar_fan,2026-02-21] for his excellent coordination. - [user:Alexdat2000,2026-02-21] for Russian translations. - [user:Um_nik,2026-02-21] for pre-reviewing problems. - [user:sammyuri,2026-02-21] for **MVP** testing (crazy, outstanding amount of contribution to the round!). - [user:Proof_by_QED,2026-02-21], [user:satyam343,2026-02-21], [user:reirugan,2026-02-21] for **VIP** testing (big contribution to the round!). - [user:Ev...
class="rated-user user-legendary" href="https://codeforces.me/profile/">You for participating!, -02-21] for great platforms Codeforces and Polygon. -

Full text and comments »

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

135.
NITS Hacks 8.0 Inter College Coding Competition (Prizes worth 1.1 Lakh INR)
By SoloSerenade, 9 months ago, In English
NITS Hacks 8.0 Inter College Coding Competition (Prizes worth 1.1 Lakh INR) ### UPD: The contest time has been updated due to clashes with most colleges' exams. Attention Gym-owners! ===================== <img src="/predownloaded/f2/de/f2dee80bb5c0e8cbb8cf53dcd69e9ff04682cf78.png" style="display:block; margin:0 auto;" /> Gear up to support Ash Ketchum on his journey to find the legendary Pokemon <span style="color:red">Ho-oh</span>, through the Competitive Programming Contest of <a href="https://nitshacks.tecnoesis.co.in/"><b>NITS HACKS 8.0</b></a>, brought to you by the **Coding Club of NIT Silchar**! Dive into the excitement of team-based coding challenges and vie for fantastic prizes! <img src="/predownloaded/1e/19/1e199c18d686dc4b07890c22881cb183dda1bc5a.gif" style="float:right; margin-right:20px; margin-bottom:10px;" /> **Prizes (overall):** - $1^{st}$ Prize: **INR 30K** - $2^{nd}$ Prize: **INR 22K** - $3^{rd}$ Prize: **INR 17K** - $4^{th}$ Prize: **INR 14K** - $5^{th}$ Prize: **INR 12K** **Prizes (NITS...
Gear up to support Ash Ketchum on his journey to find the legendary Pokemon

Full text and comments »

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

136.
Ingenuity — Number Theory Contest Editorial
By arpit_kr, history, 14 months ago, In English
Ingenuity — Number Theory Contest Editorial --- ### [A. Very Simple Problem](https://codeforces.me/gym/620196/problem/A) **Problem Summary:** Check if an integer $n$ has an odd divisor greater than one. **Key Insight:** A number has no odd divisor $> 1$ **if and only if** it is a power of two. Reasoning: * Even $\times$ Even = Even * Even $\times$ Odd = Even * Odd $\times$ Even = Even * Odd $\times$ Odd = Odd So, only odd numbers can generate odd divisors, and powers of two are formed entirely by 2's. **Implementation Tip:** To check if $n$ is a power of 2: ```cpp (n & (n - 1)) == 0 ``` **Time Complexity:** $\mathcal{O}(1)$ per test case. --- ### [B. Simple Problem](https://codeforces.me/gym/620196/problem/B) **Problem Summary:** Given array $a$, split it into $k > 1$ subsegments and maximize the GCD of the sums of each segment. **Key Insight:** It suffices to only try $k = 2$, because: $$ \gcd(b_1, b_2, \dots, b_k) \leq \gcd(b_1 + b_2, b_3, \dots, b_k) $$ So combining s...
### [F. The Legendary One!!](https://codeforces.me/gym/620196/problem/F)

Full text and comments »

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

137.
National Teams for IOI 2025
By soullless, history, 17 months ago, translation, In English
National Teams for IOI 2025 Hey everyone! This year, IOI 2025 will take place in Bolivia — super exciting! Who will be representing your country at this legendary competition? Here's our team (Kazakhstan): — [user:Wansur,2025-04-14] (second time at IOI) (1 attempt left) — [user:shenfe1,2025-04-14] (second time at IOI) (0 attempt left) — [user:away_in_the_heavens,2025-04-14] (first time at IOI) (2 attempts left) — [user:ilovegulim,2025-04-14] (first time at IOI) (1 attempt left) What about your team? Share it in the comments — would be really cool to see who’s going and maybe even spot some familiar names!
representing your country at this legendary competition?

Full text and comments »

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

138.
The Legendary Binary Contest!
By srijon_32, history, 18 months ago, In English
The Legendary Binary Contest! Let’s define a Binary Contest: a Codeforces contest whose number consists only of 0s and 1s. Sounds cool, right? The Binary Contest Timeline So far, 9 Binary Contests have been held: 1, 10, 11, 100, 101, 110, 111, 1000, 1001 And today is the 10th one: 1010! I've participated in two Binary Contests so far: 1000, 1001 If I keep up this streak, the maximum contest I might participate in is 1111. Why? Because after that, the next Binary Contest will be 10000—which is about 8889 contests later! That’s practically a lifetime in Codeforces terms! Now the real question is—can I make it to 1111? Or better yet, can I set a legendary record of attending every Binary Contest from now on? Or maybe... if I don’t, my son or grandson can. :)) The Binary Legacy must live on. **UPD** (22/05/2026): So the Binary Contests are finally here. The next four are: 1100, 1101, 1110, 1111. And realistically, these could be the last Binary Contests I ever get the chance to participate in....
The Legendary Binary Contest!, make it to 1111? Or better yet, can I set a legendary record of attending every Binary Contest from now, ? Or better yet, can I set a legendary record of attending every Binary Contest from now on? Or maybe

Full text and comments »

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

139.
Codeforces Round 1057 (Div. 2)
By Little_Sheep_Yawn, history, 11 months ago, In English
Codeforces Round 1057 (Div. 2) Hello Codeforces, We are very glad to invite you to participate in [contest:2153], which will start on [contest_time:2153]. You will be given **6 problems** and **2 hours** to solve them. All the problems are written and prepared by me and [user:maomao90, 2025-10-09]. We would like to give our sincere thanks to: - [user:maomao90,2025-10-09] for his wonderful coordination and careful adjustments to some problems! - [user:Alexdat2000,2025-10-09] for translating problem statements. - [user:__baozii__,2025-10-09], [user:_istil,2025-10-09], [user:rui_er,2025-10-09], [user:AC-Automation,2025-10-09], [user:exgcd,2025-10-09], [user:A_G,2025-10-09], [user:Andreasyan,2025-10-09] for red testing. - [user:-firefly-,2025-10-09], [user:K-423,2025-10-09], [user:frey4,2025-10-09], [user:LMeyling,2025-10-09], [user:Proof_by_QED,2025-10-09] for orange testing. - [user:xudian,2025-10-09], [user:Sofija06,2025-10-09], [user:qsmcgogo,2025-10-09] for purple testing. - [user:wink,2025-10-09] ...
user-legendary" href="https://codeforces.me/profile/">You for participating in the round., . - You <https://codeforces.me/profile/> for

Full text and comments »

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

140.
[CF Extension] How Not To Feel Bad About Yourself
By kiwii, history, 3 years ago, In English
[CF Extension] How Not To Feel Bad About Yourself I've made some tampermonkey extensions, I will make it available in Google Chrome Extension store if I'm not busy and lazy. The extensions are for those whose souls are as weak as mine. &#11804;(&#65377;&#707; &#7509; &#706; )&#11805;&#9825; ## Simple UI The first one is the simple UI if you want to just read or print CF problem statements in compact mode. <spoiler summary="Screenshots"> ![ ](/predownloaded/8d/19/8d196f359e4bbfcd46ea331ce17329b5df8c65a0.png) </spoiler> What it does: - Remove the problem letters (to avoid bias) - Make it clean and printable - Auto display spoilers (for printing's sake) <spoiler summary="CF Simple UI"> ~~~~~ // ==UserScript== // @name CF Simple UI // @version 1.0 // @author hocky // @match https://codeforces.me/problemset/problem/* // @match https://codeforces.me/blog/entry/* // @match https://codeforces.me/contest/*/problem/* // @icon https://www.google.com/s2/f...
", "red","legendary"]; const replaceColor = `user-cyan`; for(const color of colors, (); const colors = ["gray", "green", "cyan", "blue", "violet", "orange", "red"," legendary

Full text and comments »

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

141.
The first blog: Very first line about my adventure with Codeforces.
By SchezoSchezo, history, 3 years ago, In English
The first blog: Very first line about my adventure with Codeforces. Well, this blog having nothing but my experience. You can read it for fun, or to do anything. And I'm sorry for having any grammar or vocabulary mistakes, since English is not my mother language. Before I use this nickname, I used to have another nick, and I tried so hard to get into Pupil. Sadly, I can't reach it, and the biggest disappointing moment is when I have a rating lower than 1000 after a long time stuck between 1000 and 1200. I have stopped taking contest at Codeforces for a long time, until I return to "reset" the game, with this new nick, SchezoSchezo. The new nick brings me a lot of fun, and I can't believe that I can reach Pupil that easily. Looks like the time I stop and practicing is really helping me out. Even more, my peak was Specialist, which I don't even dream of. But that moment is when I got a C problem in div 2 contest (or I'm getting wrong with my memory because I'm confusing between an ABCDE in div 3 or 4, and an ABC in div 2). I drop again, but I'm goo...
// A legendary image there

Full text and comments »

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

142.
Invitation to TheForces Round #23 (Balanced-Forces)
By wuhudsm, history, 3 years ago, In English
Invitation to TheForces Round #23 (Balanced-Forces) Hello, Codeforces! We are happy to invite you to [**TheForces Round #23 (Balanced-Forces)**](https://codeforces.me/contestInvitation/6ba9a93bf9cf813b320199e5301be386a332cfd3), which will take place on **[contest_time: 104570]** <spoiler summary="What is TheForces Round?"> TheForces Rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community. You can join our discord server with more than 1000 members for more information about the contests : https://discord.gg/h9N2vGmwep You will have **120 minutes** to solve **6 problems**.One of these problems is divided into two subtasks. The round is **TheForces rated**! After the round you can find your rating changes [here](https://theforces.netlify.app/leaderboard). - Problems were prepared and authored by [user:-Kirito-,2023-09-06], [user:wuhudsm,2023-07-29], [user:Error_Yuan,2023-09-06], [user:KitasCraft,2023-09-06]. - We would like to thank our army of te...
- Also we want to thank

Full text and comments »

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

143.
[Consistency] Finding Motivation
By Cristofor, 3 years ago, In English
[Consistency] Finding Motivation Hello, CodeForces! Recently, one of my students had a really bad contest. Even though he worked really hard in the last couple months, he could not pass an important qualifying round of an arguably easy, new, Romanian contest. The first 4 'official' contestants qualified, and sadly he was the fifth. He was really upset after the contest, and had a hard time gathering enough motivation/discipline to continue working, because there were scenarios in his head such as "what if this will happen in training camp?" or "what not passing had a really bad turn on my future?" Today, I am going to share with you all a simple method that can help you get over a bad contest or just motivate you to work more in general. Keep in mind, I am not a specialist in this domain, I am only a teacher with experience, so there might be better methods out there, but throughout the years I have seen that what you are about to read worked best on many of the my students. I advise you to also read this great ...
, not even the top legendary grandmasters such as [user:tourist,2024-01-19] and [user:benq,2024-01

Full text and comments »

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

144.
Прекрасные задачки на новый год! Great problems for the New Year!
By 127.0.0.1, history, 4 years ago, In Russian
Прекрасные задачки на новый год! Great problems for the New Year! <spoiler summary="Текст блога на русском"> Привет Codeforces! Всех с наступающим! За полгода я придумал множество интересных задачи на тему "Клеточная сетка". Почитайте их, и ваше новогоднее настроение повысится до легендарного гроссмейстера :) Спасибо [user:medved,2022-12-31] за перевод задач на английский! 1. Петя и Вася играют в игру на бесконечной клеточной сетке. Вася начинает вторым. Он находится в узле сетки и за один ход двигается в соседний правый узел, или левый, или нижний, или верхний. Петя же в свой ход блокирует один узел сетки. После блокировки Вася не может ходить в этот узел. Может ли Петя сделать так, что Вася не сможет сделать ход? 2. Внутри квадрата 100 × 100 строят клетчатую фигуру по следующим правилам. На первом шаге закрашивают любую клетку. На каждом следующем шаге закрашивают любую клетку, имеющую одну общую сторону с уже закрашенными, и не имеющую с ними других общих вершин и сторон. Какое максимальное число клеток может получиться? 3. Под одн...
Problems". Read them and your New Year's mood will rise to the legendary grandmaster :)

Full text and comments »

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

145.
A small discussion on legendary color
By Zlobober, 11 years ago, In English
A small discussion on legendary color With [Revolution of Colors and Titles](http://codeforces.me/blog/entry/20638) the new color was introduced (somehow similar to TopCoder's target), the color for legendary coders that now looks like the first letter being black. Under my browser and operating system (Chrome and Linux Mint) that looks, IMHO, more like a style defect, rather like a nice effect: <img src="http://i.imgur.com/6LUbLg5.png" /> My variant and its minor variation are: <img src="http://i.imgur.com/BCQKQYi.png" /> What do you think? Feel free to comment or to provide your own vision how the best-coders-ever should look like! The main requirement is to not lose the unique CodeForces style.
A small discussion on legendary color, introduced (somehow similar to TopCoder's target), the color for legendary coders that now looks like

Full text and comments »

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

146.
Invitation to TheForces Round #22 (Interesting-Forces)
By wuhudsm, 3 years ago, In English
Invitation to TheForces Round #22 (Interesting-Forces) Hello, Codeforces! We are happy to invite you to [**TheForces Round #22 (Interesting-Forces)**](https://codeforces.me/contestInvitation/dc248df65a231a75499fe08abb3e4ce7647ecff5), which will take place on **[contest_time: 104542]** <spoiler summary="What is TheForces Round?"> TheForces Rounds are series of educational contests for beginners to masters which are created by a group of CP lovers in the CF community. You can join our discord server with more than 1000 members for more information about the contests : https://discord.gg/h9N2vGmwep [Editorial](https://codeforces.me/blog/entry/119807) You will have **135 minutes** to solve **6 problems**. We strongly recommend you to read **all** problems. The round is **TheForces rated**!, after the round you can find your rating changes [here](https://theforces.netlify.app/leaderboard). - Problems were prepared and authored by [user:Parisa_Amiri,2023-07-29], [user:wuhudsm,2023-07-29], [user:Chromate00,2023-07-29], [us...
- Also we want to thank

Full text and comments »

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

147.
Some Statistics About CF Rating Changes (2018/07 update)
By adrien1018, history, 8 years ago, In English
Some Statistics About CF Rating Changes (2018/07 update) #### Overview There are 1409603 rating changes in 792 rated contests (by 2018/07/14, including those mentioned in the "Something Weird" section). There are 142117 users with at least one rating change. The overall average of deltas is -6.671139. #### Rating Changes Distribution <img src="https://image.ibb.co/gZjnpJ/hist.png" width="90%"/> <img src="https://image.ibb.co/jejnpJ/hist2.png" width="90%"/> (Well, it looks like a boa constrictor eating an elephant...) #### Top 20 Events: Positive Rating Change <table> <tr> <th>#</th> <th>Who</th> <th>Δ</th> <th>Rating</th> <th style="width: 25em;">Contest</th> </tr> <tr> <td>1</td> <td>[user:Mhammad1,2018-07-16]</td> <td><span style="color:green;font-weight:bold;">+803</span></td> <td><span style="font-weight:bold;" class="user-gray">-22</span> → <span style="font-weight:bold;" class="user-gray">781</span></td> <td>[contest:814]</td> </tr> <tr> <td>2</td> <td>[user:white_1,2018-07-16]</td> <td><span style=...
-weight:bold;">-290 3496, 3496 →

Full text and comments »

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

148.
CP TITANS 4.0 : The Meme Madness
By chetan_saini, 3 years ago, In English
CP TITANS 4.0 : The Meme Madness CP TITANS 4.0 : The Meme Madness ================================ ### _Laugh Code and Conquer_ **Update3** : Prizes will be awarded to the top **3 global winners** and the top performers among **NIT Agartala students**. We will contact the winners shortly using the information they provided in the G-form. **Update2** : **Registrations are open now**. **Update1** : As Coding Ninja's Codkaze is scheduled at the same time, **we are postponing our contest by 1 hour. The new time will be 9.00 PM on June 17th**. **Hola Amigos!** Lets embark on an extraordinary voyage of logic and innovation, transcending the mundane programming norms, as we, **Developers & Coders Club, NIT Agartala**, proudly present our legendary event **CP TITANS 4.0** : _The Meme Madness_! Get ready to LOL your way through the coding universe as **CP TITANS 4.0** presents **a code-meme fusion**!, unleashing a si...
programming norms, as we, **Developers & Coders Club, NIT Agartala**, proudly present ourlegendary event **CP

Full text and comments »

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

149.
Codeforces Round 1090 (Div. 4)
By macaquedev, 5 months ago, In English
Codeforces Round 1090 (Div. 4) Hello Codeforces!! I ([user:macaquedev,2026-04-02]) and [user:damamila,2026-04-02] would like to invite all of you to my long-awaited [contest:2218] on [contest_time:2218]! You will be given $6$ or $7$ problems, and you will be given $2$ hours and $15$ minutes to solve them. We hope that you will find the problems interesting, and that all participants will learn at least $6$, $7$ or (ideally) $67$ things. 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 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...
grown to love parts of. - , user-legendary" href="https://codeforces.me/profile/" style="background-position: 83% 50

Full text and comments »

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

150.
Our experience at the Midnight Code Cup
By MladenP, history, 14 months ago, In English
Our experience at the Midnight Code Cup Hey everyone, Last month I participated at the Midnight Code Cup in my hometown with [user:milisav,2025-07-15] and [user:Pajaraja,2025-07-15]. We enjoyed it so much, I made a video with Paja discussing our favorite (and not so favorite) moments. If you're interested in the discussion of the event, problems and general vibe of the onsite, you can check out our video [here](https://youtu.be/Km_9lkzX6z0). Overall, it was incredibly fun, so once again, thanks to the organizers :) <br> <center> <iframe width="480" height="270" src="https://www.youtube.com/embed/Km_9lkzX6z0"> </iframe> </center> I also recorded two interviews during the competition &mdash; as usual, let's give some hints and you can guess the guest in the comments! - He participated at the Midnight Code Cup finals (obviously) - He is a Legendary Grandmaster - Apart from Competitive Programming and math, you can often find him discussing learning languages on his blog First person to guess it gets to ...
finals (obviously) - He is a Legendary Grandmaster - Apart from Competitive Programming and math, - He participated at the Midnight Code Cup finals (obviously) - He is a Legendary Grandmaster

Full text and comments »

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

151.
IOI 2025 Teams
By NajmuddinSabr, history, 16 months ago, In English
IOI 2025 Teams Salam everyone! IOI 2025 is right around the corner and this year it’s heading to Sucre, Bolivia! Drop your country’s IOI 2025 team in the comments. Added $2^6$ country <table> <thead> <tr> <th>Country</th> <!-- говорим, что колонка Members будет занимать две ячейки --> <th colspan="4">Members</th> <th>Average of Max Ratings</th> </tr> </thead> <tbody> <tr> <td>China</td> <td> <a class="rated-user user-legendary" href="/profile/liuhengxi" title="Legendary Grandmaster liuhengxi"><span class="legendary-user-first-letter">l</span>iuhengxi</a> </td> <td> <a class="rated-user user-legendary" href="/profile/crazy_sea" title="Legendary Grandmaster crazy_sea"><span class="legendary-user-first-letter">c</span>razy_sea</a> </td> <td> <a class="rated-user user-legendary" href="/profile/JoesSR" title="Legendary Grandmaster JoesSR"><span class="legendary-user-first-letter">J</...
>

Full text and comments »

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

152.
OpenAI releases o3 and o4-mini
By Misa-Misa, history, 17 months ago, In English
OpenAI releases o3 and o4-mini Hey Codeforces community! You might want to grab your virtual coffee and brace yourselves because the world of competitive programming just got a whole lot more interesting! Remember all those discussions about AI eventually conquering coding challenges? Well, it looks like that future might be closer than we thought. A recent breakthrough from OpenAI is turning heads, and for good reason. Take a look at this: ![ ](https://gcdnb.pbrd.co/images/JnRZ4D93BqVV.png?o=1) The image speaks volumes, showcasing OpenAI's models tackling not just competition math problems (like AIME) with incredible accuracy, but also diving headfirst into the complex world of Codeforces competition code! And the results? Let's just say they're bordering on legendary. The data suggests these models are achieving performance levels that could rival even grandmasters! We're talking about AI that can not only understand intricate coding problems but also generate solutions with remarkable precision....
And the results? Let's just say they're bordering on legendary. The data suggests these models are

Full text and comments »

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

153.
Hello Muscat 2023
By Harbour.Space, history, 4 years ago, In English
Hello Muscat 2023 **<font color="#625bb7">Hello, Codeforces!</font>** We are pleased to announce the second “Hello Muscat 2023” ICPC programming bootcamp, the continuation of the “Hello” bootcamp series, organised by **<font color="#625bb7">Harbour.Space University</font>**, in collaboration with **<font color="#625bb7">PhazeRo</font>**, **<font color="#625bb7">Gutech</font>**, **<font color="#625bb7">UK Oman Digital Club</font>**, **<font color="#625bb7">Leagues of Code</font>**, **<font color="#625bb7">Gutech CS Club</font>** and **<font color="#625bb7">Codeforces</font>**! We are inviting all of you to join us from **<font color="#625bb7">March 8th to March 16th, 2023 in Muscat, Oman for an intense 8 days of programming</font>**! It is not only a great opportunity to train but also a chance to discover a new amazing country. There are many reasons why you must visit Oman at least once in your life, from its great people to its natural beauty and surrounding peace. **March is an especially grea...
finalists, as well as legendary names from the field of competitive programming: Mike Mirzayanov

Full text and comments »

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

154.
Guess the true rating of these users — the magic game is back!
By -is-this-fft-, 8 months ago, In English
Guess the true rating of these users — the magic game is back! Happy New Year! Once again, we can pretend to be legendary grandmasters. However, it is not enough to look like a LGM. One must also act like a LGM. I've found that with a little bit of practice and experience, it is easy to figure out who you are _really_ talking to. By popular request, the [magic game](https://magic.fft.ee/) is back. ![ ](/predownloaded/be/10/be10f825f5cc45876019e4364395da68d5a03cfc.png) I've also added a "your statistics" page so you can keep track of how accurate you actually are. After a few days, you'll also be able to see the statistics for the comments already in the game. #### Play at [magic.fft.ee](https://magic.fft.ee/) Hint: this doesn't include users who are not participating in magic, so you already know the person in the picture is not a real grandmaster.
Happy New Year! Once again, we can pretend to be legendary grandmasters. However, it is not enough

Full text and comments »

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

155.
IOI 2024 Teams
By carcinisation, 2 years ago, In English
IOI 2024 Teams A few days ago, the team selection of Türkiye was completed after a glorious and intense battle. Since no one has posted a blog for the [IOI](https://www.ioi2024.eg/) teams yet, I have taken up the responsibility this year. Here is the IOI team of Türkiye: - Cengiz Eray Aslan ([user:erray,2024-05-12]) — 3rd time at IOI, 0 attempts left - Berke İnan Tol ([user:tolbi,2024-03-28]) — 2nd time at IOI, 0 attempts left - Duru Özer ([user:Weobe,2024-05-12]) — 1st time at IOI, 0 attempts left - Noyan Cantürk ([user:Nummer_64,2024-05-12]) — 1st time at IOI, 3 attempts left I wish the best of luck to all the participants. If you could kindly let me know the members of your team in the comments, I will be happy to update the list of participating teams. Good luck, and see you there! UPD: Added column for max rating average <table> <thead> <tr> <th>Country</th> <th colspan="4">Members</th> <th>Average of Max Ratings</th> ...
>

Full text and comments »

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

156.
There's a Cheater Among Us!
By YoussefMorad1, 20 months ago, In English
There's a Cheater Among Us! ### Hello, Codeforces! In the awesome new [contest:2054], which lasted 21 days, I noticed some *very* **suspicious** activity. It caught my attention, and I wanted to share my observations. ## What Happened? ### Day 20: A new account (Handle: [user:onyeo,2025-01-13]) made its first submission. This account: - Is **a friend of one user**, - Used the "magic tool" to mark itself as **Legendary Grandmaster**, and - Registered **three weeks ago** _[Contest also started 3 weeks ago]_. After submitting two compilation errors, they suddenly submitted a _brilliant_ solution within 10 minutes, landing them **15th** place! *Mmm... fine, maybe they were working offline and didn’t want to test progress on real cases. Suspicious, but plausible.* ### 24 hours later: Another account (Handle: [user:aliqi,2025-01-13]) who: - Is **a friend of one user**, - Used the magic tool to mark itself as **Legendary Grandmaster**, and - Registered **three months ago...
account: - Is **a friend of one user**, - Used the "magic tool" to mark itself as **Legendary, one user**, - Used the magic tool to mark itself as **Legendary Grandmaster**, and

Full text and comments »

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

157.
Introduce the best problem I made
By hirayuu_cf, 2 years ago, In English
Introduce the best problem I made Hello, CodeForces! I am [user:hirayuu_cf,2024-06-14]. I often create problems on [yukicoder](https://yukicoder.me/). By the way, GPT-4o is a hot topic right now. It has a significant impact on competitive programming, such as making it possible to solve typical problems by just copy-pasting, but that's another story. I am a Japanese speaker and cannot speak English very well, but thanks to ChatGPT, I am able to express my thoughts in English like this. Most of this blog, including this text, has been translated by ChatGPT, sorry for any mistakes. Let's get back to the topic. In the past, I co-hosted the [yukicoder contest 424](https://yukicoder.me/contests/486) with [user:Magentor,2024-06-14]. (At the time of writing, I am a Candidate Master, and [user:Magentor,2024-06-14] is a Newbie, but both [Magentor](https://atcoder.jp/users/Magentor) and [I](https://atcoder.jp/users/hirayuu_At) have good results on AtCoder.) Since this is a good opportunity, I would like to share some...
, two Legendary Grandmasters who tackled this problem right away both took about an hour to achieve

Full text and comments »

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

158.
The worst div4 in history?
By macaquedev, history, 2 years ago, In English
The worst div4 in history? So, I joined today's round with pretty high expectations, because I enjoy trying to speedsolve div3's and 4's However, the problems today were truly awful and rife with issues. Let's start with Problem A. It's probably the easiest problem ever seen on this site. As soon as the contest began, submissions poured in by the thousands, clogging up the queue. It was chaos. I ended up submitting C and D before even finding out if my B submission was correct. Speaking of Problem B, it was a nightmare of unclear instructions, leading to a flood of Wrong Answer submissions from thousands of people. "For a better understanding, please check the notes section." Seriously? That’s just pathetic, and *so lazy*... Surprisingly, Problem C was decent, but Problem D? An absolute disaster! The weak pretests allowed a flood of grey Python/C# users to fail miserably when my braindead brute-force hack of: ~~~~~ 1 ?????????????????????????????... abcdefghijklmnopqrstuvwxyzabc... ~~~~~ cause...
of course, the legendary [user:stils,2024-08-06] somehow using some kind of black magic to withstand

Full text and comments »

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

159.
The big idea of cheating
By koil, history, 9 years ago, In English
The big idea of cheating The story of cheating. ------------------ In the last div 2 contest, you guys have noticed that there were nearly 30 fake accounts who took 3rd to 30th places before system testing. The first and second leaderboard page were filled mostly with unrated black guys. Here's a [screenshot](http://codeforces.me/blog/entry/51503?#comment-353667) from another users. **I created them.** I know and acknowledge that this can be called as an act of massive cheating. I didn't intended doing it to steal people's rating and win some div 2 contest. I didn't mind about winning div 2 contest anymore. I did won a few times, kid stuff. I didn't do it just only for fun. Honestly, this small joke is extremely boring itself only. So why did I do that ? The neccessary reason is that I'm currently in my break, so I have a lot of free time. The sufficient reason is to test my **big idea** (not the one you saw). The biggest idea of cheating ------------------ In most...
Imagine someone took the first place in a div 1 contest, beat Legendary grandmasters **without, It's not about the rating or beating legendary grandmasters at all. These things are just illusory.

Full text and comments »

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

160.
I Ported FastOlympicCoding to VSCode!
By CelonyMire, history, 2 years ago, In English
I Ported FastOlympicCoding to VSCode! Welcome to ⚡VSCode FastOlympicCoding!⚡ ------------------ Hello everyone! Some of you may know the [FastOlympicCoding](https://github.com/Jatana/FastOlympicCoding) plugin for Sublime Text, but I took the time to create my version of it in VSCode! ![VSCode FastOlympicCoding Demo](/predownloaded/93/7d/937de4b1468e678b582c2841f22c7ea37f9ccc10.gif) Most things are kept the same, such as the keybindings and the general theme of the UI. Other features differ due to the fundamental asynchronous design and various little things. Some features are cut out because I wanted this extension to **integrate** with other extensions, instead of being "the extension that does it all". For example, the original plugin had debugger support _(even though it was only for OSX)_, and there are many good debugging extensions on VSCode, so it does not make sense for me to provide a crappier debugging experience. #### _So, if you use VSCode, definitely give this a try!_ The extension is not co...
extension that remotely resembles the legendary Sublime Text plugin. Finally, it would be my chance to

Full text and comments »

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

161.
Why Segment Tree is a Myth: Solving 3100-rated problem with a simple for-loop
By zeyd1234, 6 months ago, translation, In English
Why Segment Tree is a Myth: Solving 3100-rated problem with a simple for-loop Hi Codeforces. Today I came across a legendary problem: [problem:896E]. It’s rated $3100$ and is known for being a nightmare for data structure enthusiasts. The tags say "DSU" and "Data Structures," and the intended solutions involve complex Sqrt-decomposition or Segment Tree Beats. But as my future handle suggests -- $SegTreeIsAMyth$. I decided to see if a simple $O(N \cdot M)$ brute force could pass. To my surprise, it didn't just pass: it $crushed$ the tests in $1750ms$ (with a 3s limit)! ####Screenshot: ![ ](/predownloaded/9c/58/9c583e512097f906fe052a947698972b85e52b88.png) ####The Code The core of my solution is just a simple loop. No complex trees, no heavy pointers. ~~~ #include <bits/stdc++.h> using namespace std; #define ll long long #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define yes cout << "YES\n" #define no cout << "NO\n" #define debug cout << "Debug\n" #pragma GCC optimize("O3") #pragma GCC optimize("unroll-...
Today I came across a legendary problem: [problem:896E]. It’s rated $3100$ and is known for being a

Full text and comments »

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

162.
Masterclass by Errichto | GoForGold ICPC Camp
By s_jaskaran_s, history, 6 days ago, In English
Masterclass by Errichto | GoForGold ICPC Camp Hello Codeforces community! =========================== ![ ](/predownloaded/3c/c5/3cc5331a2e4bba4a38f3f9b09cb8bc104c3206c8.png) We are excited to invite you to an exclusive masterclass as part of the **GoForGold ICPC Camp**. Join us for an exclusive Masterclass by the legendary grandmaster, Kamil Debowski ([user:errichto,2024-08-28])! Errichto will walk through advanced problem-solving strategies, discuss fascinating contest problems (including problems authored by him), and share actionable advice on how to level up your competitive programming and ICPC preparation. ### Session Details: * **Speaker:** [user:errichto,2024-08-28] * **Date:** Saturday, 29 August * **Time:** 12:30 PM IST * **Cost:** Completely free and open to everyone ### Live Stream: Watch the session live on YouTube: [Live Stream Link](https://youtube.com/live/0_IVpM_jPpM?feature=share) ### Camp Details & Registration: Check out our previous blog post for complete details about the GoForGold...
Join us for an exclusive Masterclass by the legendary grandmaster, Kamil Debowski ([user:errichto

Full text and comments »

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

163.
MikeMirzayanov is legendary!
By YusifMirzeyev, history, 4 weeks ago, In English
MikeMirzayanov is legendary! If you have ever participated in competitive programming, there is almost no chance that you haven't heard the name Mike Mirzayanov. For millions of programmers around the world, he is much more than a software engineer—he is the person who built one of the greatest communities in programming history. Before Codeforces, many competitive programmers had limited opportunities to practice in an environment that felt like real contests. Mike changed that forever by creating Codeforces, a platform where anyone, regardless of experience, can solve problems, participate in contests, improve their skills, and compete with people from every corner of the world. One of the most remarkable things about Mike is his dedication. Running a platform used by millions is not easy. Servers must stay online, contests must run smoothly, bugs need to be fixed, and new features have to be developed. Despite all these challenges, Codeforces has continued to grow year after year. Codeforces is more th...
MikeMirzayanov is legendary!

Full text and comments »

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

164.
[GYM] UNICAMP Selection Contest 2023
By NaimSS, history, 3 years ago, In English
[GYM] UNICAMP Selection Contest 2023 Yesterday was the UNICAMP Selection Contest and it is now available to everyone! Statements are available in **Portuguese and English** and editorial is available in **Portuguese**. I would like to thank the organization team from UNICAMP Fábio Usberti ([user:bituser,2023-08-12]) and Tiago Domingos ([user:tdas,2023-08-12]), our testers [user:Dranoel321,2023-08-12], [user:emaneru,2023-08-12], [user:Leonardo_Paes,2023-08-12], [user:LoboLobo,2023-08-12], [user:Luca,2023-08-12], [user:MvKaio,2023-08-12], [user:nathan_luiz,2023-08-12] and [user:perchuts,2023-08-12], and [user:LoboLobo,2023-08-12] for coming with the idea for problem H &mdash; "Team Division". Congratulations for our top 3 winners: 1. [user:defnotmee,2023-08-12] 2. [user:enzopsm,2023-08-12] 3. [user:luiz_oda,2023-08-12] The contest was done in memorial of Technoblade, legendary Minecraft Youtuber, so he will appear in a lot of the problems. I hope you enjoy, and remember, [user:TechnobladeNeverDies,2023-08-...
The contest was done in memorial of Technoblade, legendary Minecraft Youtuber, so he will appear in

Full text and comments »

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

165.
Announcement: 2nd Hello Muscat ICPC Programming Bootcamp
By Harbour.Space, history, 7 years ago, In English
Announcement: 2nd Hello Muscat ICPC Programming Bootcamp Hello, Codeforces! We are thrilled to announce the second instalment of our **Hello Muscat ICPC Programming Bootcamp**, organized by **Harbour.Space University** in collaboration with **Codeforces**, **ITMO University**, **GUtech University**, and our local partner: **Phaze Ventures**. The Bootcamp’s main sponsor is **British Petroleum (BP)**, supporting Oman’s national priorities: youth development, economic diversification and job creation. We are also excited to let you know that **Codeforces** has become the **main collaborator of Harbour.Space** for our programming bootcamp series, and will be in charge of **all the educational content**, from contests to problem analysis and lectures, bringing the online legacy of the platform to a **unique offline experience**. Hello Muscat will take place during **19 – 25 March 2020** and will feature ICPC world champions and finalists as well as legendary names from the field of competitive programming: Mike [user:MikeMirzayano...
and finalists as well as legendary names from the field of competitive programming:

Full text and comments »

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

166.
Congratulations tourist!
By Wind_Eagle, history, 2 years ago, In English
Congratulations tourist! Congratulations to [user:tourist,2024-08-29] on an outstanding achievement! In an incredible and dramatic fight for seconds, he was able to reach the legendary 4000 rating mark! This is truly amazing! I would like to wish him continued success and victories!
dramatic fight for seconds, he was able to reach the legendary 4000 rating mark! This is truly amazing

Full text and comments »

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

167.
Hello Muscat 2023
By Harbour.Space, history, 4 years ago, In English
Hello Muscat 2023 **<font color="#625bb7">Hello, Codeforces!</font>** It is the last call to register for the 2nd “Hello Muscat 2023” ICPC programming bootcamp, the continuation of the “Hello” bootcamp series, organised by **<font color="#625bb7">Harbour.Space University</font>**, in collaboration with **<font color="#625bb7">PhazeRo</font>**, **<font color="#625bb7">Gutech</font>**, **<font color="#625bb7">UK Oman Digital Club</font>**, **<font color="#625bb7">Leagues of Code</font>**, **<font color="#625bb7">Gutech CS Club</font>** and **<font color="#625bb7">Codeforces</font>**! We are inviting all of you to join us from **<font color="#625bb7">March 8th to March 16th, 2023 in Muscat, Oman for an intense 8 days of programming</font>**! It is not only a great opportunity to train but also a chance to discover a new amazing country. **March is an especially great time to visit Oman if you want to enjoy nice beach weather &mdash; don’t miss it!** As always, we can’t wait to see you there to l...
finalists, as well as legendary names from the field of competitive programming: Mike Mirzayanov

Full text and comments »

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

168.
What Happens If Two Bots Play Perfect Chess?
By Gkishor, history, 13 months ago, In English
What Happens If Two Bots Play Perfect Chess? ![ ](https://images.stockcake.com/public/f/e/e/fee9ff18-b319-4ebc-a967-1712edf4c8e0_large/robotic-chess-duel-stockcake.jpg) Hey everyone! We all know the game of chess — it's one of the oldest and most loved board games in the world. It's a game of logic, patience, and smart planning. But the other day, an interesting question came to my mind: __What would happen if two bots (or computers) played a game of chess against each other, and both of them played perfectly?__ Since white always moves first, does that mean white will always win? Or will the game always end in a draw? Or maybe black has some hidden trick to win even though it moves second? This is a really deep question — and it’s something that even chess experts and grandmasters have thought about. Is Chess a Solved Game? ------------------ You might have heard about games like Tic-Tac-Toe. That game is “solved,” which means if both players play perfectly, it always ends in a draw. No one ca...
### What Do Grandmasters Think? Some legendary grandmasters believe that if chess is ever solved

Full text and comments »

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

169.
+35 (iq) challenge
By 300iq, history, 8 years ago, In English
+35 (iq) challenge If I don't become the legendary grandmaster before the new year, I’ll dye my hair pink for a week.
If I don't become the legendary grandmaster before the new year, I’ll dye my hair pink for a week.

Full text and comments »

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

170.
Congrats to CauchySheep — an IMO2019 participant on becoming LGM at an incredible age!
By ouuan, history, 7 years ago, In English
Congrats to CauchySheep — an IMO2019 participant on becoming LGM at an incredible age! At only age 16, [user:CauchySheep,2019-06-08](Mingyang Deng) reached Legendary Grandmaster on [contest: 1172]. What's more, he won the first place in the Chinese team selection for IMO2019 and will be a participant of IMO2019. It's a pity that IMO2019 and NOI2019 (a necessary step in Chinese team selection for IOI) are conflicted in time, and he will probably not be able to participate in IOI2020. However, he's in grade 10 now, so he still has the chance to participate in IOI2021. Congratulations!
At only age 16, [user:CauchySheep,2019-06-08](Mingyang Deng) reached Legendary Grandmaster on

Full text and comments »

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

171.
Codeforces Round #165
By gen, 14 years ago, translation, In English
Codeforces Round #165 Hello everyone! Codeforces round #165 will start today at [19:30 in Moscow time]( http://timeanddate.com/worldclock/fixedtime.html?day=1&month=2&year=2013&hour=19&min=30&sec=0&p1=166). It will be a round held in both divisions, the first one after a long two-week break for Div I participants. :) This time the problems were prepared by me, Evgeny Vihrov ([user:gen,2013-02-01]), and Krisjanis Prusis ([user:cfk,2013-02-01]). Apart from competing together in ACM ICPC this year, we are also colleagues in a project that involves much algorithmic thinking. Actually, some of the contest problems were born during the work on this project. In this contest you will get to know a legendary hero Emuskald of many talents and help him complete his ingenious ideas. The problems cover a multitude of algorithmic concepts, so as always we hope that each participant will find a problem that matches his taste. Big thanks to Gerald Agapov ([user:Gerald,2013-02-01]) for help during the preparatio...
In this contest you will get to know a legendary hero Emuskald of many talents and help him

Full text and comments »

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

172.
Congratulations tourist!
By loyalixa, history, 2 years ago, In English
Congratulations tourist! The legendary Gennady Korotkevich, known as "<a href="/profile/tourist" title="Tourist tourist" class="rated-user user-4000"><span class="user-4000-first-letter">t</span>ourist</a>" has once again redefined the limits of competitive programming! In an extraordinary display of skill and determination, he broke his own record of **3979**, achieving an astounding new rating of **4009**—the highest ever reached in history. This achievement not only cements his status as the greatest but also sets a new benchmark for excellence in the field. In recognition of his unparalleled accomplishments, Codeforces has introduced a new rank above the "Legendary Grandmaster" titled "Tourist," celebrating his unmatched contributions and impact on the competitive programming community. This new rank stands as a testament to his exceptional talent, relentless spirit, and the legacy he continues to build. The **[Loyalixa](https://www.facebook.com/loyalixa/)** team proudly congratulates Gennady...
"Legendary Grandmaster" titled "Tourist," celebrating his unmatched contributions and impact on the, The legendary Gennady Korotkevich, known as "

Full text and comments »

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

173.
The Hidden Inequality in Competitive Programming
By bonessonlyyy, history, 15 months ago, In English
The Hidden Inequality in Competitive Programming The Hidden Inequality in Competitive Programming: Why CP Is Not Global Yet Competitive Programming (CP) is often celebrated as a meritocratic, borderless arena where anyone with a laptop and an internet connection can rise to the top. But beneath the surface, there’s a reality we rarely discuss: **CP is not a level playing field, and it’s far from truly global.** Awareness: The First Barrier In some countries—Russia, China, Poland, and a handful of others—CP is a well-known, even prestigious pursuit. Students are introduced to Olympiad math and programming early, and there are established school clubs, training camps, and experienced mentors. By university, many have years of CP exposure. But for most of the world, CP is invisible: - It’s not taught in schools. - There are no local contests, clubs, or teachers. - Most students discover CP by accident, often late—maybe while prepping for interviews or stumbling on a YouTube video. Result: Many talented minds never ...
Let’s be honest: Codeforces and similar sites are legendary for their problem archives—but their

Full text and comments »

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

174.
Legendary Grandmaster in 2000 days. Day 1083 of 2000.
By -is-this-fft-, history, 2 years ago, In English
Legendary Grandmaster in 2000 days. Day 1083 of 2000. Today I did absolutely nothing.
Legendary Grandmaster in 2000 days. Day 1083 of 2000.

Full text and comments »

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

175.
What to do if you've reached Candidate Master in 2025
By EntityPlantt, history, 9 months ago, In English
What to do if you've reached Candidate Master in 2025 <a class="rated-user user-violet">Candidate Master</a> is a rank after <a class="rated-user user-blue">Expert</a> and before <a class="rated-user user-orange">Master</a> that represents a smooth transition between these two ranks. Its meaning to the community is that you're more than a competitor and you're invested in the platform. People will now recognize you more and take you more seriously. Of course, you'd expect that purple color you got gives you more perks. Well, look no further because I've written some stuff that may interest you, that's accessible once you become <a class="rated-user user-violet">CM</a>. [cut] ­ Getting to Candidate Master is no joke. My first ever Codeforces competition was [Round 885](https://codeforces.me/contest/1848), which was more than two years ago. Given my background in CP I got to Expert in only 9 competitions, but then I stayed for over a year in that layer because Codeforces competitions simply have different tasks from local competitions...
-legendary">LGMs) are gathered and discuss everything. I'm new in these communities because I got to

Full text and comments »

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

176.
Spring 2025 Rutgers Programming Contest Open
By nickbelov, history, 17 months ago, In English
Spring 2025 Rutgers Programming Contest Open Once again, the legendary problem-setting team at RUCP (Rutgers Competitive Programming) is holding a contest. We are excited to invite you all to participate in the open mirror of the [Spring 2025 Rutgers Programming Contest](https://rucp-contest.github.io/)! The contest will start [Sunday, April 13, 2025 at 1:00 PM EDT (UTC-4)](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Spring+2025+Rutgers+Programming+Contest&iso=20250413T13&p1=5276&ah=5). The Spring Contest is a 5-hour long ICPC-style team contest consisting of 14 problems. Team sizes can be anywhere from 1 to 3 people. Teams of more than one person are kindly requested to only use one computer for the contest. This contest was authored by [user:jdurie,2025-04-11], [user:nickbelov,2025-04-11], [user:ScalarField,2025-04-11], [user:jim,2025-04-11], and [user:bobbilyking,2025-04-11]. We would also like to thank our sponsors, the [Rutgers University Department of Computer Science](https://www.cs.rutgers.edu/) and [W...
Once again, the legendary problem-setting team at RUCP (Rutgers Competitive Programming) is holding

Full text and comments »

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

177.
Thank You tolbi
By ItsNotMeItsYou, 2 years ago, In English
Thank You tolbi I started coding after discovering about tolbi's history in cp, so, to honor him, I made a drawing of him. Thank you <a href="/profile/tolbi" title="Legendary Grandmaster tolbi" class="rated-user user-legendary"><span class="legendary-user-first-letter">t</span>olbi</a> for inspiring me to begin learning such an incredible subject. ![ ](/predownloaded/19/b7/19b7c77e3530ca08e6bcfa3566f98b6ae8366eed.jpeg)
of him. Thank you

Full text and comments »

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

178.
Topcoder is great again?
By riela, history, 8 years ago, In English
Topcoder is great again? _Mwa ha ha ha ha I'm the mad sports programmer (sp) Hououin Riela! The organization sent my archnemesis "teja[put some numbers here]" to interfere with our operations. However I'll break the convergence to change the worlds control structure._ __ To the point gentlemen, in my opinion, topcoder was always one of the best sp sites. The main problem with tc is that we have to use an applet to compete, and you have to install java, configure security options, then configure plugins, ... They tried to create a web arena, however it was a failure (you can't even practice in that arena, and there are no plugins). Afaik, they are again constructing a new arena (not sure how is the current status). Some people think that the rating formula in tc is not accurate, there are usually 3 problems, there are no strong pretests and sometimes even reds end up without solving a single problem! and that cause big fluctuations in rating. However, I think that the rating formula is good, and you...
Usually tc provides high quality problems (they used to have a legendary admin), however imho the

Full text and comments »

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

179.
Lads, I have done it.
By TheOpChicken123, history, 4 years ago, In English
Lads, I have done it. On the 1st December, 2022, I decided that by the end of 2022, I want to reach expert. I had commented this goal on to many blogs of the type, "what is your goal for the end of 2022", cementing my resolution in the internet, for all to see. having a great two first contests in december, i shot up all the way from 1370, to 1589. However, in my penultimate contest of 2022, I had a terrible one. I dropped 34 points and was now 1555. All the pressure mounted on the last contest of 2022. And i had to do well When the contest started, I got off to a terrible start. I used a set, instead of a multiset to store the elements of the array. And this was a fatal mistake. It took me a whole 30 minutes of debugging and 1 incorrect submission to fix it, after which i was well behind. I was the 7 thousandth person to solve the first question. However, after this, my brain went into overdrive mode. I solved the second question and third question both in under 30 minutes. And i had a whole hour...
in yourself, no matter what happens. This is also why I aim to become a legendary grandmaster by

Full text and comments »

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

180.
Аура монстр
By Dedei, history, 3 weeks ago, In Russian
Аура монстр lowkey я вообще не стараюсь выглядеть круто — **оно само как-то происходит**. я захожу в комнату, ничего не говорю, просто стою. и уже чувствуется: **аура +1000, присутствие +500, confidence без патча.** не flex, просто факт. не loud, просто **могнул**. не attention seeker, просто внимание почему-то само находит. bro really thought i was gonna explain myself nah, **i'm lowkey chilling.** мне не нужен spotlight. я сам себе spotlight. мне не нужен статус. **мой вайб — уже статус.** кто-то строит образ — я просто существую. кто-то пытается показать aura — у меня она passive. кто-то фармит respect — у меня он капает автоматически. **stay lowkey. move smart. say less.** пока они пишут длинные тексты о том, какие они sigma, я просто: *«пон.»* и ухожу в закат. no drama. no beef. no unnecessary yap. только спокойствие, музыка в наушниках и ощущение, что **main character energy уже активирована.** мне говорят: «ты изменился». bro… **я просто перестал об...
lowkey legendary. highkey unbothered. mentally offline. physically present. emotionally **aura**.

Full text and comments »

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

181.
Newbie coulour NEED to be changed
By Hectorungo_18, history, 4 years ago, In English
Newbie coulour NEED to be changed I know some people will disagree, but I'm going to explain with facts why this change must be make. First I let you to try to think why. <spoiler summary="Fact 1"> Gray is trash. Poop colour is just perfect. </spoiler> <spoiler summary="Fact 2"> Grey doesn't fit. <spoiler summary="Hint 1"> Think about the relation between the name of colours and your handle. </spoiler> <spoiler summary="Hint 2"> They may keep something in common with its next handle and with the previous one. </spoiler> <spoiler summary="Hint 3"> Observe the codeforces logo. </spoiler> <spoiler summary="Solution"> We just need to think about the fact that every handle colour is either smaller (lexicographically talking) than the previous and the next handle or bigger than those. Let's see it: Pupil-Green Specialist-Light Blue Expert-Blue Candidate Master-Purple Master-Flesh Colour International Master-Orange Grandmaster-Light Red Internatio...
International Grandmaster-Red Legendary Grandmaster-Garnet

Full text and comments »

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

182.
Aura monster
By Dedei, history, 3 weeks ago, In English
Aura monster Lowkey, I’m not even trying to look cool — **it just happens naturally.** I walk into the room, say nothing, just stand there. And somehow you can already feel it: **aura +1000, presence +500, confidence with no patch required.** Not flexing, just facts. Not loud, just **mogging**. Not an attention seeker — attention just seems to find me. Bro really thought I was gonna explain myself? Nah, **I’m lowkey chilling.** I don’t need the spotlight. **I am the spotlight.** I don’t need a status. **My vibe is already the status.** Some people build an image — I just exist. Some people try to show their aura — mine is passive. Some people farm respect — **mine generates automatically.** **Stay lowkey. Move smart. Say less.** While they’re writing entire essays about how sigma they are, I just go: *“Bet.”* And walk into the sunset. No drama. No beef. No unnecessary yap. Just peace, music in my headphones, and the feeling that **main character energy has already...
Lowkey legendary. Highkey unbothered. Mentally offline. Physically present. Emotionally **aura.**

Full text and comments »

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

183.
Thank You Ahmet23
By tolbi, 4 years ago, In English
Thank You Ahmet23 I started coding after discovering about ahmet23's history in cp, so, to honor him, I made a drawing of him. Thank you <a href="/profile/ahmet23" title="Legendary Grandmaster ahmet23" class="rated-user user-legendary"><span class="legendary-user-first-letter">a</span>hmet23</a> for inspiring me to begin learning such an incredible subject. ![ ](/predownloaded/96/b9/96b9b1515f8f0262b4ed69d524c8149c13153183.jpeg)
drawing of him. Thank you

Full text and comments »

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

184.
YouKn0wWho's Topic List
By BinaryBubble, history, 23 months ago, In English
YouKn0wWho's Topic List ### Hello guys! Most of you know about the legendary one stop CP Topic List created by [user:YouKn0wWho,2024-10-06] (for those who don't know can check it out [here](https://codeforces.me/blog/entry/129419)). Personally I'm not a fan of this cool UI in CP related things. I like it to be simple and it was too complex for my cyan brain to understand. (really personal opinion so don't jump on me for that :D) So what i did is i scraped the ultimate topic list and put it all in a spreadsheet for me and y'all to have it. Here's the link: [CP Topic List](https://docs.google.com/spreadsheets/d/1YfQz0RgE4AIgSyC_BVDLVfoeBUJYcUNxbd1VvQEfFFU/edit?gid=1486069146#gid=1486069146) (Jus make a copy and you'll be able to edit it as your personal sheet) Here's an SS of how my personal one looks like :P ![My Sheet](https://gcdnb.pbrd.co/images/VrirAgFQR6Gb.png?o=1) There's two things I'd also like you to know about this list. - You can **sort** everything by **Serial Number** ...
Most of you know about the legendary one stop CP Topic List created by [user:YouKn0wWho,2024-10-06

Full text and comments »

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

185.
Logging in on contest.yandex.com for the first time...
By maximaxi, history, 11 years ago, In English
Logging in on contest.yandex.com for the first time... Hey, this is a humor post because it's New Year's. I appreciate your time here and I hope this will brighten your day a little. :) It's a chronicle of my first adventure on Yandex Contests. ![a](http://i.snag.gy/FRDFd.jpg) Cool, so this is what [Yandex Contests](https://contest.yandex.com) looks like. ![a](http://i.snag.gy/J33ZG.jpg) Wait, mother of god... **I'M A LEGENDARY GRANDMASTER!!** ![a](https://lansingchurch.files.wordpress.com/2014/02/1723893-875275-firework-streaks-in-night-sky-celebration-background.jpg) ![a](http://images.huffingtonpost.com/2014-05-29-iStockHuffPostCelebrationMay2920142.jpg) ![a](https://media.licdn.com/mpr/mpr/shrinknp_800_800/AAEAAQAAAAAAAAOJAAAAJDY5YTU2OTAzLWI2NGMtNDM4Ni1hYThkLTBiNDA5NGY0YzMzMA.png) ![a](http://i.snag.gy/BVlYX.jpg) YESSSSSSSSSSSS W-wait a minute... *Why* am I suddenly a legendary grandmaster, exactly? ... **looks to the upper-left corner** ![a](http://vignette3.wikia.nocookie.net/randomstuffstuff/im...
*Why* am I suddenly a legendary grandmaster, exactly?, Wait, mother of god... **I'M A LEGENDARY GRANDMASTER!!**

Full text and comments »

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

186.
EDIT RATING OF A PROBLEM
By stalkkk_19, 4 years ago, In English
EDIT RATING OF A PROBLEM ### **Hello** _[Candidate Master, Master, ........Legendary Grandmaster]_ `I want to know how do you guys decide what is the tag of a particular problem` what do I believe till yet is maybe its because of time taken by you generally to solve a particular problem or the no of submission maybe a factor to judge but what does it mean `1300 or 1400 rating problem` `` ~~~~~ what is the difference when we increase a 100 rating point ~~~~~ I am asking this because many time many old problem rating is very high but actually the solution they contain is very standard <: `Atlast can any top coder differentiate what the particular Rating demand which type of focus on the that rating problem ` for example ~~~~~ when I solve problem of 1300 DP its come as a very standard one when i solve problem of 1600 DP its come with a tricky DP or some other data structure when I solve problem of 1900 DP its come with a very hard optimization of state and tra...
### **Hello** _[Candidate Master, Master, ........Legendary Grandmaster]_

Full text and comments »

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

187.
some dull CF statistics: vanishing rating points
By Noureldin, history, 6 years ago, In English
some dull CF statistics: vanishing rating points things to do in quarantine <ul> <li> <s>train to be better at CP</s> </li> <li> <s>get some work done</s> </li> <li> generate some CF statistics </li> </ul> #### vanishing rating points so I ran a python script that collected all rating changes of every rated round and I found some <s>interesting</s> stuff which can be found at the end of blog, however the thing that caught my attention is that rating points are vanishing at a rate of ~5.483 points/round/contestant!!! the average rating change is negative ~ -5.483 points/contestant/round which is weired, you would expect that number to be around zero since the rating system <a href='https://codeforces.me/blog/entry/102'>scales everything</a> so that the sum of ratings of contestants after each round remains the same as it was before the round, maybe a side effect of rounding ? to verify this I compared the sum of rating of all rated accounts against what it should be, there are 258434 accounts that competed in at le...
>198.0 Legendary Grandmaster8.0 31.25 54.0

Full text and comments »

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

188.
Gemini 3 Deep Think claims 3455 Elo on Codeforces (Legendary Grandmaster?)
By dhuamanilu, history, 7 months ago, In English
Gemini 3 Deep Think claims 3455 Elo on Codeforces (Legendary Grandmaster?) Just saw the news regarding the release of Gemini 3 Deep Think (12 Feb 2026) and the benchmarks are getting crazy. According to their latest technical report, this new model achieves a Codeforces Elo of 3455. ![ ](https://storage.googleapis.com/gweb-uniblog-publish-prod/original_images/gemini_3_deep-think_evals_charts_1.gif) That puts it deep into Legendary Grandmaster territory. What makes this more impressive is that the benchmark specifies this was achieved with "No tools", meaning it's raw generation without code execution support during the contest simulation. ![ ](https://storage.googleapis.com/gweb-uniblog-publish-prod/original_images/gemini_3_deep-think_evals_table_1.gif) Has anyone with early access tested it on recent Div 1 rounds?
Gemini 3 Deep Think claims 3455 Elo on Codeforces (Legendary Grandmaster?), /gemini_3_deep-think_evals_charts_1.gif) That puts it deep into Legendary Grandmaster territory. What, That puts it deep into Legendary Grandmaster territory. What makes this more impressive is that the

Full text and comments »

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

189.
Invitation to AstroByte 2023
By ankancool, history, 3 years ago, In English
Invitation to AstroByte 2023 Hello, Codeforces! We are glad to invite everyone to **AstroByte 2023** jointly organised by [**Grimoire of Code, IIT Kharagpur**](https://www.facebook.com/goc.iitkgp) and [**spAts, IIT Kharagpur**](https://www.facebook.com/spAts.iitkgp) under [**National Students' Space Challenge 2023**](https://nssc.in). The round is scheduled on [Saturday, October 7, 2023 at 09:00<sup>IST</sup>](https://www.timeanddate.com/worldclock/fixedtime.html?msg=AstroByte&iso=20231007T09&p1=1885&ah=2). You will be given **6 problems** and **2 hours** to solve them. The difficulty of the problems varies from **800** to **2000**. **Note:** The contest is **unrated**. The problems have been prepared by Grimoire of Code members Ankan [user:ankancool,2023-10-06] Garai and Teerath [user:teerath_482,2023-10-06] Agarwal. We would like to thank: - Mainak [user:NewTech66,2023-10-06] Roy, Aryan [user:Aryan_XY,2023-10-06] Kumar, Swadhin [user:majhiswadhin64,2023-10-06] Majhi, Neelarghya [user:uleenneelu...
://codeforces.com/profile/"> You

Full text and comments »

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

190.
Codeforces Rating Card API
By pruv007, history, 6 years ago, In English
Codeforces Rating Card API Hello, I have created an API that generates a **rating card** of your performance on Codeforces. Its very **simple to use**, just embed the url into an image src and you will get your own CF rating Card. **Usage**<br> - E.g : `<img width='50%' src='https://pruvi007-apis.herokuapp.com/CF/pruv007 />'`<br> - API Url : https://pruvi007-apis.herokuapp.com/CF/your_handle_on_CF <br> - You can use this on your **own websites** to show your CF performance.<br> - You can also add this to your **Github profile Repository**.<br> - In fact, you can use this wherever you want !!<br> Following are some example rating cards of various users -> **Specialist Card**<br> ![ Specialist-Card-pruv007-ME ](https://firebasestorage.googleapis.com/v0/b/numbergame-8d811.appspot.com/o/Screenshot%20from%202020-07-21%2009-50-19.png?alt=media&token=bc2f9fac-db95-48e2-9955-a94a31f95e88) **Expert-Card**<br> ![Expert-Card ](https://firebasestorage.googleapis.com/v0/b/numbergame-8d811.appspot.com/o/...
**Legendary Grandmaster Card** ![ Legendary-GM-Card ](https://firebasestorage.googleapis.com

Full text and comments »

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

191.
Rising From "Confidently Mediocre" Tier to "Slightly Competent" Tier.
By livenlife453, history, 7 weeks ago, In English
Rising From "Confidently Mediocre" Tier to "Slightly Competent" Tier. After rising up from the "My Mom Says I'm Good At Programming" tier to the "Confidently Mediocre" tier, I have now reached the "Slightly Competent" tier. With this progression I can now engage in activities such as impressing my 7th grade math teacher, convincing my dad to love me 3.45% more (0*1.0345=0), and having a full conversation with a woman. If I keep improving myself, I may eventually reach the "Moderately Decent" tier, the "I'm a Master*****" Tier, or even the "I'm smart I can work pls hire me pls" tier. If I do this, I can impress more than just my 7th grade math teacher. I can also impress my 9th grade math teacher, and my dad will love me 12.84% more. Surely if this happens I can hide how unbelievable disturbing of a person I am to my friends. From there, the only way forward is through a small trip in the "Legendary Extreme Super Competent For Sure. I'm Even Better Than ChatGPT" tier, a much longer stay in the "Okay You're Actually Pretty Good I Can't Criticize Yo...
From there, the only way forward is through a small trip in the "Legendary Extreme Super Competent

Full text and comments »

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

192.
Incorrect flag of Lesotho
By Aerin, history, 2 months ago, In English
Incorrect flag of Lesotho There is one massive problem on codeforces that no one addressed yet for some reason. And that problem is the incorrect flag of Lesotho. ![ ](/predownloaded/dc/b2/dcb250485482ec5ce510a84b0cce6bcd2820f58a.png) This is the flag of Lesotho that is used on Codeforces. Zoom in. ![ ](/predownloaded/7b/7e/7b7ec79da8919aa380a84d4b25092894325d60df.png) Notice anything strange? You're right, this flag isn't used since 2006! If you still don't see the problem, we can go on the official Wikipedia page for the flag of Lesotho to prove our point. ![ ](/predownloaded/49/88/49884f4aa2643735d60038c8950a2ab249f60909.png) If you didn't believe me before, now you can see it for yourself. ![ ](/predownloaded/42/ba/42ba5d1476f39dd30c822daaa2e43a566d88dffc.png) Btw, the flag above is the current flag of Lesotho. Yes, they're very different. This problem is massive and should be fixed. [user:MikeMirzayanov,2026-06-20], what is this? I literally can't solve any problems because of the ...
a legendary grandmaster by now. Please fix this.

Full text and comments »

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

193.
From Newbie to Legendary Grandmaster... Let the journey begin !
By DR.MANHATTAN, 9 years ago, In English
From Newbie to Legendary Grandmaster... Let the journey begin ! **This page will focus on all the coding contests I participate in , on various online judges**__ I intended to keep track of the progress I make through participating in these online contests. I will reflect on the questions that were asked in each contest, to gauge my progress and understanding. The following is the rating system followed by Codeforces. Sadly, right now I'm in the bottom rung of the rating ladder ( **Newbie** :-| ). ![ ](/predownloaded/07/4a/074a7cb7fb181ec44668735a1971367d6bc2e09d.jpg) However, I do intend to get to the top ( **Legendary Grandmaster** ;) ) . Don't know how long that would take, but it's sure going to be an interesting journey. **Let's begin.....**
From Newbie to Legendary Grandmaster... Let the journey begin !, However, I do intend to get to the top ( **Legendary Grandmaster** ;) ) . Don't know how long that

Full text and comments »

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

194.
Cheaters in Round 1033 [For the admins and authors]
By S3CR3T_CP, history, 14 months ago, In English
Cheaters in Round 1033 [For the admins and authors] As we all know, there were a lot of cheaters in the last [**Div.2**](https://codeforces.me/contest/2120). Here is a list of cheaters among the [top 10](https://codeforces.me/contest/2120/standings): - [user:souvik222,2025-06-22] (Obvious ChatGPT code, bro didn't even have time to remove comments) - [user:Egor12p,2025-06-22] (Bro copy and pasted GPT Code, Used multiple languages, and didn't have time to remove comments) - [user:Yolandina,2025-06-22] (Code for D matches with [user:Egor12p,2025-06-22]) - [user:sudo013,2025-06-22] (Tried to obfuscate the code for D, which is illegal itself, but also it matches with [user:Egor12p,2025-06-22]) - [user:heehey12,2025-06-22] (Same thing, their code for D matches with the legendary [user:Egor12p,2025-06-22]) I request [user:MikeMirzayanov,2025-06-22] and [user:KAN,2025-06-22] to take serious action against cheating in the contest. Second, these might not be the only ones in the top 10; there might be more. Third, if there are...
- [user:heehey12,2025-06-22] (Same thing, their code for D matches with the legendary [user:Egor12p

Full text and comments »

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

195.
Meet 3 of the best coders from India
By rachitiitr, history, 9 years ago, In English
Meet 3 of the best coders from India Hi I went live with a [video session](https://www.youtube.com/watch?v=N98xDHZfwsQ) with some talented juniors from my college: 1. [user:gvaibhav21,2018-02-17] 2. [user:RonnieOSullivan,2018-02-17] 3. [user:adkroxx,2018-02-17] Congratulations [user:adkroxx,2018-02-17] for becoming orange :) They are popularly known as the team "Triangulation" in India, and will be going to ACM ICPC World Finals this year. Watch the [video](https://www.youtube.com/watch?v=N98xDHZfwsQ) to know a bit more about them, their journey, and grab their advices on preparation for ACM ICPC and Competitive Programming. Comment down your questions on YouTube video if they were not covered in the video itself. I wish great success for Triangulation and hope India produces more such legendary coders in the coming future. Happy Coding!
I wish great success for Triangulation and hope India produces more such legendary coders in the

Full text and comments »

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

196.
A fixed version of the codeforces dark theme plugin
By farkon00, history, 2 years ago, In English
A fixed version of the codeforces dark theme plugin To install it [click here](https://github.com/farkon00/codeforces-darktheme?tab=readme-ov-file#download-instructions) for instructions. You will need to have Tampermonkey installed to run it, but the installation instructions will tell you how to do that, if you don't know how to yourself. Today I've found a perfect for me dark mode plugin made by [user:sigma_g,2024-05-28] and greatly improved on by [user:Lord_David,2024-05-28]. Sadly it was broken and unmaintained for over 2 years, so I've decided to fix it and improve it a bit. So a new dark theme plugin was born, which you can now use yourself. ![An example screenshot](https://github.com/farkon00/codeforces-darktheme/blob/master/imgs/screenshot.png?raw=true) The plugin also slightly tweaks the rating colors for them to look nicer on a dark background, you can see the table of changed colors [here](https://github.com/farkon00/codeforces-darktheme?tab=readme-ov-file#rating-color-adjustments). Also you might have noticed th...
nutella. The word nutella here refers to the legendary grandmaster rating color scheme(the first

Full text and comments »

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

197.
Codeforces Round 1028 (Div. 1, Div. 2)
By Gellyfish, 15 months ago, In English
Codeforces Round 1028 (Div. 1, Div. 2) Hello, Codeforces! I'm pleased to invite you to [contest:2115] and [contest:2116]. It starts on [contest_time:2115]. This means that Children's Day will come during this round. I'm sure everyone will be impressed with Children's Day, even if they're no longer children. I remember when I was a kid, I always looked forward to Children's Day. On Children's Day, there were always candies and fun activities at school. But as I grew up, this festive atmosphere was diluted by the trivialities of life. But luckily, we had Codeforces. Spending the holidays with interesting problems doesn't actually have to be more boring than candies and activities ¯\\_(ツ)_/¯ This will be the second round I've hosted on Codeforces. To make it better, this time I've called on my friend [user:MagicalFlower,2025-05-28] to help me organize this round. Also, [user:errorgorn,2025-05-28] has helped us very much, we are fully indebted to this well known &#128056; on Codeforces! For both divisions, you will ...
-05-28], [user:qiuzx,2025-05-28] and [user:275307894a,2025-05-28] for Legendary Grandmaster Testing

Full text and comments »

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

198.
The state of Codeforces
By Iightcode, history, 8 years ago, In English
The state of Codeforces Recently I have witnessed some insults to the greatness of Codeforces. A recent blog post by [user:emsiNUS,2018-10-08] titled "Please read this" was just downvoted into oblivion. The contents of this post were entirely meaningless; truly a deep and intriguing commentary on the meaning of modern life in the information age. But that is not central to the point here. Fourteen months ago [user:DEGwer,2018-10-08] made a [similar post](http://codeforces.me/blog/entry/53901), he reached 100 upvotes for similar (but perhaps overly lengthy) commentary. How is it, friends, that one post may acquire so many upvotes, while the other acquires the same magnitude of votes in the opposite direction? The answer is simple: a degradation of moral values; a tendency to vote for whoever has the brightest color. Friends, Codeforcians, countrymen, lend me your ears. It is time for us to eliminate the colorism that is the blight on our glorious empire. Did you know that for every rating p...
that for every rating point a specialist has, a legendary grandmaster has two? But specialists

Full text and comments »

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

199.
Breaking Limits at 14: Harvard CS50, My Book, and a New Learning Platform
By Aylin_198765, history, 13 months ago, In English
Breaking Limits at 14: Harvard CS50, My Book, and a New Learning Platform Hello Codeforces! At 14, I’ve reached three milestones that prove age is no barrier to ambitious goals: Conquered Harvard’s legendary CS50 course — the one many adults drop halfway through Written and published my first book on decision-making Built and launched my own learning & project platform from scratch No formal CS background — just persistence, curiosity, and a lot of debugging (in code and in life). This is the full story — the challenges, the strategies, and why I believe mindset matters far more than age in tech. (You can see the full post here: https://www.facebook.com/share/p/1DKy9HBr39/) [cut] Hello everyone! I have three incredible milestones to share — and I’m both excited and humbled to reveal them. At just 14 years old, these achievements show that age is no barrier to serious learning, creativity, and impact. I COMPLETED Harvard’s most demanding computer science course: CS50 — and I didn’t just pass, I thrived. Harvard’s CS50 is globally known for ...
goals: Conquered Harvard’s legendary CS50 course — the one many adults drop halfway through Written

Full text and comments »

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

200.
What is your personal goal for 2023?
By colposh, 4 years ago, In English
What is your personal goal for 2023? What is your personal goal for 2023? - Pupil &mdash; - Specialist &mdash; - Expert &mdash; - Candidate Master &mdash; - Master &mdash; - International Master &mdash; - Grandmaster &mdash; - International Grandmaster &mdash; - Legendary Grandmaster &mdash; - Petition for [user:MikeMirzayanov,2022-12-30] to hand out Headquarters role for New Year wishes &mdash; jk Hopefully the new year will be significantly better than this year!
- Legendary Grandmaster —

Full text and comments »

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

201.
What if top 20 coders complot? Bill Gates conspiracy theory
By letonge, history, 6 years ago, In English
What if top 20 coders complot? Bill Gates conspiracy theory Currently, top 10 coders have the power to display a _hidden_ message on Codeforces. This hidden message is formed by the first letter of all user names, since they are highlighted because they are all Legendary Grandmasters. You only have to read them vertically in the "Top rated" pane. Take for instance current hidden message, it's **UtBekmRyba**. Yes, I know, it doesn't have a lot of meaning. What if I tell you that first 20 coders could complot, or suffer from a notorious coincidence, in which interesting messages can be formed, take for instance the following order: 1. [user:jiangly,2020-10-22] 2. [user:Um_nik,2020-10-22] 3. [user:maroonrk,2020-10-22] 4. [user:Petr,2020-10-22] 5. [user:molamola.,2020-10-22] 6. [user:apiadu,2020-10-22] 7. [user:scott_wu,2020-10-22] 8. [user:tourist,2020-10-22] 9. [user:Egor,2020-10-22] 10. [user:Radewoosh,2020-10-22] Forming the word **jUmPmastER**, and I see no better real-world (sorry Mario) jumper than Bill Gates. Watch [thi...
all Legendary Grandmasters. You only have to read them vertically in the "Top rated" pane.

Full text and comments »

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

202.
A useful blog about how to become master
By Mi.Lord, history, 4 years ago, In English
A useful blog about how to become master Dear Codeforces community, Today I realised I should teach more people the secrets on how to become a Master in Codeforces like 20llmc. The key to reaching orange is to just acquire some 4-anilino-4'-nitroazobenzene and spread it all over your keyboard. This will ensure that you absorb the most orange powers while you type code. If you are going for Legendary Grandmaster, replace that with squid ink. Regarding 4-anilino-4'-nitroazobenzene, this dye is useful in conducting experiments with flash photolysis due to the isomerization effect between the trans-4A4N and cis-4A4N states that occurs during photo relaxation. Hence, I believe it will have the maximum effect on helping you become a Master in Codeforces. If you are too poor to buy / chemically synthesize it, then you are having a skill issue. An easy solution to this is to bake some lemon tart. The following is a procedure written in English (not C++, sorry in advance) on how to bake lemon tart: Make the crust: in th...
you are going for Legendary Grandmaster, replace that with squid ink.

Full text and comments »

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

203.
Will something have to change soon?
By 123gjweq2, 22 months ago, In English
Will something have to change soon? It seems clear that one day, possibly in the near future, tourist won't be the only one at $4000+$ rating. I think that this raises a bigger issue, though: there are too many LGMs. Of course, this is just an opinion, but I don't think that the word "legendary" should be thrown around this often. For example, wrt chess, Magnus Carlsen and Bobby Fischer are _legendary_. Hikaru Nakamura is very very good, but he is _not_ legendary. Also, I don't think anyone would consider the current world champion Ding Liren _legendary_. To be honest, the only person on cf with true legendary status might be tourist. In fact, we can tell that he is the only legendary one because he has his own rank. If any of the other LGMs were legendary, they would also have their own rank (or something like that to signify true legendary status). So maybe $3000-3999$ should have a different name.
To be honest, the only person on cf with true legendary status might be tourist. In fact, we can

Full text and comments »

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

204.
How to be a Legendary Grandmaster?(temporary）
By zhuhaocheng, history, 3 weeks ago, In English
How to be a Legendary Grandmaster?(temporary） Legendary Grandmaster is many coders' dream. But it's not easy to be a Legendary Grandmaster. How can we beLegendary Grandmaster? Every Christmas,login Codeforces.[Open you profile](http://codefoces/profile/{your%shandle}) Choose 'Magic',the follow the santa.Finally choose 'Legendary Grandmaster'or other you want. After that you'll became a Legendary Grandmaster,even though your rating is 0. remember it is temporary,so if you've done it successful,take a photo of your profile first.![ ](/predownloaded/fe/a7/fea718b87d3ec7a352e16150c81d6ddc0b6d0884.png)
How to be a Legendary Grandmaster?(temporary）, Legendary Grandmaster is many coders' dream. But it's not easy to be a Legendary Grandmaster. How

Full text and comments »

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

205.
I fail every time.
By valvee, history, 5 years ago, In English
I fail every time. It seems so often to me that I am going to try my best for a specific work yet after some days that motivation fades away. All my plans that were to be done with utmost discipline are just some notes in the paper which I don’t even look back at after writing. Judging by my daily activities and my own vision towards life, I have finally crowned myself as a loser. This is my way of living for the past few years. Maybe I am good in some field but when it comes to performing I always fail. I always have a self-doubt that I am going to make a mess of it and even if I make myself confident enough to do that work, the result is nothing different. The world is filled with super smart, happy, passionate, confident and positive thinkers and they somehow know what they must do and how to do. And here I am who has always failed in every field and situation. Honestly, I have never given much dedication to my work, but how could I be dedicated when I always fail in the very processes of that work! M...
forces homepage loads up, we all see the names of Legendary Grandmasters. Some of them have been coding

Full text and comments »

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

206.
Love you tourist!
By pikamonstruosa, history, 3 years ago, In English
Love you tourist! It has been one exciting year since I gave my most sincere thanks to the legendary [user:tourist,2023-11-22] after reading about his story. Remembering what he has done for me and my motivation in this last year, my apreciation for him has grown even further, so I am here to thank him again! To show my love for his existance, here is another drawing in his honor. Now in red and black to represent his awsome rank! ![ ](/predownloaded/dd/84/dd8429528d310144667faec19af937911f6af17e.jpg)
It has been one exciting year since I gave my most sincere thanks to the legendary [user:tourist

Full text and comments »

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