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 tourist, 16 years ago, translation, In English
Разбор задач Codeforces Beta Round #17 <a href="http://codeforces.me/blog/entry/447">Обсуждение контеста</a><br><b><br>Задача A. Проблема Нольдбаха<br><br></b>В данной задаче нужно было уметь искать простые числа в диапазоне от $2$ до $N$. При этом ограничения позволяли искать их любым способом - как решетом Эратосфена, так и перебором всех возможных делителей числа.<br>Возьмём каждую пару соседних простых чисел и проверим, является ли их сумма, увеличенная на $1$, простым числом. Найдём количество таких пар, сравним с числом $K$ и выведем ответ.<br><br><b>Задача B. Иерархия</b><br>[cut]<br>Заметим, что если у каждого человека, кроме одного, будет ровно один начальник, то полученная иерархия будет древовидной.<br>Рассмотрим для каждого человека все заявления, в которых он фигурирует как подчинённый. Если более чем для одного человека таких заявлений не существует вообще, очевидно, что ответ -1. В противном случае, найдём минимальную стоимость такого заявления для каждого человека и сложим эти стоимости. Это и будет ответ.<b...
Разбор задач Codeforces Beta Round #17, %B5%D1%80%D0%B0_%28%D1%82%D0%B5%D0%BE%D1%80%D0%B8%D1%8F_%D1%87%D0%B8%D1%81 %D0%B5%D0%BB%29">теорему, %D1%8F_%D1%87%D0%B8%D1%81%D0%B5%D0%BB%29">теорему Эйлера: $A^{B'} = A^B$ (mod $C$), где $B' = B

Full text and comments »

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

2.
By RAD, 16 years ago, translation, In English
Codeforces Beta Round #32 (Div. 2, Codeforces format) <img src="http://assets.codeforces.com/happy_birthday_cake.gif" style="float:left;margin:0.5em;width:130px;"> <p class="MsoNormal">Внимание участникам Дивизиона 1! В Codeforces Beta Round #32 в качестве тестовой возможности будет доступно участие <b style="mso-bidi-font-weight: normal">«Вне конкурса»</b>.</p> <p class="MsoNormal">Как вы все прекрасно знаете, 2-ое октября – День рожденья <a href="http://ru.wikipedia.org/wiki/Махатма_Ганди">Махатмы Ганди</a>. Мы посвящаем сегодняшний раунд ему, и многим другим замечательным людям, <a href="http://ru.wikipedia.org/wiki/%D0%9A%D0%B0%D1%82%D0%B5%D0%B3%D0%BE%D1%80%D0%B8%D1%8F:%D0%A0%D0%BE%D0%B4%D0%B8%D0%B2%D1%88%D0%B8%D0%B5%D1%81%D1%8F_2_%D0%BE%D0%BA%D1%82%D1%8F%D0%B1%D1%80%D1%8F">родившимся 2-го октября</a> :)</p> <p class="MsoNormal">Раунд помогали готовить <a href="http://codeforces.me/profile/MikeMirzayanov">Михаил Мирзаянов</a>, <a href="http://codeforces.me/profile/Nerevar">Матов Дмитрий</a> и <a href="http://codeforces.me/p...
Codeforces Beta Round #32 (Div. 2, Codeforces format), %BE%D1%80%D0%B8%D1%8F:%D0%A0%D0%BE%D0%B4%D0%B8%D0%B2%D1%88%D0%B8%D0%B5%D1%81 %D1%8F_2_%D0%BE%D0%BA%D1, ;width:130px;"> Внимание участникам Дивизиона 1! В Codeforces Beta Round #32 в

Full text and comments »

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

3.
By Ripatti, 15 years ago, translation, In English
Codeforces Beta Round #81 <p>Hello everyone!<br><br>I am the author of problems of today round. <span class="Apple-style-span" style="font-family: verdana , arial , sans-serif;font-size: 12.0px;"><a class="rated-user user-admin" href="../../../profile/RAD" style="font-family: arial;text-decoration: none;font-weight: bold;color: rgb(0,0,204);" title="Штаб, RAD">RAD</a></span>,&nbsp;<span class="Apple-style-span" style="font-family: verdana , arial , sans-serif;font-size: 12.0px;"><a class="rated-user user-orange" href="../../../profile/Connector" style="font-family: arial;text-decoration: none;font-weight: bold;color: rgb(0,0,204);" title="Майор Connector">Connector</a></span>,&nbsp;<span class="Apple-style-span" style="font-family: verdana , arial , sans-serif;font-size: 12.0px;"><a class="rated-user user-red" href="../../../profile/it4.kp" style="font-family: arial;text-decoration: none;font-weight: bold;color: rgb(0,0,204);" title="Подполковник it4.kp">it4.kp</a></span> helped me to prepere this contest. <spa...
Codeforces Beta Round #81, I am the author of problems of today round.

