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 yeputons, 16 years ago, translation, In English
Codeforces Beta Round #54 (Div.2) - разбор A-D <div align="center"><b>Problem A. Chat room<br></b><div align="left">Solution is greedy algorithm. The first thing we do is find in our string the first letter 'h'. Then we find letter 'e' which is righter that found 'h'. If we find the whole word 'hello' in such way, obliviously, answer is YES.<br>Now let's prove that if answer exists, we find it. Let see on position of the 'h' in right answer. If we move it to the first 'h' in our string, nothing changes. But now we can say that our greedy algorithm correctly Now let's do such with the second letter, and so on.<br>We have greedy algorithm with work time O(n), where n - length of the input.<br></div><br><div align="left"><div align="center"><b>Problem B. Coins<br></b><div align="left">This problem also have greedy solution: we run down all number from 2 and greater and while denomination of the last added to answer coin is divisible by current number, we divide and increase answer.<br>You can prove correctness, if you take a look at p...
Codeforces Beta Round #54 (Div.2) - разбор A-D

Full text and comments »

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

2.
By PavelKunyavskiy, 15 years ago, translation, In English
Codeforces Beta Round #73 <p>Приветствуем всех на первом летнем раунде - Codeforces Beta Round #73</p><div>Авторами этого соревнования являемся мы: <a href="http://codeforces.me/profile/kuniavski" title="Полковник kuniavski" class="rated-user user-red" style="font-family: arial; text-decoration: none !important; font-weight: bold; color: rgb(0, 0, 204); ">kuniavski</a>&nbsp;(Павел Кунявский) и <a href="http://codeforces.me/profile/Zlobober" title="Майор Zlobober" class="rated-user user-orange" style="font-family: arial; text-decoration: none !important; font-weight: bold; color: rgb(0, 0, 204); ">Zlobober</a>&nbsp;(Макс Ахмедов). Соревнование проходит одновременно в двух дивизионах. Суммарно вам будет предложено 7 различных задач с вариациями в разных дивизионах, по 5 в каждом дивизионе. Мы надеемся что все смогут показать свой результат и решить как можно больше задач. <div><br>Мы хотим поблагодарить <a href="http://codeforces.me/profile/RAD" title="Штаб, RAD" class="rated-user user-admin" style="font-family: ...
Codeforces Beta Round #73, (0, 0, 204); ">peter50216 54:00, ;54:00

Full text and comments »

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

3.
By Sammarize, 15 years ago, translation, In English
Codeforces Beta Round 79, editoral <h3><b>1. Clothes&nbsp;(A Div-2)</b></h3><div>In this problem constraints are allow to look throw all triples of clothes. For every triple one can check if all elements of tripe areturn out to match with others, and anong those triples find one whith minimal cost.</div><div><br /></div><h3><b>2. Sum of digits (B Div-2)</b></h3><div>Initial number consist of no more then $100000$ digits. Therefore after first transform resulting number will be no more then $900000$, and then it will constist of no more then $6$ digits. Thus after next transform number will be no more then $54$ and so it will be two-digit or one-digit. Sum of digits of a two-digit number no more, then $18$, and sum of digit of such number no more, then $9$.</div><div>Thus Gerald can't do nore, then $4$ transforms. First transform one can implement one simple pass throw symbols of given string. Following operations take very little time.</div><div><br /></div><h3><b>3. Homework&nbsp;(C Div-2, A Div-1)</b></h3><div>Lets co...
Codeforces Beta Round 79, editoral, Codeforces Beta Round 79, разбор задач, constist of no more then $6$ digits. Thus after next transform number will be no more then $54$ and, no more then $6$ digits. Thus after next transform number will be no more then $54$ and so it will, второго применения заклинания число станет не больше, чем $9 \cdot 6 = 54$. То есть, число будет не, . После второго применения заклинания число станет не больше, чем $9 \cdot 6 = 54$. То есть, число

Full text and comments »

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

4.
By Sagita_Phoenix, history, 2 years ago, In English
Codeforces Round #983 (Div. 2) ### Hello Codeforces! $\newline$ <spoiler summary="From AkiLotus"> > "<span style="color: red">K</span>aleidoscopic, this place still is. How long have I been away...?" Hi. Akik<span style="color: red">a</span>ze a.k.a. AkiLotus here. Four years have passed, lo<span style="color: red">n</span>g enou<span style="color: red">g</span>h huh? I h<span style="color: red">o</span>pe that after all these times, I am not too rusty to set good tas<span style="color: red">k</span>s for yo<span style="color: red">u</span> to enjoy, starting with <span style="color: red">t</span>his <span style="color: red">o</span>ne! <strong>See yo<span style="color: red">u</span> in the round!</strong> <span style="color: #ec3e9d"><i>"Waeeguyehy" is coming soon.</i></span> </spoiler> It's been a while, today [user:AkiLotus,2024-07-29] and I are delighted to invite you to participate in [contest:2032]. This round will be <strong>rated</strong> for all participants with a rating lower than <...
Codeforces Round #983 (Div. 2), style="color: red">one! See you in the round!

