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

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

Results

1.
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 101 [Rated for Div. 2] Hello Codeforces! On [contest_time:1469] [contest:1469] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-12-27] Glazov, Adilbek [user:adedalic,2020-12-27] Dalabaev, Vladimir [user:vovuh,2020-12-27] Petrov, Ivan [us...
Educational Codeforces Round 101 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round, >2 [user:Geothermal, 2020-12-28] 6 138

Full text and comments »

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

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

Full text and comments »

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

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

Full text and comments »

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

4.
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 138 Editorial [problem:1749A] Idea: [user:BledDest,2022-10-21] <spoiler summary="Tutorial"> [tutorial:1749A] </spoiler> <spoiler summary="Solution 1 (awoo)"> ~~~~~ for _ in range(int(input())): n, m = map(int, input().split()) for _ in range(m): input() print("NO" if n == m else "YES") ~~~~~ </spoiler> <spoiler summary="Solution 2 (awoo)"> ~~~~~ #include <bits/stdc++.h> #define forn(i, n) for (int i = 0; i < int(n); i++) using namespace std; int main() { int t; scanf("%d", &t); forn(_, t){ int n, m; scanf("%d%d", &n, &m); vector<pair<int, int>> a(m); forn(i, m){ scanf("%d%d", &a[i].first, &a[i].second); --a[i].first, --a[i].second; } bool ans = false; forn(i, m) forn(x, n) forn(y, n) if ((x == a[i].first) ^ (y == a[i].second)){ bool ok = true; forn(j, m) if (i != j){ ok &= x != a[j].first && y != ...
Educational Codeforces Round 138 Editorial

Full text and comments »

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

5.
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 106 [Rated for Div. 2] Hello Codeforces! On [contest_time:1499] [contest:1499] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2021-03-17] Glazov, Adilbek [user:adedalic,2021-03-17] Dalabaev, Vladimir [user:vovuh,2021-03-17] Petrov, Ivan [us...
Educational Codeforces Round 106 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round, > 2 [user:Maksim1744, 2021-03-18] 6 138

Full text and comments »

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

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

Full text and comments »

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

7.
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 138 [Rated for Div. 2] Hello Codeforces! On [contest_time:1749] [contest:1749] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2022-10-19] Dalabaev, Vladimir [user:vovuh,2022-10-19] Petrov, Ivan [user:BledDest,2022-10-19] Androsov, Mak...
Educational Codeforces Round 138 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round, This round will be **rated for the participants with rating lower than 2100**. It will be held on

Full text and comments »

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

