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 Enchom, 12 years ago, In English
Who sorry_dreamoon really is Hello everybody. So I was really bored tonight and looked at so many comments being like "[user:sorry_dreamoon,2015-02-18] is X" and then people arguing and disagreeing. Since I had nothing better to do, I decided to finally unravel the truth of who he actually is. Here is the full case and how I actually got to him, hope you enjoy! :D Selection ------------------ Let's start by the obvious. He managed to get first place in Div2 and he got second in Div1 (would've been first if the scores were static). So what we know is that he is really good. Let's look at the past 10 Div1 contests. It turns out that only 8 times it happened that someone with a rating of less than 2500 got in top5. This is 8 times out of 50 people being in top5. But he was second and almost first, so he is better than that. It turns out actually, that in the past 10 Div1 contests, only 2 times it happened that someone with rating less than 2500 got in top3. Combining this information with [user:sorr...
#284 and #292, as those are the rounds [user:sorry_dreamoon,2015-02-18] participated in. Obviously, out a few times, the obvious way is to remove all people that participated in CF rounds #284 and #292

Full text and comments »

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

2.
By gridnevvvit, 12 years ago, translation, In English
Codeforces Round #284 [Скоро](http://timeanddate.com/worldclock/fixedtime.html?day=24&month=12&year=2014&hour=19&min=30&sec=0&p1=166) состоится очередной раунд Codeforces Round #284, задачи для которого готовили Виталий Гриднев ([user:gridnevvvit,2014-12-23]), Илья Лось ([user:IlyaLos,2014-12-23]), Данил Сагунов ([user:dans,2014-12-23]). Большое спасибо Максиму Ахмедову ([user:Zlobober,2014-10-22]) за помощь в подготовке задач, Марии Беловой ([user:Delinur,2014-10-22]) за переводы на английский, Михаилу Мирзаянову ([user:MikeMirzayanov,2014-10-22]) за замечательные системы Codeforces и Polygon. Будет использоваться динамическая разбалловка. Задачи расположены в порядке возрастания предполагаемой сложности. Раунд окончен, поздравляем победителей! Div1: 1. [user:yeputons,2014-12-24] 2. [user:rng_58,2014-12-24] 3. [user:Endagorion,2014-12-24] 4. [user:KADR,2014-12-24] 5. [user:Egor,2014-12-24] 6. [user:uwi,2014-12-24] 7. [user:mmaxio,2014-12-24] 8. [user:atetubou,2014-12-24] 9. [user:RAV...
Codeforces Round #284, Round finished, congratulations to winners!, We want to thank Max Akhmedov ([user:Zlobober,2014-10-22]) for help with preparation of thisround

Full text and comments »

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

3.
By danilka.pro, 12 years ago, In English
Codeforces Round #284 Editorial ## [problem:499A] One can solve the problem using greedy algorithm: if we can skip $x$ minutes at current moment without skipping any good moment — we do that, otherwise — watch another minute of the film. ## [problem:499B] In this task you must find for every string in the text the pair containing that string, and from two strings of that pair output the shortest one. ## [problem:498A] / [problem:499C] It can be easily proved that, if two points from statement are placed on different sides of some line, this line will be crossed anyway. So, all we need to do is to cross all these lines, so the answer is the number of these lines. To check if two points lies on different sides of a line one can simply use its coordinates to place in line equation and check if these two values have different signs. Solution complexity — $O(n)$. ## [problem:498B] / [problem:499D] Let's numerate all the songs and seconds starting from 0. Problem will be sol...
Codeforces Round #284 Editorial, Разбор Codeforces Round #284

Full text and comments »

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

4.
By vovuh, history, 9 years ago, translation, In English
Educational Codeforces Round 36 [Rated for Div. 2] Hello Codeforces! On [January 13, 16:05 MSK](https://www.timeanddate.com/worldclock/fixedtime.html?day=13&month=1&year=2018&hour=16&min=5&sec=0&p1=166) Educational Codeforces Round 36 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be (traditionally now) **rated for Div. 2**. It will be held on extented ACM ICPC rules. After the end of the contest you will have one day to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were prepared by Mikhail [user:PikMike,2018-01-12] Piklyaev, Ivan [user:BledDest,2018-01-12] Androsov, Sergey [user:sslotin,2018-01-13] Slotin and me....
Educational Codeforces Round 36 (рейтинговый для Див. 2), Educational Codeforces Round 36 [Rated for Div. 2], /fixedtime.html?day=13&month=1&year=2018&hour=16&min=5&sec=0&p1=166) Educational CodeforcesRound 36 will start, /fixedtime.html?day=13&month=1&year=2018&hour=16&min=5&sec=0&p1=166) начнётся Educational CodeforcesRound, > [user:LHiC, 2018-01-14] 7 284 5, >4 [user:LHiC, 2018-01-14] 7 284

Full text and comments »

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