Full text and comments »

Announcement of Codeforces Beta Round 81
  • Vote: I like it
  • -7
  • Vote: I do not like it

4.
By Zlobober, 14 years ago, translation, In English
Anti-hash test. Всем привет. Хочу поделиться с общественностью некоторым фактом, который позволяет ломать с гарантией почти любое решение, использующее полиномиальные хэши от строк, где в качестве модуля используется $2^64$ тестом длины порядка нескольких тысяч. Причём, не важно, какое число берётся за точку в полиноме, важно лишь, что все вычисления производятся в типе int64 со стандартными переполнениями &mdash; а так пишут большинство олимпиадников. Для привлечения внимания ключевые слова: не пишите, как написано у [е-макса](http://e-maxx.ru/algo/string_hashes)! И только сегодня, только для вас &mdash; ломаем решение [user:Petr,2012-07-18] на задаче [problem:7D] с Codeforces Beta Round #7! Интересно? Прошу под кат. [cut] Для начала, для самых нетерпеливых. Тест генерируется следующим кодом: ~~~~~ const int Q = 11; const int N = 1 << Q; char S[N]; ~~~~~ <div style="color:white;font-family: Consolas,Courier;">// ЛОПАТА ибо нефиг копипастить во время контеста :-)</div>...
— ломаем решение [user:Petr,2012-07-18] на задаче [problem:7D] с Codeforces Beta Round #7, ,2012-07-19]'s solution in problem [problem:7D] from Codeforces Beta Round #7! Is it interesting

Full text and comments »

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

5.
By kostka, 12 years ago, In English
Hackers ranking (beta) ### FAQ **What is this?** Have you ever wondered who is the best hacker on Codeforces? Here is simple solution, which would try to answer for your problem! I would like to introduce new system of grading hackers in rounds. [cut] <p></p> <b>How does it work?</b> The whole rating system is based on <a href="http://en.wikipedia.org/wiki/Elo_rating">Elo rating</a>. The problem is how to measure user's performance in each round. **Yes, how?** The whole system is now in phase of testing, so some solutions may be changed (and probably will be changed :)). So let's consider some user during some round. Let's call him Bob. **I want to choose another name, may I?** No. **Ok.** So, let's say that Bob solved three problems: A, B and C (Bob is pretty sad), but also hacked one solution for B and had one unsuccessful hack attempt. Bob doesn't know that his solution for C won't pass system tests. How would we know if it was good or bad? At first, we will look at al...
Hackers ranking (beta), to measure user's performance in each round. **Yes, how?** The whole system is now in phase of

Full text and comments »

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

6.
By Ripatti, 15 years ago, translation, In English
Solutions for Coferorces Beta Round #81 <p><b>A</b>. (<a href="http://codeforces.me/contest/105/problem/A">link</a>) In this problem you should do just that is written in the statement. At the first you should read all skills and multiply all levels of them by koefficient $k$. Next you should drop all skills which have level less than 100. After that you should add all new skills from the second list but only those thah are not present in the second list. At the end you should sort all skills by thier names and output them.<br>[cut]<br>***<br><br>Problem with precision in this problem a bit shocked an author. This catch was not planned. Author's solution and all verifying solutions use integer arithmetic and think about probably problems didn't occur. In other side, it confirms following rule in the olympiad programming: be careful with comparation of floating numbers and if it is possible do it in integers.<br><br><b>B.</b> (<a href="http://codeforces.me/contest/105/problem/B">link</a>) Solution of this problem is search ...
Solutions for Coferorces Beta Round #81, Разбор задач Coferorces Beta Round #81

Full text and comments »

Announcement of Codeforces Beta Round 81
  • Vote: I like it
  • 0
  • Vote: I do not like it

7.
By akirakaze, 16 years ago, In English
Codeforces Beta Round #17 <div style="margin: 0px; padding: 0px; font-family: verdana,arial,sans-serif; font-size: 12px; line-height: 20px;">Welcome all to C<a href="http://codeforces.me/contests">odeforces Beta Round #17</a>, which will be held&nbsp;<span class="Apple-style-span" style="font-family: arial,sans-serif; line-height: normal; font-size: 13px; border-collapse: collapse;"><a href="http://timeanddate.com/worldclock/fixedtime.html?year=2010&amp;month=06&amp;day=10&amp;hour=15&amp;min=00&amp;sec=0&amp;p1=0">10 June (Thursday) 2010, 19:00 (UTC +4, Moscow time)</a></span>. This contest will represent I.</div><div style="margin: 0px; padding: 0px; font-family: verdana,arial,sans-serif; font-size: 12px; line-height: 20px;">I would like to thank&nbsp;<a href="http://codeforces.me/profile/MikeMirzayanov">Mike Mirzayanov</a>&nbsp;who made this contest possible,&nbsp;<a href="http://codeforces.me/profile/RAD">Artem Rakhov</a>&nbsp;for helping to test authors solutions&nbsp;and<span class="Apple-style-span" styl...
Codeforces Beta Round #17, -height: 20px;">I hope that number

Full text and comments »

Announcement of Codeforces Beta Round 17
  • Vote: I like it
  • +31
  • Vote: I do not like it

8.
By map, 16 years ago, translation, In English
Codeforces Beta Round #63 (Div. 2) <p class="MsoNormal" style="line-height:15.0pt"></p><p class="MsoNormal"><span lang="EN-US" style="mso-ansi-language:EN-US">Hello!<o:p></o:p></span></p> <p class="MsoNormal">Today <a href="http://codeforces.me/profile/map">I</a> am the author of all tasks. At the contest you will be asked to help students from <a href="http://en.wikipedia.org/wiki/Chelyabinsk">Chelyabinsk</a><a href="http://ru.wikipedia.org/wiki/%D0%A7%D0%B5%D0%BB%D1%8F%D0%B1%D0%B8%D0%BD%D1%81%D0%BA"> </a>in solving their non-trivial problems.</p> <p class="MsoNormal"><span lang="EN-US" style="mso-ansi-language:EN-US">I want to thank all those who helped me to prepare the round: <a href="http://codeforces.me/profile/kreep">Anton Garder</a> for his invaluable assistance in the preparation of sets of tasks, <a href="http://codeforces.me/profile/BLIZZARD">Demid Kucherenko</a> for assistance in the preparation of conditions, <a href="http://codeforces.me/profile/RAD">Artem Rakhov</a> for coordinating the ac...
Codeforces Beta Round #63 (Div. 2), %B8%D0%BD%D1%81%D0%BA"> in solving their non-trivial problems., ://ru.wikipedia.org/wiki/%D0%A7%D0%B5%D0%BB%D1%8F%D0%B1%D0%B8%D0%BD%D1%81 %D0%BA">in solving their, ://ru.wikipedia.org/wiki/%D0%A7%D0%B5%D0%BB%D1%8F%D0%B1%D0%B8%D0%BD%D1%81 %D0%BA">Челябинским

Full text and comments »

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

9.
By LGM, 16 years ago, In English
Codeforces Beta Round #57 (Div. 2) <p class="MsoNormal" style="margin-bottom: 12pt; line-height: 12.5pt;"> Здравствуйте!<br> <br> Я рад пригласить вас принять участие в Codeforces Beta Round #57 (Div. 2).<br> Сегодняшнее соревнование подготовили <a href="http://www.codeforces.com/profile/aryobarzan">Amir Goharshady</a>&nbsp;и <a href="http://www.codeforces.com/profile/LGM">я</a>.<br> <br> Мы благодарим <a href="http://www.codeforces.com/profile/MikeMirzayanov">Михаила Мирзаянова</a>,&nbsp;<a href="http://www.codeforces.com/profile/RAD">Артема Рахова</a>,&nbsp;<a href="http://www.codeforces.com/profile/mjn">Mohammad Javad Naderi</a>,&nbsp;<a href="http://www.codeforces.com/profile/mr.ilchi">Saeed Ilchi</a>&nbsp;и Марию Белову.<br> <br> Сегодняшний контест посвящен&nbsp;<a href="http://ru.wikipedia.org/wiki/%D0%90%D1%82-%D0%A2%D1%83%D1%81%D0%B8,_%D0%9D%D0%B0%D1%81%D0%B8%D1%80_%D0%B0%D0%B4-%D0%94%D0%B8%D0%BD">Khaje Nasir Tusi</a>,&nbsp;сегодня в Иране день техники.</p><p class="MsoNormal" style="marg...
Codeforces Beta Round #57 (Div. 2), %D1%81%D0%B8,_%D0%9D%D0%B0%D1%81 %D0%B8%D1%80_%D0%B0%D0%B4-%D0%94%D0%B8%D0%BD">Khaje Nasir Tusi

Full text and comments »

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

10.
By Seikang, 15 years ago, In English
Problem A. Codeforces Beta Round 81 <p>Hello:</p><div><br></div><div>Is the mastering in details the best way of assess a good programmer? Perhaps, but not at least in algorithm programming.&nbsp;</div><div><br></div><div>It's awful and cruel that some precision error of C or C++ led us to WA:</div><div><span class="Apple-style-span" style="font-family: verdana, arial, sans-serif; font-size: 15px; background-color: rgb(255, 255, 255); ">9400 * 0.99 = 9306<br></span></div><div><span class="Apple-style-span" style="font-family: verdana, arial, sans-serif; font-size: 15px; background-color: rgb(255, 255, 255); ">C, C++: (int)(9400 * 0.99) = 9305 Perhaps in other languages too.</span><br></div><div><span class="Apple-style-span" style="font-family: verdana, arial, sans-serif; font-size: 15px; background-color: rgb(255, 255, 255); "><br></span></div><div><span class="Apple-style-span" style="font-family: verdana, arial, sans-serif; font-size: 15px; background-color: rgb(255, 255, 255); ">High experienced programmers eventuall...
Problem A. Codeforces Beta Round 81

Full text and comments »

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

11.
By SummerSky, 9 years ago, In English
Notes on Codeforces Beta Round #81, A, B [problem:105A] It seems that the difficulty of this problem mainly lies in the precision. Suppose that we are given an integer $F$ and a float number $L$, and asked to compute the value of $\lfloor F \times L \rfloor$. One can implement the above calculation based on float numbers, however this might lead to some weird precision problem. Instead, as for this specific problem, one can write $L$ in the fractional form of $\frac{A}{B}$, where both $A$ and $B$ are integers, and $A$ can be obtained by extracting from the given input while $B=100$. With this transformation, $\lfloor F \times L \rfloor$ can be equivalently calculated as $F*A/B$, where “/” denotes the “integer division”. [problem:105B] We use DFS to generate all the feasible patterns of distributing candies. For each configuration, we calculate the probability of winning by enumerating all the possible results of voting. The results of voting can be represented based on bitmasks. For instance, 0011 denotes that the f...
Notes on Codeforces Beta Round #81, A, B

Full text and comments »

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

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

13.
By tatuyan_edson, 15 years ago, In English
Codeforces Beta Round #81 Report I up report, as usual. However,this round,I gave up only solving problem A. So, it's boring.<div><br></div><div>English(英語):<a href="http://programming-tatuyan.blogspot.com/2011/08/codeforces-beta-round-81-report.html">http://programming-tatuyan.blogspot.com/2011/08/codeforces-beta-round-81-report.html</a></div><div><br></div><div>Japanese(日本語):<a href="http://programming-tatuyan.blogspot.com/2011/08/codeforces-beta-round-81.html">http://programming-tatuyan.blogspot.com/2011/08/codeforces-beta-round-81.html</a></div>
Codeforces Beta Round #81 Report, -81.html">http://programming-tatuyan.blogspot.com/2011/08/codeforces-beta-round- 81.html, -round-81 -report.html">http://programming-tatuyan.blogspot.com/2011/08/codeforces-beta- round-81, English(英語):, I up report, as usual. However,this round,I gave up only solving problem A. So, it's boring.

Full text and comments »

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

14.
By Leeking, history, 2 weeks ago, In English
New API endpoint just dropped <div style="text-align: center;"> <img src="/predownloaded/a0/16/a016754902c9cc770b0222d6d1fe251cbf729fb2.png" alt="Description" style="display: inline-block; max-width: 100%; height: auto;"> </div> ## TL;DR - **LeekCF-Hinter** is a free, open-source (Apache-2.0) public API. `GET /v1/problems/{contestId}/{index}/hints` returns **2 to 5 graded hints** for a Codeforces problem: a small nudge first, the full solution last. No key, no account. **Check it out: https://leekcf-hinter-api.leekcf.workers.dev .** - **Any extension, app, bot or person can use it.** It is a plain public API with open CORS, so a browser extension can call it directly. - **LeekCF-Ratings already uses it today.** Install the extension ([Chrome](https://chromewebstore.google.com/detail/leekcf-rating/fnkoldggbbjmndapidpegfpkkokboklp) or [Firefox](https://addons.mozilla.org/en-US/firefox/addon/leekcf-rating)), open a problem and click **Show Hints**. You can watch the requests yourself in DevTools. - **6,833 ...
contests that are over, plus a 2-hour margin for system tests, so a live round is never spoiled

Full text and comments »

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

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