8.
By MikeMirzayanov, 11 months ago, In English
Wrapping up the Global Rounds 2025 <img src="/predownloaded/2e/e2/2ee2f0f95f05aae6ca6f47812dae2dc2aabf277b.png" style="width: 240.0px;float: right;margin: 0 1.0em 1.0em 1.0em;max-width: 100.0%;max-height: 100.0%;"> Hello Codeforces, As 2025 comes to an end, it is time to start summing up the results. This post is about the Global Rounds. Since September, we have held a series of three Global Rounds, numbered from 29 to 31. This is the perfect moment to once again express our gratitude to XTX Markets for their initiative in organizing these rounds and their constant support over the years. Such stability in supporting the competitive programming movement is truly admirable and highly appreciated by the community. I wish XTX Markets a fantastic 2026, full of success and victories! In each of the three rounds, 50 t-shirts were awarded (to the top 30 participants and 20 random participants ranked between 31st and 500th). This year, we had to change the manufacturing and shipping process, so it is still a work...
) | | 15 | [user:Nachia,2025-12-31] | 600 | 346 (8) | 254 (14) | 138 (34) | | 16 | [user:Radewoosh

Full text and comments »

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

9.
By I_love_Nastya, 14 years ago, translation, In English
Codeforces Round #138, tutorial. ### Div2 A. Parallelepiped You were given areas of three faces of a rectangular parallelepiped. Your task was to find the sum of lengths of it's sides. Let $a$, $b$ and $c$ be the lengths of the sides that have one common vertex. Then the numbers we are given are $s_1 = ab$, $s_2 = bc$ и $s_3 = ca$. It is easy to find the lengths in terms of faces areas: $a = \sqrt{s_1 s_3 / s_2}$, $b = \sqrt{s_1 s_2 / s_3}$, $c = \sqrt{s_2 s_3 / s_1}$. The answer is $4 (a + b + c)$, because there are four sides that have lengths equal to $a$, $b$ and $c$. The complexity is $O(1)$. ### Div2 B. Array You were given an array $a$ consisting of $n$ integers. Its elements $a_i$ were positive and not greater than $10^5$ for each $1 \le i \le n$. Also you were given positive integer $k$. You had to find minimal by inclusion segment $[l, r]$ such that there were exactly $k$ different numbers among $a_l, \ldots, a_r$. The definition of the "minimal by inclusion" you can read in the statement. Let us...
Codeforces Round #138, tutorial.

Full text and comments »

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

10.
By I_love_Nastya, 14 years ago, translation, In English
Codeforces Round #138 Hello everybody! I am glad to announce that Codeforces Round #138 will be held today at [19:30 MSK](http://timeanddate.com/worldclock/fixedtime.html?iso=20120916T1930&p1=166). I (Vasiliy Vadimov) am the author of this round. It is my first Codeforces round, I just helped other authors to prepare their rounds before. I would like to thank Gerald [user:Gerald,2012-09-16] Agapov for his help in the preparing of the round and Maria [user:Delinur,2012-09-16] Belova for translation of the problems' statements in English. Also I am grateful to Mike [user:MikeMirzayanov,2012-09-16] Mirzayanov for such an excellent contest system as Codeforces. Good luck! I hope you will be interested in the problems. The point distribution is standard in both divisions (500-1000-1500-2000-2500). UPD. Attention! D language will not be available on this contest. UPD2. The round is over, top-5 in both divisions: Div1: 1. [user:Petr,2012-09-16]<br> 2. [user:tourist,2012-09-16]<br> 3. [use...
Codeforces Round #138, UPD2. The round is over, top-5 in both divisions:, round and Maria [user:Delinur,2012-09-16] Belova for translation of the problems' statements in

Full text and comments »

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

11.
By MikeMirzayanov, 6 years ago, In English
Codeforces Global Rounds 2020: Final Results In 2020, with the support of XTX Markets, 6 rounds of the Codeforces Global Rounds were held. Each round was common for both divisions. All such rounds were rated for all participants. At each such round, 50 brand T-shirts were handed out, and we gave T-shirts to all problem writers! I say a big thank you to XTX Markets (and personally to Yuri Bedny and Alexander Gerko) for supporting Global Rounds. Without your help, we could not host them! I sincerely admire companies like these who come to support and develop the community that some of their employees come from. It will be great if other companies follow the example and also offer their help. We need it! The prizes for the 6-round series in 2020: - In each round, top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT). - The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest. - The best 20 participants over all series get...
| [user:tatyam,2020-12-08] | 733 | — | 138 | — | 76 | 265 | 254 | | 22 | [user:zeronumber,2020-12, round was common for both divisions. All such rounds were rated for all participants. At each such

Full text and comments »

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

12.
By ahmed_aly, 14 years ago, In English
Coders of the month — September 2012 1- [user:916852,2012-09-30]: 509<br/> * 67th in <a href="http://codeforces.me/contest/222/standings" target="_blank">Codeforces Round #137 (Div. 2)</a>: +139 (from <b><font color="blue">1553</font></b> to <b><font color="blue">1692</font></b>)<br/> * 10th in <a href="http://codeforces.me/contest/224/standings" target="_blank">Codeforces Round #138 (Div. 2)</a>: +78 (from <b><font color="blue">1692</font></b> to <b><font color="#A0A">1770</font></b>)<br/> * 87th in <a href="http://codeforces.me/contest/226/standings" target="_blank">Codeforces Round #140 (Div. 1)</a>: +103 (from <b><font color="#A0A">1770</font></b> to <b><font color="#A0A">1873</font></b>)<br/> <br/> 2- [user:xiaodao,2012-09-30]: 500<br/> * 67th in <a href="http://codeforces.me/contest/223/standings" target="_blank">Codeforces Round #138 (Div. 1)</a>: +121 (from <b><font color="#A0A">1772</font></b> to <b><font color="#A0A">1893</font></b>)<br/> * 23rd in <a href="http://codeforces.me/contest/226/standings"...
/contest/224/standings" target="_blank">Codeforces Round #138 (Div. 2): +78 (from, /standings" target="_blank">Codeforces Round #138 (Div. 1): +103 (from 2058, /standings" target="_blank">Codeforces Round #138 (Div. 1): +105 (from 2009, /standings" target="_blank">Codeforces Round #138 (Div. 1): +121 (from 1772, /standings" target="_blank">Codeforces Round #138 (Div. 1): +139 (from 1914

Full text and comments »

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

13.
By MikeMirzayanov, 4 years ago, In English
Codeforces Global Rounds 2022: Final Results (GR19-GR24) Hello, Codeforces. It's time to take stock of last year. Shall we begin? And we are happy to sum up the results of the last season of Global Rounds. We announce the results! We remind you that the global rounds are a joint initiative of XTX and Codeforces. We hold 6 such rounds per year. All of them are open to both divisions. At each such round, 50 brand T-shirts were handed out, and we are happy to give T-shirts to all problem authors. The prizes for the 6-round series are: - In each round top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT). - The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest. - The best 20 participants over all series get sweatshirts and place certificates. [cut] The final standings after six rounds (sorted by total points in four best-placed rounds): | Place | Contestant | = | GR 19 | GR 20 | GR 21 | GR 22 | GR 23 | GR 24| |--|--|--|--|...
-01-02] | 908 | 497 | — | 138 | 97 | 176 | — | | 17 | [user:duality,2023-01-02] | 904, . All of them are open to both divisions. At each such round, 50 brand T-shirts were handed out, and