Full text and comments »

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

5.
By applepi216, 2 years ago, In English
Codeforces Round 986 (Div. 2) Hello Codeforces! ----------------- I am glad to invite you to [contest:2028], which will start on [contest_time:2028]. **Note the slightly unusual start time.** The contest will run for 2 hours and have 6 tasks. The contest will only be rated for those with a rating not higher than 2099, but we welcome higher rated users to participate out of competition. Holding the contest would have been impossible without: - [user:flamestorm,2024-11-09] for insanely excellent coordination, without whom this round would certainly not happen. - [user:Vince729,2024-11-09] and [user:swagchicken,2024-11-09] for lots of discussions about the problems and proposing other problem ideas :) - [user:conqueror_of_tourist,2024-11-09], [user:BucketPotato,2024-11-09], [user:Dominater069,2024-11-09], [user:sstrong,2024-11-09], [user:triple__a,2024-11-09], [user:xiaowuc1,2024-11-09], [user:lucasxia01,2024-11-09], [user:n0sk1ll,2024-11-09], [user:nikilrselvam,2024-11-09], [user:thanhchauns2,2024-11-0...
Codeforces Round 986 (Div. 2), , without whom this round would certainly not happen. - [user:Vince729,2024-11-09] and [user:swagchicken

Full text and comments »

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

6.
By SummerSky, 9 years ago, In English
Notes on Codeforces Beta Round #54, A, B, C, D(Bucket Sort) A. Chat room Suppose that the given string is denoted as S while "hello" is denoted as T. We can solve the problem by adopting two pointers pS and pT, which point to string S and T, respectively. At first, both pS and pT are set to 0. Then, we increase pS by 1 until it reaches the end of string S. During this process, once it occurs that S[pS]=T[pT], we immediately increase pT by 1 as well. Note that when pT reaches the end of string T, we can break the loop. After all the characters in string S have been visited, and the loop is over (or we break the loop), we can check whether pT has arrived at the end of string T or not. If the answer is YES, it means that we can obtain "hello" from the original given string; otherwise we should output NO. B. Coins For any integer N, we can find all its prime divisors and write it in the form of N=p1^a1*p2^a2*...pn^an, where pi is a prime divisor while ai denotes the number of pi that N has. Intuitively, we may come up with such a sequence ...
Notes on Codeforces Beta Round #54, A, B, C, D(Bucket Sort)

Full text and comments »

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

7.
By vish, 16 years ago, In English
Blog collection <p>________________________________________________________________________________________<br><br></p><h3><b>Puzzle</b></h3><ul><li><a href="http://codeforces.me/blog/entry/66">Red and Black hair</a>, </li><li><a href="http://codeforces.me/blog/entry/112">The 12 chairs and diamonds</a></li><li><a href="http://codeforces.me/blog/entry/228">Monty Hall Problem</a></li></ul><br><br><h3>Useful <br></h3><ul><li><a href="http://codeforces.me/blog/entry/70">Petr Mitrichev, 3 days in Sao Paulo Training Camp 2010</a></li><li><a href="http://codeforces.me/blog/entry/512">Useful links</a></li><li><a href="http://codeforces.me/blog/entry/529">Problem Set Analysis Of CodeForces</a></li><li><a href="http://codeforces.me/blog/entry/546">Discussions Of CodeForces Round</a></li><li><a href="http://codeforces.me/blog/entry/1492">ALL CodeForces rounds Tutorial</a></li><li><a href="http://codeforces.me/blog/entry/1534">Online Judge Locator</a></li><li><a href="http://codeforces.me/blog/entry/170...
="http://codeforces.me/blog/entry/1197">Codeforces Beta Round #54 (Div. 2), , > * Codeforces Beta Round #54 (Div. 2), <http://codeforces.me/blog/entry/1197>

Full text and comments »

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

8.
By k06a, 16 years ago, In Russian
Графики зависимости числа баллов от занятого места <div>В эту запись буду добавлять графики с каждого раунда (пока этот процесс не автоматизируют создатели Codeforces).<br></div><div>[cut]</div><b>Codeforces Beta Round #52:</b><div><b><img src="http://img690.imageshack.us/img690/3655/cfbr52640.png"><br></b></div><div><b><br></b></div><div><b><span class="Apple-style-span" style="font-weight: normal; "><b>Codeforces Beta Round #53:</b></span><br></b></div><div><b><span class="Apple-style-span" style="font-weight: normal; "><b><img src="http://img15.imageshack.us/img15/9339/cfbr53640.png"><br></b></span></b></div><div><b><span class="Apple-style-span" style="font-weight: normal; "><b><br></b></span></b></div><div><b><span class="Apple-style-span" style="font-weight: normal; "><b><span class="Apple-style-span" style="font-weight: normal; "><b><span class="Apple-style-span" style="font-weight: normal; "><b>Codeforces Beta Round #54:</b></span></b></span><br></b></span></b></div><div><b><span class="Apple-style-span" style="font-weight: nor...
; ">Codeforces Beta Round #54:, >Codeforces Beta Round #54:

Full text and comments »

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

9.
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...
: Other Kind of Contest in Codeforces (Except of Codeforces Beta Round) .

Full text and comments »

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

10.
By MikeMirzayanov, 16 years ago, translation, In English
Codeforces Beta Round #54 (Div. 2) <p> Hello! </p> <p> This contest has been prepared by Artem Rakhov and other participants of Petrozavodsk Training Camp from Saratov State University. We stopped solving problems of the camp, missed the lecture by Vitaly Goldstein (do not be angry, Vitaly), but the round has been prepared and we are waiting for you - the participants. </p> <p> Happy hacking,<br> MikeMirzayanov and team Codeforces </p><p><b>UPD:</b></p><p></p><ul><li><a href="http://codeforces.me/contest/58">Problems</a><br></li><li><a href="http://codeforces.me/contest/58/standings">Standings</a></li><li>Winner: <a href="http://codeforces.me/profile/winmad">winmad</a></li></ul><p></p>
Codeforces Beta Round #54 (Div. 2), Vitaly Goldstein (do not be angry, Vitaly), but the round has been prepared and we are waiting for, , missed the lecture by Vitaly Goldstein (do not be angry, Vitaly), but the round has been prepared and

Full text and comments »

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

11.
By gchandel6, 12 years ago, In English
WRONG ANSWER ON CODEFORCES , SHOWING DIFFERENT OUTPUT Hello everyone , i am new to codeforces and as i was solving my first problem "SPREADSHEETS" from codeforces beta round #1 , which is showing wrong_answer in test1 , while in my g++ compiler its giving correct output for that case ...please anyone help....why is this happening?? THIS IS LINK TO MY CODE:::: http://ideone.com/25zz0L TEST CASE : 2 R23C55 BC23 ANSWER : BC23 R23C55 ON MY COMPUTER : BC23 R23C55 CODEFORCES SHOWING : BC23 R23C54 Why is codeforces showing 54 instead of 55?
codeforces beta round #1 , which is showing wrong_answer in test1 , while in my g++ compiler its

Full text and comments »

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

12.
By gchandel6, 12 years ago, In English
WRONG_ANSWER IN TEST1!!! Hello everyone , i am new to codeforces and as i was solving my first problem "SPREADSHEETS" from codeforces beta round #1 , which is showing wrong_answer in test1 , while in my g++ compiler its giving correct output for that case ...please anyone help....why is this happening?? THIS IS LINK TO MY CODE:::: http://ideone.com/25zz0L TEST CASE : 2 R23C55 BC23 ANSWER : BC23 R23C55 ON MY COMPUTER : BC23 R23C55 CODEFORCES SHOWING : BC23 R23C54 Why is codeforces showing 54 instead of 55?
codeforces beta round #1 , which is showing wrong_answer in test1 , while in my g++ compiler its

Full text and comments »

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

13.
By CtrlAlt, 15 years ago, In Russian
Поправочные коэффициенты и инфляция рейтинга <P>Результат последнего контеста оказался для меня довольно неожиданным, поэтому я решил собрать немного больше информации о возможностях изменения рейтинга CF. Если профиль участника позволяет наблюдать историю изменения&nbsp;его рейтинга, то у меня получились "профили контестов", в которых отражены рост или падение каждого участника конкретного соревнования.<BR>[cut]<BR><A href="http://codeforces.me/blog/entry/102">Формула расчёта&nbsp;рейтинга Codeforces</A> подразумевает сохранение суммы очков всех участников до и после раунда за счёт поправочных коэффициентов. На основании же обработанной мной информации получилась такая табличка:</P> <TABLE style="WIDTH: 100%" border=1> <TBODY> <COLGROUP> <COL width="20%"> <COL width="20%"> <COL width="20%"> <COL width="20%"> <COL width="20%"> <TBODY> <TR> <TD>ID контеста</TD> <TD>Суммарный рейтинг до соревнования</TD> <TD>Суммарный рейтинг после соревнования</TD> <TD>Разность конечного и исходного суммарных рейтингов</TD> <TD>Коли...
20000 пунктов — это Manthan и последний Codeforces Beta Round #81. В чём же причина подобных, Beta Round #81. В чём же причина подобных отклонений?

Full text and comments »

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