Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

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 Intellegent, 6 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...
Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2), have a go at Codeforces Round ${12}_{10}$ ([contest:2229]), kicking off at [contest_time:2229, ="text-decoration: none;font-size: 18.0px;background-color: rgb(153, 204, 255);color: rgb(0, 0, 0);font

Full text and comments »

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

2.
By Magolor, history, 8 years ago, In English
Codeforces Round #502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2) > This round is in memory of Leopoldo Taravilse. > > Leopoldo Taravilse (ltaravilse) was a distinguished member of the competitive programming community in Argentina and Latin America. As a contestant, he reached the ACM-ICPC World Finals in 2010 and 2012, and was active in CodeForces and TopCoder. After 2012 he became a problemsetter for the ACM-ICPC South American regionals and the Argentinian Programming Tournament, and later coach for a World Finalist team in 2016. > > Leopoldo's passion was helping others realize their full potential in competitive programming. He taught at various competitive programming schools in Brazil, Cuba, Peru and Bolivia, and his role organizing the Argentinian Training Camp cannot be overstated. Under his wing, it grew from a small group of friends in 2010 to a major event featuring international sponsors and having hundreds of participants coming from all corners of Latin America. Through successive editions of the Training Camp, Leopoldo inspired s...
Codeforces Round #502 (in memory of Leopoldo Taravilse, Div. 1 + Div. 2), **Prizes distribution: $153 for top 30, delivered using bitcoin or amazon gift card (each, > This round is in memory of Leopoldo Taravilse. > > Leopoldo Taravilse (ltaravilse) was a

Full text and comments »

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

3.
By Dragmon, 17 months ago, In English
One final blog about Codeforces Round 1033 and CodeNite 2025 Hi everyone, writing this blog after the recent rollback, getting red back to top of leaderboard as everyone so much desired, and making the overall leaderboard so much better. If you disliked the announcement/tutorial of [contest:2120] or posted a genuine critique because of problem quality or or because of some other situation which we could've improved, then this blog is not for you, I don't have any hard feelings and understand why you did it. The dark side ------------------ First of all, everyone who cheated in the round, I really reprimand you all and hope you all are fairly retributed for what you all made me go through and the deeds you've done. I especially hope all those who run the back alley solution distribution during the contest are gone for good and that they are especially retributed for their wrongdoings. (I don't think we can stop GPT or that it can suffer "retribution", so not sure what to say about it. Anyways, people who use GPT for wrong are responsib...
One final blog about Codeforces Round 1033 and CodeNite 2025, ------------------ First of all, everyone who cheated in the round, I really reprimand you all and hope you all are fairly, $ comment in $10$ minute penalty on me for the $<-100$($-153$) contribution I'm currently at the time of

Full text and comments »

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

4.
By KADR, 14 years ago, translation, In English
Editorial of Codeforces Round #153 This is a complete English version of the editorial of Codeforces Round #153. If you have any questions or suggestions, feel free to post them in the comments. ### [problem:252A] (A div 2) Let's iterate over all segments in our array. For each of them we'll find the $xor$ of all its elements. Then we need to output the maximal $xor$ we've seen. ### [problem:252B] (B div 2) If all elements in the array are equal then there's no pair of numbers we are looking for. Now we can assume that there exist at least 2 different numbers in the array. Let's iterate over all pairs of different numbers in the array and for each such pair we'll check if it can be the answer. If some pair indeed can be the answer, we'll output it and terminate the program. Otherwise, there is no pair of numbers we are looking for, so we need to output -1. It may seem that the complexity of described algorithm is $O(N^3)$. Actually it's not true and the real complexity is $O(N)$. One may notice that in ...
Editorial of Codeforces Round #153, This is a complete English version of the editorial of Codeforces Round #153. If you have any

Full text and comments »

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

5.
By __baozii__, history, 5 months ago, In English
Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2) Hello Codeforces! I am glad to invite you to participate in [contest:2245], which will start on [contest_time:2245]. You will be given **2 hours and 30 minutes** to solve **8** problems, where **one problem** will be split into subtasks. Also, there is **at least one** interactive problem, so you are recommended to read the [guide](https://codeforces.me/blog/entry/45307) to interactive problems if you have not encountered them before. Note that **hacks will be disabled** for problems A to D. All problems are authored and prepared by myself. Note the [rule restricting the use of AI](https://codeforces.me/blog/entry/133941). If you are caught breaking this rule, you will be thrown into [user:SSerxhs,2026-07-09]'s basement. For your own well-being, I suggest adhering to the rules. I would like to thank the following people for helping make this round possible! - [user:SSerxhs,2026-07-09] for his/her satisfactory coordination. - [user:Alexdat2000,2026-07-12] for trans...
Spectral::Cup 2026 Round 3 (Codeforces Round 1110, Div. 1 + Div. 2), rules. I would like to thank the following people for helping make this round possible, ="text-decoration: none;font-size: 18.0px;background-color: rgb(153, 204, 255);color: rgb(0, 0, 0);font

Full text and comments »

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

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

Full text and comments »

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

7.
By employed, 7 weeks ago, In English
DeepInfra Round 1 (Codeforces Round 1126, Div. 1 + Div. 2) Hello, Codeforces! We are excited to invite you to [contest:2271], which will take place on [contest_time:2271]! **Note the unusual start time of the round**. You will have **3 hours** to solve **8 problems**, one of which is divided into subtasks. The problems were prepared by [user:employed,2026-10-03] and reviewed carefully by [user:nifeshe,2026-10-03]. We have put a lot of care into creating and testing this problemset, and we hope you will enjoy solving the problems as much as we enjoyed preparing them! A huge thank you to everyone who helped bring this round to life: - [user:nifeshe,2026-10-03] for coordinating the round and being funny, cool, and smart! - [user:dominater069,2026-10-03] for the early review of the problems. - [user:Evenimage,2026-10-03], [user:akslolcoding,2026-10-03], [user:apracadabra,2026-10-03], [user:Euclid73,2026-10-03], [user:linearspace,2026-10-03], [user:Mohammad_Hacker,2026-10-03], [user:naneosmic,2026-10-03], [user:nik_exists,2026-10-0...
DeepInfra Round 1 (Codeforces Round 1126, Div. 1 + Div. 2), [contest_time:2271]! **Note the unusual start time of the round**. You will have **3 hours** to solve, ="text-decoration: none;font-size: 18.0px;background-color: rgb(0, 0, 0);color: rgb(153, 204, 255);font

Full text and comments »

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

8.
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 85 [Rated for Div. 2] Hello Codeforces! On [contest_time:1334] [contest:1334] 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-04-09] Glazov, Adilbek [user:adedalic,2020-04-09] Dalabaev, Vladimir [user:vovuh,2020-04-09] Petrov, Ivan [us...
Educational Codeforces Round 85 [Rated for Div. 2], Codeforces in the blog post <http://codeforces.me/blog/entry/51208>. This round, [user:MiFaFaOvO, 2020-04-10] 7 153

Full text and comments »

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

9.
By awoo, history, 3 years ago, translation, In English
Educational Codeforces Round 153 [Rated for Div. 2] Hello Codeforces! On [contest_time:1860] [contest:1860] 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="https://mirror.codeforces.com/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-08-15] Dalabaev, Ivan [user:BledDest,2023-08-15] Androsov, Maksim [user:Neon,2023-08-15] Mesch...
Educational Codeforces Round 153 [Rated for Div. 2], This round will be **rated for the participants with rating lower than 2100**. It will be held on, round will be **rated for the participants with rating lower than 2100**. It will be held on extended

Full text and comments »

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

10.
By KADR, 14 years ago, translation, In English
Codeforces Round #153 Hello everyone! Codeforces Round #153 will take place on Thursday, December 6th at [19:30 MSK](http://timeanddate.com/worldclock/fixedtime.html?day=6&month=12&year=2012&hour=19&min=30&sec=0&p1=166). This is my third Codeforces round and I hope there will be more. I'd like to thank [user:Shtrix,2012-12-04], [user:Seyaua,2012-12-04], [user:sdya,2012-12-04] and [user:Gerald,2012-12-04] for helping me to prepare the round. Special thanks to [user:Delinur,2012-12-06] for translation of all problem statements into English. I hope you will like the problems. Good luck and have fun! **UPD**: Complete version of English editorial is now [available](http://codeforces.me/blog/entry/6054). Congratulations to the winners! Division 1: 1. [user:Egor,2012-12-28] 2. [user:tourist,2012-12-28] 3. [user:rng_58,2012-12-28] 4. [user:kelvin,2012-12-28] 5. [user:Burunduk1,2012-12-28] Division 2: 1. [user:inker,2012-12-28] 2. [user:dslovemz,2012-12-28] 3. [user:memo1288,20...
Codeforces Round #153, [user:Gerald,2012-12-04] for helping me to prepare the round. Special thanks to [user:Delinur,2012-12

Full text and comments »

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

11.
By awoo, history, 3 years ago, translation, In English
Educational Codeforces Round 153 Editorial [problem:1860A] Idea: [user:BledDest,2023-08-18] <spoiler summary="Tutorial"> [tutorial:1860A] </spoiler> <spoiler summary="Solution (Neon)"> ~~~~~ #include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int t; cin >> t; while (t--) { string s; cin >> s; int n = s.size(); string a, b; for (int i = 0; i < 2 * n; ++i) { a += "()"[i & 1]; b += ")("[i < n]; } if (a.find(s) == string::npos) { cout << "YES\n" << a << '\n'; } else if (b.find(s) == string::npos) { cout << "YES\n" << b << '\n'; } else { cout << "NO\n"; } } } ~~~~~ </spoiler> [problem:1860B] Idea: [user:BledDest,2023-08-18] <spoiler summary="Tutorial"> [tutorial:1860B] </spoiler> <spoiler summary="Solution 1 (BledDest)"> ~~~~~ #include<bits/stdc++.h> using namespace std; int main() { int t; cin >> t; for(int i = 0; i < t; i++) { int m, k, a1, ak; cin >> m >> k >> ...
Educational Codeforces Round 153 Editorial

Full text and comments »

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

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

13.
By MinakoKojima, 13 years ago, In English
Codeforces Round #201 Editorial ![ ](http://www.shuizilong.com/house/wp-content/uploads/2013/09/1.jpg) Overview ======== In DIV 1, there are 4 interesting problems together with a normal one. We think it is reasonable because we can't have a round fullly with intelligence. Problem A, C have weak pretests while others intended to be strong. About more then 200 participants solve A in the early 45mins, then a few of them start from C while most of the other start from B. Problem B is a rather standard problem, but if you're unfamiliar with the algorithm, it can be very hard. Problem C is a more intersting problem. As the name implies, there was [a similar version](http://codeforces.me/problemset/problem/251/C) in the previous round before, but this time it has a brand new constrains.(So here we have a psychology experiment: could different constrains make people thinking in a slightly different way?ww) The standard solution of problem C is $O((b-a) + nlogn)$. The first expected correct solution was writt...
Codeforces Round #201 Editorial, because we can't have a round fullly with intelligence. Problem A, C have weak pretests while others, [Codeforces #153 Div 1. Problem C. Number Transformation](http://codeforces.me/problemset/problem

Full text and comments »

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

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

Full text and comments »

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

15.
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...
: 200.0px;" valign="middle"> Codeforces #153 (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

16.
By CutieSmileHaruka, 7 months ago, In English
Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) Hello, Codeforces! We are glad to invite you to take part in [contest:2222], which will start on [contest_time:2222]. You will be given **8 problems** and **2.5 hours** to solve them. This round will be combined for Division 1 and Division 2 and will be rated for everyone. <b>At least one problem will be interactive</b>, so please make sure to read the <a href="https://codeforces.me/blog/entry/45307">guide for interactive problems</a> before the contest. All problems are authored by [user:lizhous,2026-04-22], [user:Lyz09,2026-04-22], [user:ma2021tyoi0037,2026-04-22], [user:hzy_____,2026-04-22] and me. We would like to thank the following people for making this round possible: - [user:Um_nik,2026-04-22] for pre-reviewing the round. - [user:Error_Yuan,2026-04-22] for the coordination and helping with preparation. - [user:Alexdat2000,2026-04-22] for Russian translation. - [user:Rebex,2026-04-22] for providing some rejected problems and preparing some problems. - [user:_D...
Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2), [contest_time:2222]. You will be given **8 problems** and **2.5 hours** to solve them. Thisround, ="text-decoration: none;font-size: 18.0px;background-color: rgb(153, 204, 255);color: rgb(0, 0, 0);font

Full text and comments »

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

17.
By Temirulan, history, 7 weeks ago, In English
DeepInfra Intro <img alt="DeepInfra" src="/predownloaded/80/6a/806a52f0517e36b6ecaa4f88c4b5343630932ca5.jpg" style="float:right; height:145px; margin:6px; max-width:40%;" /> **Hello Codeforces!** We’re excited to welcome you to the upcoming <a href="https://codeforces.me/contest/2271">DeepInfra Round 1</a> &#x1F680; At <a href="https://deepinfra.com/"><b>DeepInfra</b></a>, we’re building high-performance AI infrastructure that makes running the world’s best AI models fast, reliable, and accessible. We operate across the entire inference stack — from GPUs all the way to the API — and we care deeply about performance, efficiency, and solving hard engineering problems. <img src="/predownloaded/61/0d/610dcb234b4c8e315f7b431d6498002f842fcefe.jpg" alt="Image" style="max-width:100%; height:auto;"> Our team had great experience with being part of Codeforces and competitive programming community &mdash; [user:PERNEKHAN,2026-09-30], [user:yessenzhar,2026-09-30], [user:Zharaskh...
excited to welcome you to the upcoming DeepInfra Round <https://codeforces.me/contest/2271>

Full text and comments »

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

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

Full text and comments »

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

19.
By Alex_KPR, 15 years ago, translation, In English
Codeforces Beta Round #80 tutorial <p>It will be fully translated later, sorry for slowpoking :(</p> <table border="0" cellpadding="5" cellspacing="0" width="100%"> <tbody><tr> <td bgcolor="#cccccc" nowrap="nowrap" width="2%"><div align="center"></div><br></td> <td bgcolor="#cccccc"><div align="center"> <p><strong>Blackjack (<a href="http://codeforces.me/contest/104/problem/A">problem A, div-2</a>). The problem's author is&nbsp;<span class="Apple-style-span" style="font-family: verdana, arial, sans-serif; font-size: 12px; "><a href="http://codeforces.me/profile/Alex_KPR" title="Подполковник Alex_KPR" class="rated-user user-red" style="font-family: arial; text-decoration: none !important; font-weight: bold; color: rgb(0, 0, 204); ">Alex_KPR</a></span></strong></p> </div></td> <td bgcolor="#cccccc" nowrap="nowrap" width="2%">&nbsp;</td> </tr> <tr> <td bgcolor="#eeeeee"><p align="justify">&nbsp;</p> </td> <td bgcolor="#eeeeee"><p align="justify">Obviously, suits are not chan...
Codeforces Beta Round #80 tutorial, ="justify">for

Full text and comments »

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

20.
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...
| — | — | 291 | 346 | | 12 | [user:Petr,2020-12-08] | 1143 | — | 497 | 50 | 443 |153, 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

21.
By vovuh, history, 8 years ago, translation, In English
Codeforces Round #521 (Div. 3) I am so sorry about very long gaps between the contests but I really don't have enough time to prepare the problems. So... &lt;copy-pasted-part&gt; Hello! [contest:1077] will start at [contest_time:1077]. You will be offered 6 or 7 problems with expected difficulties to compose an interesting competition for participants with ratings up to 1600. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially. The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests &mdash; just like you will be upset if many solutions fail after the contest is over. You will be given 6 or 7 problems and 2 hours to solv...
Codeforces Round #521 (Div. 3), >[user:PikMike, 2018-11-17] 153:-6, round unofficially. The round will be hosted by rules of educational rounds (extended ACM-ICPC

Full text and comments »

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

22.
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| |--|--|--|--|...
. All of them are open to both divisions. At each such round, 50 brand T-shirts were handed out, and, ; | — | — | 14 | 192 | | 53 | [user:neal,2023-01-02] | 418 | — | — | 153

Full text and comments »

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

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

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

25.
By pathetique, history, 2 years ago, In English
COderfocers Codeforces | In English По-русски pathetique | Logout HOMETOPCATALOGCONTESTSGYMPROBLEMSETGROUPSRATINGEDUAPICALENDARHELP → Pay attention Before contest Codeforces Global Round 26 3 days Register now » *has extra registration → pathetique pathetique User''s contest rating in Codeforces communityRating: 1448 User''s contribution into Codeforces communityContribution: -77 Settings Blog Favourites Teams Submissions Problemsetting Groups Talks Contests → Top rated # User Rating 1 tourist 3757 2 jiangly 3647 3 Benq 3581 4 orzdevinwang 3570 5 Geothermal 3569 5 cnnfls_csy 3569 7 Radewoosh 3509 8 ecnerwala 3486 9 jqdai0815 3474 10 gyh20 3447 Countries | Cities | Organizations View all → → Top contributors # User Contrib. 1 maomao90 171 2 awoo 164 3 adamant 163 4 TheScrasse 159 5 maroonrk 155 6 nor 154 7 -is-this-fft- 152 8 Petr 147 9 orz 145 10 pajenegod 144 View all → → Favourite groups # Name 1 X-Camp 402H 2022 Fall View all → → Fi...
HOMETOPCATALOGCONTESTSGYMPROBLEMSETGROUPSRATINGEDUAPICALENDARHELP → Pay attention Before contest Codeforces GlobalRound 26 3 days, Announcement of Codeforces Round 947 (Div. 1 + Div. 2) Vote: I like it+586Vote: I do not like it

Full text and comments »

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

26.
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| |--...
; | 371 | — | — | — | | 20 | [user:gisp_zjz,2022-02-11] | 725 | — | 153 | 198, 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

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

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

Full text and comments »

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

29.
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, ; | 171 | 125 | 403 | | 18 | [user:gisp_zjz,2021-12-10] | 688 | — | 153 | 198 | 60 | 277

Full text and comments »

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

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

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

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

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

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

Full text and comments »

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

35.
By SpectralTech, 7 months ago, In English
Spectral::Cup 2026 Hi everyone! ------------ <p> <img style="float: right; margin: 0 1em 0.5em 1em; width: 400px;" src="/predownloaded/9b/5b/9b5bd2cb8efc932da2742d0fbb1ab589202373f4.png" alt="Spectral Technologies"> We're <a href="https://spectral.tech"><b>Spectral::Technologies</b></a> – a proprietary HFT firm building low-latency infrastructure and trading strategies for global markets. </p> <p> We started Spectral in 2019 around a single idea: bring together talented engineers and mathematicians, give them challenges worth getting obsessed over, and create an environment where they can reach their full potential. That's also why we support MCCME (НМУ), HSE, ITMO, SPbSU, and ICPC – places that develop the next generation of talent, and the people who make them work. </p> <p> We believe Codeforces is one of those key places. That is why we're happy to announce our very first tournament: <b>Spectral::Cup 2026</b>. We invite you to take part in the First Round of the Tourname...
tournament: Spectral::Cup 2026. We invite you to take part in the First Round of the

Full text and comments »

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

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

Full text and comments »

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

37.
By water, 14 years ago, In English
Codeforces Round #153(DIV 2) Tutorial My rating is just 1453 but I still wanner write my own tutorial to share with you. A. [problem:252A] This is a simple problem. We can write a algorithm using brute force. The complexity of it is O(n^3). My code [submission:2713341]. B.[problem:252B] This is a greedy problem. There are several special cases: 1. There is only one or two interger. Answer is "-1". 2. There are three interger and they are placed like "1 2 1" or "2 1 2", whatever you do you will make an sorted array. 3. All the numbers are the same so we can't make any operation. 4. Here are other cases: We find the first unequal pair searching from the head of the array, then we swap them. We will get the unsorted array unless what happen below: The pair are the first two numbers and the second is the max number or the min number. So we just search the unequal pair from the trail and swap them then we will get the right answer.The complexity of it is O(n). My code [submission:2714096] C.[problem:251A] Th...
Codeforces Round #153(DIV 2) Tutorial

Full text and comments »

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

38.
By Slow_But_Determined, history, 8 years ago, In English
Teams going to Gwalior/Pune Regionals **UPDATE:** I've uploaded the code that I used to generate this on Github, in case someone needs to generate something similar: [Codeforces Team Rating Calculator](https://github.com/abdullah768/Codeforces-Team-Rating-Calculator) The regional round has ended and here's the final Ranklist: https://www.codechef.com/public/rankings/ACM18GWR Inspired by the list of teams going to Kharagpur regionals, I decided to make one for Gwalior/Pune regionals. The list contains all the teams from the official Gwalior website. If you know the usernames of members of any of the teams. Please update the excel file: ### [HERE] (https://docs.google.com/spreadsheets/d/1jRvwzQzp1DOcazgI7jXBB8uY3u7Ze_eQ77Xa75_Q810/edit?usp=sharing) Team rating calculation has been done according to the official Codeforces team rating calculation formula. The table will be updated with details from the excel file every 6 hours or so. Last Updated: 10 pm, 12th December IST | No. | AIR | Team Name ...
/abdullah768/Codeforces-Team-Rating-Calculator) The regional round has ended and here's the final Ranklist

Full text and comments »

39.
By orz, history, 4 years ago, translation, In English
First Ever Users to Reach Some Rating Milestones Revised: ratings below 1500 and greatest rises Several days ago I published a [table](https://codeforces.me/blog/entry/104320) with first people to reach certain ratings. It featured only ratings above 1500, and [user:adamant,2022-07-09] advised to do the same, but on achieving ratings below 1500. I found it quite interesting, and, after several days of collecting data about participations of 447911 Codeforces users, I finally made this table. [cut] For several reasons I firstly put another table. This is the table of greatest rating rises 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 rise in ratings if you are low-rated. (Many people abuse this and deliberately get very low-rated to make a great jump.) 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...
] gaining 1978 rating points in a single round. This is not a bad participation at all but looking

Full text and comments »

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