Full text and comments »

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

14.
By arsijo, 7 years ago, In English
Codeforces Global Rounds 2019: Final Results In 2019, with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds were held. Each round was common for both divisions and had 7–9 problems. The duration of the rounds was 2-3 hours, depending on the number and complexity of the problems. All such rounds were rated for all participants. At each such round, 50 brand T-shirts were handed out, and we gave T-shirts to all authors and problem testers as well. The prizes for the 6-round series in 2019: - In each round, top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT). - The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest. - The best 20 participants over all series get sweatshirts and place certificates. Final results: [cut]<br/> | Place | Contestant | = | Round 1 | Round 2| Round 3 | Round 4 | Round 5 | Round 6 | | - | - | - | - | - | - | - | - | - | | 1 | [user:tourist,2019-12-17] | <b> 2987 </b> | ...
. Each round was common for both divisions and had 7–9 problems. The duration of the rounds was 2-3, | Place | Contestant | = | Round 1 | Round 2| Round 3 | Round 4 | Round 5 | Round 6

Full text and comments »

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

15.
By kostka, 12 years ago, In English
Hack me! (Codeforces Round #280 (Div. 2)) Brief stats about some past contest &mdash; [contest:492]. Previous posts can be found [here](http://codeforces.me/search?query=hackme). [cut] <h3>Stats</h3> Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>| :---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:492A] </small> | 7 (17.95%) | 28 (71.79%)| 4 (10.26%) | 39 | 104 (3.94%) | 2538 (96.06%) | 2642 | <small> [problem:492B] </small> | 11 (25.00%) | 26 (59.09%)| 7 (15.91%) | 44 | 120 (5.90%) | 1915 (94.10%) | 2035 | <small> [problem:492C] </small> | 149 (48.85%) | 54 (17.70%)| 102 (33.44%) | 305 | 340 (21.55%) | 1238 (78.45%) | 1578 | <small> [problem:492D] </small> | 7 (22.58%) | 18 (58.06%)| 6 (19.35%) | 31 | 138 (23.47%) | 450 (76.53%) | 588 | <small> [problem:492E] </small> | 0 (0.00%) | 1 (100.00%)| 0 (0.00%) | 1 | 5 (2.81%) | 173 (97.19...
Hack me! (Codeforces Round #280 (Div. 2)), (78.45%) | 1578 | [problem:492D] | 7 (22.58%) | 18 (58.06%)| 6 (19.35%) | 31 |138, > [problem:492D] | 7 (22.58%) | 18 (58.06%)| 6 (19.35%) | 31 | 138 (23.47%) | 450 (76.53%) | 588

Full text and comments »

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

16.
By MikeMirzayanov, 5 years ago, In English
Codeforces Global Rounds 2021: Final Results (GR13-GR18) Tomorrow will be the first global round of this year. And we are happy to sum up the results of last season. We announce the results! We remind you that the global rounds are a joint initiative of XTX and Codeforces. We are happy to announce that they continue into the new year. We hold 6 such rounds per year. All of them are open to both divisions. At each such round, 50 brand T-shirts were handed out, and we are happy to give T-shirts to all problem authors. The prizes for the 6-round series are: - In each round top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT). - The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest. - The best 20 participants over all series get sweatshirts and place certificates. The final standings after six rounds (sorted by total points in four best placed rounds): | Place | Contestant | = | GR 13 | GR 14 | GR 15 | GR 16 | GR 17 | GR 18| |--...
| 186 | 211 | — | — | | 12 | [user:Golovanov399,2022-02-11] | 1017 | 254 | 277 |138, Tomorrow will be the first global round of this year. And we are happy to sum up the results of

Full text and comments »

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

17.
By arsijo, 7 years ago, In English
Codeforces Global Rounds 2019: Current Results After Four Rounds In 2019, with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds will be held. These will be common rounds for both divisions of 7–9 problems each. The duration of the rounds will be 2-3 hours, depending on the number and complexity of the problems. All such rounds will be rated for all participants. <i>At each such round, 50 brand T-shirts will be handed out, and we will be happy to give T-shirts to all authors and problem testers.</i> The prizes for the 6-round series in 2019: - In each round top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT). - The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest. - The best 20 participants over all series get sweatshirts and place certificates. Current standings after four rounds: | Place | Contestant | = | Round 1 | Round 2| Round 3 | Round 4 | | - | - | - | - | - | - | - | | 1 | [user:tourist,2019-07-21] | 241...
rated for all participants. At each such round, 50 brand T-shirts will be handed out, and we will be, | Place | Contestant | = | Round 1 | Round 2| Round 3 | Round 4