5.
By kostka, 12 years ago, In English
Hack me! (Codeforces Round #284 (Div. 1)) Let's take a look at Christmas Round ([contest:498]). Because of not-so-good scheduling, I didn't take part in it ([neither any of my friends did](http://www.test.weaselcrow.com/cfhacks/498-1.png)). In Poland, it is a nice time to spend time with family, not like [this](http://www.test.weaselcrow.com/cfhacks/498-2.jpg). If you are interested how Christmas look like in Poland, check out [polishchristmasguide.com](http://polishchristmasguide.com/). Ok, enough complaining, let's look at the hacks. Previous posts can be found [here](http://codeforces.me/search?query=hackme), including [post for div. 2](/blog/entry/15434). [cut] <h3>Stats</h3> Problem | <small>Successful hacks</small> | <small>Unsuccessful hacks</small> | Other* | Sum | <small>Solutions which can be hacked</small> | <small>Accepted solutions</small> | <small> All solutions on final tests</small>|<small>Hackers efficiency**</small>| :---:|:---:|:---:|:---:|:---:|:---:|:---:| <small> [problem:498A] </smal...
Hack me! (Codeforces Round #284 (Div. 1)), Let's take a look at Christmas Round ([contest:498]).

Full text and comments »

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

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

Full text and comments »

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

7.
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:Nachia,2020-12-08] | 38 | — | — | 22 | 16 | — | — | | 284 | [user:6aren,2020, 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

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

9.
By KiAsaGibona, 12 years ago, In English
For My Future References Round 284 Div1 B [Problem Link](http://codeforces.me/contest/498/problem/B) [My Solution](http://codeforces.me/contest/498/submission/9338401) **Spacial Thanks:** * **Prajogo Tio** his [blog](http://abitofcs.blogspot.com/) has some nice explanations of some problems and he helped me a lot. (anybody knows his CodeForces User Id??) * **[user:Hasan0540,2015-01-01]** (I analyzed his code and he helped me understanding his logic, Also my code was motivated by his code) #### MY THOUGHTS Let **dp[i][j]** is the expected value for guessing **i**-th song at **j**-th second. Then, say we want to guess the **i** th song at **4**th second like this, **(a)** guess the **i** th song at **4** th second. and already have guessed the **i-1** th song at **3** dh second **dp[i][4]** = ( **dp[i-1][3]** +1) X **P[i]** + **(b)** guess the **i** th song at **4** th second, and already have guessed the **i-1** th song at **2** nd second **dp[i][4]**...
For My Future References Round 284 Div1 B

Full text and comments »

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

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

11.
By tom, 12 years ago, In English
Codeforces Round #284 Round 284 is going to take place on December 24th. It's Christmas Eve. Can you reschedule it to <= 23rd or >=27th December, please?
Codeforces Round #284, Round 284 is going to take place on December 24th. It's Christmas Eve. Can you reschedule it to

Full text and comments »

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

12.
By EbTech, 7 years ago, In English
How to Interpret Contest Ratings **UPDATE: the [new rating system paper](https://arxiv.org/abs/2101.00400) will appear in the Web Conference 2021!** If you're new to competitive programming, you may be wondering: what are ratings and colors? What do they mean? As a contestant and now coach of the UBC team, I've taken enough interest in the subject to have developed my own rating system, Elo-MMR, which I might describe in a future blog post. For now, I want to talk about ratings more generally: what does it mean to achieve a certain rating or title? How concerned should you be with your rating and title? Might it be harmful to be concerned with them at all? A Brief History of Contest Ratings -------------------------------------- Contest rating systems can trace their heritage back to the [Elo system](https://en.wikipedia.org/wiki/Elo_rating_system). Elo was devised for 2-player games, with rating updates based on whether a player wins, loses or draws. Starting in 1960, it was adopted by the chess community ...
| 3968 | 93 | 1804-2088 (284) | | 1600-1799 | ** Expert

Full text and comments »

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

13.
By kornfire, 12 years ago, In English
Round #284 (Div. 2) Problem A [Watching a movie] Is first test case right?? Problem statement is here[[Link](http://codeforces.me/contest/499/problems)] I have below solution to the problem. ~~~~~ #include <bits/stdc++.h> using namespace std; const int MAXLEN = 100001; int main() { ~~~~~ int n; cin >> n; int x; cin >> x; deque<pair<int, int> > input; int st, end; for(int i = 0; i < n; i++) { cin >> st; cin >>end; input.push_back(make_pair(st, end)); } int trav = 1; int sum = 0; while(!input.empty()) { int nxt = input.front().first; while(trav <= nxt) { trav += x; } trav -= x ; int last = input.front().second ; sum += last - trav + 1; trav = last ; input.pop_front(); } cout << sum <<endl; return 0; } For very first test case, my solution prints 7 while accepted answer is 6. With several attempts i am not able to think wha...
Round #284 (Div. 2) Problem A [Watching a movie] Is first test case right??

Full text and comments »

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

14.
By adrien1018, history, 9 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=...
>4 [user:snuke,2018-07-16] -284

Full text and comments »

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

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