Full text and comments »

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

18.
By MikeMirzayanov, 5 years ago, In English
Codeforces Global Rounds 2021: Current Results (GR13-GR17) In 2021 (as in 2019 and 2020), with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds are held: common rounds for both divisions of 7–9 problems each. The duration of the rounds is 2-3 hours, depending on the number and complexity of the problems. All such rounds are rated for all participants. <i>At each such round, 50 brand T-shirts are handed out, and we are happy to give T-shirts to all problem authors.</i> The prizes for the 6-round series in 2021: - In each round top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT). - The final result for each participant is equal to the sum of points he gets in the five rounds he placed the highest. - The best 20 participants over all series get sweatshirts and place certificates. Current standings after five rounds (sorted by total points in four best placed rounds): | Place | Contestant | = | GR 13 | GR 14 | GR 15 | GR 16 | GR 17| | - | - | - | - | - | - | - | - | | ...
for all participants. At each such round, 50 brand T-shirts are handed out, and we are happy to, -10] | 994 | 254 | 277 | 138 | — | 325 | | 12 | [user:aid,2021-12-10] | 868 | 226 | 145 | 218

Full text and comments »

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

19.
By SummerSky, 9 years ago, In English
Notes on Codeforces Beta Round #76, Div2-A, B, C, D, E, Div1-E [problem:94A] A simple problem with straightforward solution. Divide the given string into 8 parts with the same length 10, and convert each of them to a decimal digit according to the provided mapping relationship. [problem:94B] Generate all the feasible $C_5^3$ patterns, and check whether there exist any three people that are either known or unknown to each other. The mutual relationship can be represented by the connectivity of graph. [problem:94C] This is a horrible problem...There are a huge number of cases that should be considered. One of the cases that is likely to be ignored is shown as follows: Suppose that $m=4, n=100$, and $a=3, b=10$. One might give $3$ as the answer. However the answer should be $2$, since we can first select $3, 4, 7, 8$, and then select $5, 6, 9, 10$. [problem:94D] It turns out that greedy algorithm solves this problem. Assume that we have $n$ segment lines with the same length $w$, and we put them one after another, i.e., the $i...
Notes on Codeforces Beta Round #76, Div2-A, B, C, D, E, Div1-E, fails since $dp[i]$ and $dp[j]$ are dependent under some cases. For instance $n=138$, and the optimal, , this fails since $dp[i]$ and $dp[j]$ are dependent under some cases. For instance $n=138$, and the

Full text and comments »

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

20.
By MikeMirzayanov, 7 years ago, In English
Codeforces Global Rounds 2019: Current Results In 2019, with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds will be held. These will be common rounds for both divisions of 7–9 problems each. The duration of the rounds will be 2-3 hours, depending on the number and complexity of the problems. All such rounds will be rated for all participants. <i>At each such round, 50 brand T-shirts will be handed out, and we will be happy to give T-shirts to all authors and problem testers.</i> The prizes for the 6-round series in 2019: - In each round top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT). - The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest. - The best 20 participants over all series get sweatshirts and place certificates. Current standings after two rounds: | Place | Contestant | = | Round 1 | Round 2| | - | - | - | - | - | | 1 | [user:tourist,2019-06-01] | 1706 | 1000 | 706 | | 2 | [us...
rated for all participants. At each such round, 50 brand T-shirts will be handed out, and we will be, | Place | Contestant | = | Round 1 | Round 2| | - | - | - | - | - | | 1 | [user:tourist,2019-06

Full text and comments »

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

21.
By MikeMirzayanov, 6 years ago, In English
Codeforces Global Rounds 2020: Current Results (GR7-GR9) In 2020 (as in 2019), with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds will be held. These will be common rounds for both divisions of 7–9 problems each. The duration of the rounds will be 2-3 hours, depending on the number and complexity of the problems. All such rounds will be rated for all participants. <i>At each such round, 50 brand T-shirts will be handed out, and we will be happy to give T-shirts to all problem authors and problem testers.</i> The prizes for the 6-round series in 2020: - In each round top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT). - The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest. - The best 20 participants over all series get sweatshirts and place certificates. Current standings after three rounds (sorted by total points in three rounds): | Place | Contestant | = | GR 7 | GR 8 | GR 9| |--|--|--|--|--|--| ...
rounds will be rated for all participants. At each such round, 50 brand T-shirts will be handed out, ,2020-07-05] | 292 | — | 161 | 131 | | 41 | [user:mango_lassi,2020-07-05] | 291 |138 | 153

Full text and comments »

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

22.
By MikeMirzayanov, history, 6 years ago, In English
Codeforces Global Rounds 2020: Current Results (GR7-GR10) In 2020 (as in 2019), with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds will be held. These will be common rounds for both divisions of 7–9 problems each. The duration of the rounds will be 2-3 hours, depending on the number and complexity of the problems. All such rounds will be rated for all participants. <i>At each such round, 50 brand T-shirts will be handed out, and we will be happy to give T-shirts to all problem authors and problem testers.</i> The prizes for the 6-round series in 2020: - In each round top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT). - The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest. - The best 20 participants over all series get sweatshirts and place certificates. Current standings after four rounds (sorted by total points in four rounds): | Place | Contestant | = | GR 7 | GR 8 | GR 9 | GR 10| |--|--|--|--|--...
rounds will be rated for all participants. At each such round, 50 brand T-shirts will be handed out, ; | | 37 | [user:mango_lassi,2020-08-18] | 393 | 138 | 153 | — | 102 | | 38 | [user:eatmore,2020-08

Full text and comments »

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

23.
By arsijo, 7 years ago, In English
Codeforces Global Rounds 2019: Current Results After Five Rounds In 2019, with the support of XTX Markets, 6 rounds of the new Codeforces Global Rounds will be held. These will be common rounds for both divisions of 7–9 problems each. The duration of the rounds will be 2-3 hours, depending on the number and complexity of the problems. All such rounds will be rated for all participants. <i>At each such round, 50 brand T-shirts will be handed out, and we will be happy to give T-shirts to all authors and problem testers.</i> The prizes for the 6-round series in 2019: - In each round top-100 participants get points according to the [table](https://pastebin.com/QT5sXEaT). - The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest. - The best 20 participants over all series get sweatshirts and place certificates. Current standings after five rounds: | Place | Contestant | = | Round 1 | Round 2| Round 3 | Round 4 | Round 5 | | - | - | - | - | - | - | - | - | | 1 | [user:tourist,201...
rated for all participants. At each such round, 50 brand T-shirts will be handed out, and we will be, | Place | Contestant | = | Round 1 | Round 2| Round 3 | Round 4 | Round 5

Full text and comments »

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

24.
By Z0RR0, history, 8 years ago, In English
Codeforces Popularity Ranking Hello Codeforces! There has been several blogs similar to this. I know about [TOP 15 most popular users on codeforces](http://codeforces.me/blog/entry/49122) and [Who is the most popular?](http://codeforces.me/blog/entry/21041). But as none of these are updated, I thought this might be helpful. I have just calculated the most popular handles in Codeforces. I only considered those handles which have at least one rated contest. Begging my pardon to them who hasn't participated in any rated round. And here, the popularity depends simply on the number of people you are friend of. The complete standings can be found [here](https://docs.google.com/spreadsheets/d/1ADlF-bd6pBYCap75yzf-pUnVwI9f9YmPkiYNW3lD-xo/edit?usp=sharing)(This may took a while to load at the bottom). Anyway here is Top 200 handles. | Rank | Handle | Follower | |---|---|---| 1. | [user:tourist,2018-08-22] | 14082 | 2. | [user:Petr,2018-08-22] | 6430 | 3. | [user:OO0OOO00O0OOO0O00OOO0OO,2018-08-22] | 420...
rated round. And here, the popularity depends simply on the number of people you are friend of. The

Full text and comments »

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

25.
By Nickolas, 15 years ago, translation, In English
Some thoughts about Surprise/Unknown Language Rounds I'm a huge fan of Surprise/Unknown Language Round competition format. Theoretically I enjoy participating in them, but in practice I mostly run them. What's so special about them that makes me like them so much? 1. They are unusual. At some point of time (which arrived pretty soon for me) traditional competitions pall and become a blur. If I give it a thought, I can clearly remember only a couple of the 80 SRMS and CF rounds I've done. The SRM which featured MooresLaw problem (great challenge phase and my only ever room win), TCO elimination round which I passed thanks to a last-minute submission on 500pt, a GCJ round from back when it was held on TopCoder platform, when I got stuck at input parsing and never got to the actual solution... and that's all. Marathon memory is a bit better, probably because I've participated in fewer of them, and each match took more time and effort. But unusual competitions leave the most lasting and vivid impression. 2. They fit my skills....
I'm a huge fan of Surprise/Unknown Language Round competition format. Theoretically I enjoy

Full text and comments »

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

26.
By amartya110, 10 months ago, In English
Invitation to CodeHurdle Athlos Contest — January 18, 2026 Hello Codeforces! **First** and foremost, the entire **CodeHurdle** team wishes you a very **Happy New Year!** As we step into 2026, we have been working tirelessly to evolve, grow stronger, and improve the quality of competitive programming for our community. To celebrate this new chapter, we are thrilled to announce the launch of our brand new contest series: **CodeHurdle Athlos.** ![ ](/predownloaded/7c/56/7c56af2008a7fdf809f9babb0feaf38464f4a3a6.png) We invite you to participate in the inaugural round! ### Contest Details * **Date:** Sunday, January 18, 2026 * **Time:** [contest_time:662818] * **Duration:** 3 hours * **Problem Count:** 8 Problems * **Platform:** The contest runs on **Codeforces** (Gym/Mashup). * **Registration:** **Mandatory** at [codehurdle.com](https://codehurdle.com). The problem setting panel are: [user:amartya110,2026-01-14], [user:Lucifer_K,2026-01-14], [user:mahesh_9996,2026-01-14], [user:shivamp_07,2026-01-14], [user:Chetan_21,202...
in the inaugural round! ### Contest Details * **Date:** Sunday, January 18, 2026 * **Time

Full text and comments »

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

27.
By JayKumarThakur, history, 4 years ago, In English
Plagiarism on Problem B of Educational Codeforces Round 138 Recently I have given Educational Codeforces Round 138 and I got a system message that I am plagiarised in Problem B with the solution submitted by [user:ranjannishant98,2022-10-23]. My Solution : [submission:177156922] His Solution : [submission:177179010] The logic of that problem was undeniable and hence our solution logic also coincided but we have not cheated anywhere. Headquarters [user:MikeMirzayanov,2022-10-23] [user:KAN,2022-10-23] kindly look into this matter.
Plagiarism on Problem B of Educational Codeforces Round 138, Recently I have given Educational Codeforces Round 138 and I got a system message that I am

Full text and comments »

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

28.
By BWiei, 4 years ago, In English
Complaints about the Educational Codeforces Round 138 (Rated for Div. 2) I'm sorry for the coincidence, but I'm also angry. Because I don't think I copied this code from anyone, this is my own writing. I should not be penalized just because I successfully compiled the code, although it may be very similar to the aayuc1784/177199490 code. I feel entitled to speak to this judgment. I hope officials can compare code submission times or other comparisons. Again, I'm not going to copy anyone's code. I'm Chinese. I'm new to this. Aayu 1784/177199490. I don't know each other. I hope the official can give me an explanation, thank you! (My personal English ability is very limited, some grammar and other problems please forgive me) [user:BWiei][contest:Educational Codeforces Round 138 (Rated for Div. 2)]
Complaints about the Educational Codeforces Round 138 (Rated for Div. 2), ][contest:Educational Codeforces Round 138 (Rated for Div. 2)]

Full text and comments »

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

29.
By dear_earth, history, 4 years ago, In English
solution [contest:https://codeforces.me/contest/1749] [Educational codeforces round :138] Problem A: cowardly rook #include<bits/stdc++.h> using namespace std ; int main(){ int t; cin>>t; while(t--){ int n,m; cin>>n>>m; for(int i=0;i<m;i++){ int a,b; cin>>a>>b; } if(m<n){ cout<<"YES"<<endl; } else{ cout<<"NO"<<endl; } } return 0; }
[contest:https://codeforces.me/contest/1749] [Educational codeforces round :138 ] Problem A

Full text and comments »

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

30.
By -Morass-, history, 9 years ago, In English
Problem Topics Good Day to you! I've been asked to make some topic-wise list of problems I've solved. Even though I couldn't involve all problems, I've tried to involve at least "few" problems at each topic I thought up (I'm sorry if I forgot about something "easy"). I've alredy made such list once anyway I've tried to include more problems now &mdash; so here it is: <spoiler summary="aho"> http://www.spoj.com/problems/ADAJOBS/ URI 2226 (5) //[NICE][NUMBERS][DP] http://www.spoj.com/problems/SUB_PROB/en/ http://codeforces.me/contest/696/problem/D 8 http://www.spoj.com/problems/AHOCUR/ 5 //Aho-Corassic + DP https://www.codechef.com/problems/LYRC (5) //Sample aho-brute-force http://codeforces.me/problemset/problem/346/B //Proposed by [user:bradyawn,2019-08-03] </spoiler> <spoiler summary="automat"> 6861 [LA] //CYK UVA 10679 //Suffix Automat http://www.spoj.com/problems/STRMATCH/ //Suffix Automat &mdash; trie might do too http://www.spoj.com/problems/NSUBST...
— Round 1] UVA 11833 http://www.spoj.com/problems/EZDIJKST/en/ LightOJ 1019 UVA

Full text and comments »

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