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 kuviman, history, 11 years ago, translation, In English
Showing local times on Codeforces Hello everyone! Up to this day Codeforces showed local server time everywhere, and programmers all around the world knew exactly what 19:35 Moscow time corresponds to in their time zone. Now it will be much harder for you to make a mistake and skip another round, since you are going to see time in your time zone. This is what a usual London programmer sees waiting for Codeforces Round #337 (Div. 2): ![ ](http://codeforces.me/predownloaded/8f/3d/8f3d3d43fe4445028d649ba6db82fec68657e112.png) The problem was not that easy to implement, since many parts of the site are heavily cached, and we had to manipulate time directly in browser using JavaScript. Thanks for your attention, good luck to all at the next round!
in your time zone. This is what a usual London programmer sees waiting for Codeforces Round #337, поясе. Вот, к примеру, что видит простой лондонский программист в ожидании Codeforces Round #337, This is what a usual London programmer sees waiting for Codeforces Round #337 (Div. 2): ![ ](http, Вот, к примеру, что видит простой лондонский программист в ожидании Codeforces Round #337 (Div. 2

Full text and comments »

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

2.
By fchirica, 13 years ago, In English
Codeforces Round #191 — Tutorial [problem:327A] I’ll present here the O(N ^ 3) algorithm, which is enough to solve this task. Then, for those interested, I’ll show a method to achieve O(N) complexity. **O(N ^ 3) method:** The first thing to observe is that constrains are slow enough to allow a brute force algorithm. Using brute force, I can calculate for each possible single move the number of 1s resulting after applying it and take maximum. For consider each move, I can just generate with 2 FOR loops all indices i, j such as i <= j. So far we have O(N ^ 2) complexity. Suppose I have now 2 fixed vaIues i and j. I need to calculate variable cnt (initially 0) representing the number of ones if I do the move. For do this, I choose another indice k to go in a[] array (taking O(N) time, making the total of O(N ^ 3) complexity). We have two cases: either k is in range [i, j] (this means i <= k AND k <= j) or not (if that condition is not met). If it’s in range, then it gets flipped, so we add to count variable 1 – ...
://codeforces.com/blog/entry/337 In this problem we'll assume that a is 0-based. For a mask, consider, http://codeforces.me/blog/entry/337

Full text and comments »

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

3.
By awoo, history, 9 years ago, translation, In English
Educational Codeforces Round 35 [Rated for Div. 2] Hello Codeforces! On [December 28, 17:05 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?day=28&month=12&year=2017&hour=17&min=5&sec=0&p1=166) Educational Codeforces Round 35 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 [blog post](http://codeforces.me/blog/entry/51208). This round will be **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 Ivan [user:BledDest,2017-12-27] Androsov, Vladimir [user:0n25,2017-12-27] Petrov, Alexey [user:Perforator,2017-12-27] Ripinen and me. Thanks Mike [user:MikeMirzayano...
-29] 7 337 Congratulations to the, > 5 [user:voidmax, 2017-12-29] 7 337, >5 [user:voidmax, 2017-12-29] 7 337

Full text and comments »

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

4.
By djm03178, 19 months ago, In English
A fun unordered_map hacking experience Today, I went for hacking less optimized solutions for [problem:2094H]. Although I didn't try to hack many, there was one hack test that I enjoyed much to construct. The submission to hack is [submission:315476741]. You can see right there, they used `unordered_map<int,vector<int>> g;` to store the positions of each value. Note that in [this blog](https://codeforces.me/blog/entry/132929), I mentioned that it's hard to hack `unordered_map` when the range of elements is small. Because $a_i \le 10^5$, the maximum number of hash collisions it can make per indexing is only around $\sqrt{10^5}$, and its constant factor is relatively small. At first thought, it didn't look very feasible to attack this `unordered_map` effectively, because constructing an `unordered_map` hack test usually means you give up other patterns that can cause slow down on the code. This submission already took $3843$ ms on the original tests (test #6 seems to be a very strong test against many solutions) withou...
for $a_i \le 10^5$ in G++17 is $337$, and we can only have $296$ multiples of them. Randomly, First, the _evil prime_ that works best for $a_i \le 10^5$ in G++17 is $337$, and we can only have

Full text and comments »

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

5.
By fcspartakm, history, 11 years ago, translation, In English
Codeforces Round #337 (Div. 2) Привет, Codeforces! [27 декабря 2015 года в 14:05 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?iso=20151227T1405&p1=166) (время московское) состоится очередной раунд Codeforces #337 для участников из второго дивизиона. Традиционно, участники из первого дивизиона приглашаются поучаствовать в соревновании вне конкурса. Обратите внимание на **необычное** время начала раунда!!! В этот раз задачи для вас готовили я и Эдвард Давтян ([user:homo_sapiens,2015-09-25]). Хотелось бы сказать большое спасибо Глебу Евстропову ([user:GlebsHP,2015-12-25]) за помощь в подготовке задач, Марии Беловой ([user:Delinur,2015-12-25]) за перевод условий на английский и Михаилу Мирзаянову ([user:MikeMirzayanov,2015-06-29]) за замечательные системы Codeforces и Polygon. Участникам будет предложено пять задач и два часа на их решение. Разбалловка будет объявлена позднее. **UPD** Раунд переносится на 10 минут. Разбалловка **500-1000-1500-2500-2500** **UPD2** Соревнование завершено! Вс...
Codeforces Round #337 (Div. 2), /fixedtime.html?iso=20151227T1405&p1=166) (время московское) состоится очередной раунд Codeforces #337, =20151227T1405&p1=166) (время московское) состоится очередной раунд Codeforces # 337 для участников из

Full text and comments »

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

6.
By fcspartakm, history, 11 years ago, translation, In English
Codeforces Round #337 (Div.2) Editorial [610A &mdash; Pasha and Stick](http://codeforces.me/problemset/problem/610/A) If the given $n$ is odd the answer is 0, because the perimeter of any rectangle is always even number. If $n$ is even the number of rectangles which can be construct equals to $n / 4$. If $n$ is divisible by 4 we will count the square, which are deprecated, because we need to subtract 1 from the answer. Asymptotic behavior &mdash; $O(1)$. [610B &mdash; Vika and Squares](http://codeforces.me/problemset/problem/610/B) At first let's find the minimum in the given array and store it in the variable $minimum$. It is easy to understand, that we always can paint $n * minimum$ squares. So we need to find such a minimum in the array before which staying the most number of elements, which more than the minimum. In the other words we need to find 2 minimums in the array which are farthest from each other (do not forget about cyclical of the array). If there is only one minumum we need to start paint...
Codeforces Round #337 (Div.2) Editorial, Разбор Codeforces Round #337 (Div. 2)

Full text and comments »

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

7.
By low_, history, 7 years ago, In English
HCW '19 Team Round Editorial This is an editorial blog for [contest:102279]. Any further question can be asked in the comments, I'll try to answer all the questions. Please, do not private message or email me, your question could be the same as others', and I really hate to answer one question multiple times. >:( [problem:102279A] ------------------ Author: [user:low_,2019-07-22]. <spoiler summary="Tutorial"> To solve the problem, you'll only need to note that in $(N+1)$-th turn: Seo moved through exactly $(N+1)*V_s$ property, that is exactly $V_s$ full round of the board, so that he end up in $1$ afterwards. The same happens with B21 and Lowie. After that, the game keeps repeating itself. We can conclude that: if there isn't any event of one paying other in the first $3*(N+1)$ turns, it will never happen, so we can output $3000000000$. Otherwise, we can find the first event of it by brute force in $O(3*(N+1))$ time complexity. Maximum time complexity: $O(3*(N+1))$. </spoiler> [problem:102279B]...
![ ](https://docs.google.com/drawings/d/szoxnFpckaXsliwSWoylGdA/image?w=337 &h=237&rev=105&ac=1

Full text and comments »

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

8.
By Abinash, 12 years ago, In English
Good Blog Post Resources about Algorithm and Data Structures There are many good blogs in **Codeforces Blog** where people describes about different **Algorithm and Data Structures** . Lets gather all the resources about **Algorithm and Data Structures** Explanations. You can comment bellow the link and about it . I will always update that post gather new resources.Hope ,its help all and inspire all to write new blog post in future :) Last added blogs link will have a tag **(New)** Resources: **C++ STL** [C++ STL: Policy based data structures]( /blog/entry/11080) [C++ STL: Policy based data structures. Part 2]( /blog/entry/13279) **String Processing** [Suffix tree. Basics. Building in O(nlogn)]( /blog/entry/11337) [Z Algorithm]( /blog/entry/3107) [Great resource for string algorithms]( /blog/entry/8008) [Aho-Corasick algorithm. Construction]( /blog/entry/14854) [Suffix tree. Ukkonen's algorithm](/blog/entry/16780) [On suffix automaton (and tree)](/blog/entry/22420) **New** **Data Structur...
over subsets and paths in graphs]( /blog/entry/337) [Kadane's Algorithm — (Dynamic Programming, [A little bit of classics: dynamic programming over subsets and paths in graphs]( /blog/entry/337), [Dynamic programming over subsets and paths in graphs]( /blog/entry/337)

Full text and comments »

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

9.
By gojira, 13 years ago, translation, In English
Codeforces Round #196 Всем привет! Через несколько часов ([16 августа, 20:00MSK](http://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+196&iso=20130816T20&p1=371&ah=2)) начнется Codeforces Round #196. Главным образом вам снова придется помогать Манао, задачи которого на этот раз варьируют от просмотра фильмов и участия в викторинах до древостроения и борьбы с нечистью. Хочу поблагодарить за помощь в подготовке раунда координатора задач [user:Gerald,2013-08-16]; [user:Seyaua,2013-08-16], который тестировал задачи; [user:Delinur,2013-08-16], которая переводила условия на английский язык; и [user:Aksenov239,2013-08-16], который вычитывал условия. Разбалловка в обоих дивизионах будет **стандартная**. Также добавлю, что я даже старше, чем [user:Sammarize,2013-08-16], поэтому перехватываю титул [самого старого автора Codeforces-раунда](http://codeforces.me/blog/entry/8453) до появления следующего претендента ;) Контест окончен, я очень надеюсь что он вам понравился. Результ...
. Результаты: [Див1](http://codeforces.me/contest/338/standings), [Див2](http://codeforces.me/contest/337, /contest/337/standings). Congratulations to top performers in Div1: 1. [user:tourist,2013-08-16, /contest/338/standings), [Div2](http://codeforces.me/contest/337/standings). Congratulations to top, /contest/338/standings), [Див2](http://codeforces.me/contest/337/standings). Мои поздравления лучшей

Full text and comments »

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

10.
By I_love_natalia, 14 years ago, In Russian
III (XIV) открытый командный студенческий чемпионат Поволжья по спортивному программированию **4 &mdash; 7 апреля 2013 года** Самарский государственный университет совместно с компанией CQG при поддержке Министерства образования и науки Самарской области, Департамента информационных технологий и связи Самарской области, компании Вебзавод проводит **III (XIV) открытый командный студенческий чемпионат Поволжья по спортивному программированию**. [Информационное письмо](http://contest.uni-smr.ac.ru/Volga/chPovolzhje_2013.pdf) о чемпионате доступно в формате pdf. **Чемпионат проводится в один тур в формате ACM ICPC.** **UPD2** По просьбам ряда команд, которые по тем или иным причинам не смогут принять участие в очном туре, 6 апреля с 13:00 до 18:00 (время московское) будет проведён **online-тур**. Зарегистрироваться на онлайн-тур можно [здесь (ru)](http://contest.samara.ru/ru/regteam2013/) или [здесь (en)](http://contest.samara.ru/en/regteam2013/). Несколько позже чемпионат появится в разделе "Тренировки", так что заинтересованным участникам рекомендуем не знакомиться с ...
чемпионата](http://contest.uni-smr.ac.ru/ru/contests/337/) этого года. Возможно, 5 апреля ближе к вечеру в, ://contest.uni-smr.ac.ru/ru/contests/337/) этого года. Возможно, 5 апреля ближе к вечеру в открытом

Full text and comments »

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

11.
By erikr, 13 years ago, In English
Haskell solutions For those who are interested, here is a list of all problems for which Haskell solutions have been submitted. (Use the 'Status filter' to show only the Haskell submissions.) [1A](http://codeforces.me/problemset/status/1/problem/A) [1B](http://codeforces.me/problemset/status/1/problem/B) [1C](http://codeforces.me/problemset/status/1/problem/C) [2A](http://codeforces.me/problemset/status/2/problem/A) [2B](http://codeforces.me/problemset/status/2/problem/B) [2C](http://codeforces.me/problemset/status/2/problem/C) [3A](http://codeforces.me/problemset/status/3/problem/A) [3B](http://codeforces.me/problemset/status/3/problem/B) [3C](http://codeforces.me/problemset/status/3/problem/C) [3D](http://codeforces.me/problemset/status/3/problem/D) [4A](http://codeforces.me/problemset/status/4/problem/A) [4B](http://codeforces.me/problemset/status/4/problem/B) [4C](http://codeforces.me/problemset/status/4/problem/C) [4D](http://codeforces.me/problemset/status/4/problem/D)...
://codeforces.com/problemset/status/336/problem/D) [337A](http://codeforces.me/problemset/status/337, [337A](http://codeforces.me/problemset/status/337/problem/A) [337B](http://codeforces.com

Full text and comments »

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

12.
By A.K.Goharshady, 16 years ago, In English
Unknown Language Round #2 <p> Итак, языком этого раунда является Io. Io (первая буква — заглавная i) — скриптовый, чисто объектно-ориентированный язык программирования с динамической типизацией. Язык был разработан Стивом Декортом (Steve Dekorte) в 2002 году. Реализация является кросплатформенной, открытой (лицензия BSD) и рассчитана на лёгкость встраивания в качестве скриптового языка (из Wikipedia). Версия, установленная на Codeforces — Io-2008-01-07 (Win32).</p> <p>Одна из основных особенностей языка — минималистичность синтаксиса. Код знаменитой программы "Hello World!" на этом языке выглядит так:</p> <pre style="background-color: rgb(238, 238, 238);">"Hello World!" println</pre> <p>А вот пример решения задачи "A+B" (числа заданы на разных строках): </p> <pre style="background-color: rgb(238, 238, 238);">a := File standardInput readLine asNumber b := File standardInput readLine asNumber c := a+b c println </pre> <p> Вы можете скачать интерпретатор <a href="http://www.iolanguage.com/...
" height="227" width="337">, ="http://upload.wikimedia.org/wikipedia/commons/7/70/HaftSin-Iran.jpg" height="227" width="337">

Full text and comments »

Announcement of Unknown Language Round 2
  • Vote: I like it
  • +52
  • Vote: I do not like it

13.
By dominique38, history, 10 months ago, In English
Beginner's Guide to Greedy _This blog post is a submission for the [Codeforces Month of Blog Posts Pt. III challenge](https://codeforces.me/blog/entry/149422). Thank you [user:cadmiumky,2026-02-10] for the initiative!_ This is how I wish I had been introduced to Greedy. Learning _how to prove_ is the truly valuable skill, one that I believe good Greedy problems test rigorously. ### **Introduction** After struggling with proofs for quite a while, there are a few things I realized. Greedy proofs are very dependent on the rules of the problem. Loosely speaking each optimization problem gives you observations, from those observations, you realize that if you take certain choices while avoiding all others, then it will always be optimal. That realization is termed **Greedy**. There are a lot of optimization problems, but only a small subset allows you to break the problem into smaller independent subproblems where solving them optimally leads to the best global answer. This property, known as Optimal Sub...
), [Graphs](https://codeforces.me/blog/entry/337), [Digits](https://usaco.guide/gold/digit-dp?lang=cpp, ://codeforces.com/blog/entry/337), [Digits](https://usaco.guide/gold/digit-dp?lang=cpp), [Ranges

Full text and comments »

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

14.
By Ahnaf.Shahriar.Asif, history, 7 years ago, In English
DP Tutorial and Problem List Today I've listed some DP tutorials and problems. Actually, I made it for my personal practice. But I think It may Help others too. Update: I write stuff [Here](https://duoblogger.github.io) in Bengali. I probably have one or two basic DP tutorials too. If you understand Bengali, it may help. **Note: If you have some other tutorial links and nice problems, mention them. I'll add them here. It'll help me too.** ## Dynamic programming: * [Topcoder Tutorial](https://www.topcoder.com/community/competitive-programming/tutorials/dynamic-programming-from-novice-to-advanced/) * [Dynamic Programming,from novice to advanced](https://www.cnblogs.com/drizzlecrj/archive/2007/10/26/939159.html) * [Learn DP and other tricks](https://www.codechef.com/certification/data-structures-and-algorithms/prepare#foundation) * [Non-trivial DP tricks](https://codeforces.me/blog/entry/47764) * [Everything about Dynamic Programming](https://codeforces.me/blog/entry/43256) * [Digit DP 1](https://...
and paths in graphs](https://codeforces.me/blog/entry/337) * [Coin Problems](https://medium.com, /entry/337) * [Coin Problems](https://medium.com/@harryjobz/coin-problem-lets-code-2-0-83b607bdcfdc

Full text and comments »

15.
By FORHAD-SUST-BD, 16 years ago, In English
Problem Set Analysis Of CodeForces <b>Tutorial Links:<span class="Apple-tab-span" style="white-space:pre"> </span>&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp;</b><div><a href="http://codeforces.me/blog/entry/85">Code Forces Beta Round 1 Tutorial</a><br><br><a href="http://codeforces.me/blog/entry/109">Code Forces Beta Round 2 Tutorial</a><br><br><a href="http://codeforces.me/blog/entry/107">Code Forces Beta Round 2 Another Tutorial</a><br><br><div>Code Forces Beta Round 3 Tutorial:</div><div><br><a href="http://codeforces.me/blog/entry/178">Code Forces Beta Round 4 Tutorial</a><br><br></div><div><a href="http://codeforces.me/blog/entry/213">Code Forces Beta Round 5 Tutorial</a></div><div><br></div><div>Code Forces Beta Round 6 Tutorial</div><div><br></div><div>Code Forces Beta Round 7 Tutorial</div><div><br></div><div>Code Forces Beta Round 8 Tutorial</div><div><br></div><div><a href="http://codeforces.me/blog/entry/283">Code Forces Beta Round 9 Tutorial</a><br><br></div><div>Code Forces Beta Round 10 Tutorial</div...
://www.codeforces.com/blog/entry/337">A little of classics: Dynamic Programming Over subset and graphs , A little of classics: Dynamic Programming Over <http://www.codeforces.com/blog/entry/<B>337</B>>, The Dynamics of Subsets and routes in graphs <http://codeforces.me/blog/entry/<B>337</B>>

Full text and comments »

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

16.
By ahmed_aly, 14 years ago, In English
Coders of the month — July 2012 1- [user:iroro,2012-09-01]: 385<br/> * 119th in <a href="http://codeforces.me/contest/203/standings" target="_blank">Codeforces Round #128 (Div. 2)</a>: +59 (from <b><font color="blue">1607</font></b> to <b><font color="blue">1666</font></b>)<br/> * 6th in <a href="http://codeforces.me/contest/205/standings" target="_blank">Codeforces Round #129 (Div. 2)</a>: +87 (from <b><font color="blue">1666</font></b> to <b><font color="#A0A">1753</font></b>)<br/> * 62nd in <a href="http://codeforces.me/contest/213/standings" target="_blank">Codeforces Round #131 (Div. 1)</a>: +91 (from <b><font color="#A0A">1753</font></b> to <b><font color="#A0A">1844</font></b>)<br/> <br/> 2- [user:vlad107,2012-09-01]: 358<br/> * 42nd in <a href="http://codeforces.me/contest/204/standings" target="_blank">Codeforces Round #129 (Div. 1)</a>: +92 (from <b><font color="#FF8C00">1923</font></b> to <b><font color="#FF8C00">2015</font></b>)<br/> * 36th in <a href="http://codeforces.me/contest/213/standing...
4- [user:sweetsc,2012-09-01]: 337 * 10th in

Full text and comments »

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

17.
By atcoder_official, history, 3 years ago, In English
Toyota Programming Contest 2024#1(AtCoder Beginner Contest 337) Announcement We will hold Toyota Programming Contest 2024#1(AtCoder Beginner Contest 337). - Contest URL: https://atcoder.jp/contests/abc337 - Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20240120T2100&p1=248 - Duration: 100 minutes - Writer: [user:leaf1415,2024-01-19], MMNMM, [user:ynymxiaolongbao,2024-01-19], kyopro_friends, [user:evima,2024-01-19] - Tester: [user:cn449,2024-01-19], [user:physics0523,2024-01-19] - Rated range: ~ 1999 - The point values: 100-200-300-400-425-550-600 We are looking forward to your participation!
Toyota Programming Contest 2024#1(AtCoder Beginner Contest 337) Announcement, We will hold Toyota Programming Contest 2024#1(AtCoder Beginner Contest 337).

Full text and comments »

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

18.
By 7oSkaaa, history, 5 years ago, In English
Topics Problems Good Day to you! While a lot of us, when he begins to start competitive programming he found difficult to found problems on some topics in the beginning to practice of it, and same thing for a lot of ICPC Communites that they have started. These are some topic not advanced and videos, problems and articles on them. <br> <spoiler summary="Prefix Sum & Frequency Array"> [Wonderful Coloring](https://codeforces.me/contest/1551/problem/B1) [Do Not Be Distracted](https://codeforces.me/contest/1520/problem/A) [Letter](https://codeforces.me/problemset/problem/43/B) [Pangram](https://codeforces.me/problemset/problem/520/A) [Andryusha and Socks](https://codeforces.me/contest/782/problem/A) [Count Numbers](https://codeforces.me/group/c3FDl9EUi9/contest/262795/problem/A) [Count Characters](https://codeforces.me/group/c3FDl9EUi9/contest/262795/problem/B) [Range Sum Query](https://codeforces.me/group/c3FDl9EUi9/contest/262795/problem/E) [Count a's](https...
="Codeforces Round 337 (Div. 2)">Alphabet Permutations , > Alphabet Permutations <>

Full text and comments »

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

19.
By Xephy, history, 11 years ago, In English
The ACTUAL Best Way to Become a Better Programmer... SATIRE WARNING! ================== ### If you do not wish to read a lot of useless information, (just like my [latest satirical-serious blog](http://www.codeforces.com/blog/entry/21237)) skip to the latest line of this entry, to see what I want to say in this blog So I've been trying to write as much contests lately especially on CodeForces and Hackerrank, because after all, I'm clearly one of the most ![ ](http://i.imgur.com/PiO8pKW.png)       ![ ](http://i.imgur.com/0ffwC64.png)                _valuable_              and            **smartest** programmers on these websites. Tourist? Pfft! What a joke! He's not a programmer greater than me unless he went to IOI at the age of 11, and had gotten a Gold Medal on IOI for 6 years in a row, which we all know he totally didn't.... ![ ](http://i.imgur.com/zqQOvNd.png)                           ![ ](http://i.imgur.com/vJ9Zhoc.png)                            _awkward silence_    ![ ](https://upload.wikimedia.org/wikiped...
: ![ ](http://i.imgur.com/AEXEiYF.png) Wait... Huh? There's the #337 contest... #338 contest... #335, ? There's the #337 contest... #338 contest... #335 contest... but not a #336th contest...? And also

Full text and comments »

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

20.
By imslavko, 15 years ago, translation, In English
Codeforces bookmarks/Закладки Кодфорса There are many intresting topics on CF! But it became very difficult to find really intresting things. Here are links to all such topics, I found after scanning all post ids. There are two general categories: "Help me find problems on topic X" and "intresting technical information or algorithm". There are no out-of-topic messages, such as "Hello world"s and other flood posts. Also there are no competition anounces and tutorials, but there is link to post, where you can find all tutorials of CF. ### Give me problems to given topic ### - [DP](http://codeforces.me/blog/entry/325) - [Flow](http://codeforces.me/blog/entry/1279?locale=ru) - [Gauss](http://codeforces.me/blog/entry/2536) - [Hash function](http://codeforces.me/blog/entry/1160) - [Problem Classifier](http://problemclassifier.appspot.com/) - [Need Some Nim Game Problem](http://codeforces.me/blog/entry/567) - [Bitmask Problem](http://codeforces.me/blog/entry/879) - [Simplex method](http://codeforces.me/blog...
подмножествам и маршруты в графах](http://codeforces.me/blog/entry/337) - [Не макс. поток мин, /entry/337) - [Не макс. поток мин. стоимости](http://codeforces.me/blog/entry/479) - [How many, ://codeforces.ru/blog/entry/325) - [subset dp](http://codeforces.me/blog/entry/ 337) - [non, ://codeforces.ru/blog/entry/337) - [non max.flow min.cost](http://codeforces.me/blog/entry/479) - [How many

Full text and comments »

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

21.
By AshrafSustS19, history, 4 years ago, In English
Weak test case for problem 1771C (Problem no C of last round) I wasn't happy with the time complexity of my solution. So, I was looking for a solution with improved time complexity. And I found this. This guy solved this problem by only checking the first 200 elements after each index and comparing GCD of each pair . He won with the power of probability! His submission: [submission:184781213] <spoiler summary="Test Case"> 1 201 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809 811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941 947 953 967 971 977 983 991 997 1009 1013 1019 1021 1031 1033 1039 1049 1051 1061 1063 1069 1087 1091 1093 1097 1103 1109 1117 1123 1129 1151 1153 1163...
239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379, 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439

Full text and comments »

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

22.
By MciprianM, 16 years ago, In English
Bookmark This is a sort of a bookmark entry for my use. It will mostly contain linksfrom this site that are/were/wiil be interesting to me. If you can use them it's fine, but I write this entry for myself. Hope that those that check the "Recent actions" table won't be annoyed if this pops out every now and then(or even more often).<br><br><a href="http://codeforces.me/blog/entry/70">PetrMitrichev SaoPaolo training</a><br><a href="http://www.codeforces.com/blog/entry/135">BBCup2010R2FatHobsSol</a><br><a href="http://codeforces.me/blog/entry/527">NiceDecompositionProblem?</a><br><a href="http://codeforces.me/blog/entry/529">TutorialsNStuff</a><br><a href="http://codeforces.me/blog/entry/512">SomeLinks</a><br><a href="http://codeforces.me/blog/entry/325">?</a><br><a href="http://codeforces.me/blog/entry/325">DP</a><br><a href="http://codeforces.me/blog/entry/337#comments">More DP</a><br><br>P.S.: Why everytime I edit this it automatically inserts "календари" at tags?<br>&nbsp;&nbsp;&nbsp;&n...
/blog/entry/325">DP More DP <http://codeforces.me/blog/entry/<B>337</B>#comments> , ="http://codeforces.me/blog/entry/337#comments">More DP

Full text and comments »

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

23.
By Temirulan, 7 years ago, In English
Who participated most? This is top100 with most participated in official contests, included non-rated ones. |Rank|Handle|Total|Official|Unofficial| |---|---|---|---|---| | 1 | ![ ](https://sta.codeforces.com/s/58270/images/flags-16/ru.png) [user:ruban,2019-12-23] | 660 | 612 | 48 | | 2 | ![ ](https://sta.codeforces.com/s/58270/images/flags-16/ru.png) [user:PAG,2019-12-23] | 604 | 585 | 19 | | 3 | ![ ](https://sta.codeforces.com/s/58270/images/flags-16/jp.png) [user:uwi,2019-12-23] | 587 | 352 | 235 | | 4 | ![ ](https://sta.codeforces.com/s/58270/images/flags-16/tw.png) [user:dreamoon_love_AA,2019-12-23] | 511 | 351 | 160 | | 5 | ![ ](https://sta.codeforces.com/s/58270/images/flags-16/jp.png) [user:kmjp,2019-12-23] | 506 | 319 | 187 | | 6 | ![ ](https://sta.codeforces.com/s/58270/images/flags-16/lt.png) [user:KrK,2019-12-23] | 471 | 314 | 157 | | 7 | ![ ](https://sta.codeforces.com/s/58270/images/flags-16/jo.png) [user:2-SAD,2019-12-23] | 458 | 311 | 147 | | 8 | ![ ](https://sta.codeforces.com/s/5...
://sta.codeforces.com/s/58270/images/flags-16/jp.png) [user:hogeover30,2019-12-23] | 384 |337 | 47

Full text and comments »

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

24.
By markysha, 9 years ago, translation, In English
Useful and not so useful links _Some time ago I collected useful links from Codeforces, some of them are really cool, some are not._ _Dtaft was created about a year ago, now it is June of 2019._ _My friend asked me to give him some cool blogs from Codeforces, and I remembered about that blog._ _So that is the reason why this blog is posted)_ _P.S. some blogs are only in russian_ <spoiler summary="algorithms"> [Non-recursive segment tree tutorial](http://codeforces.me/blog/entry/1256) [user:Urbanowicz,2017-10-21] [Efficient and easy segment trees](http://codeforces.me/blog/entry/18051) [user:Al.Cash,2017-10-21] [Dynamic connectivity problem](http://codeforces.me/blog/entry/15296) [user:adamant,2017-10-21] [Suffiex tree. Basics. Build in O(nlogn)](http://codeforces.me/blog/entry/11337) [user:adamant,2017-10-21] [K-th statistics on a range](http://codeforces.me/blog/entry/2954) [user:yarrr,2017-10-21] [[Tutorial] Sack (dsu on tree)](http://codeforces.me/blog/entry/44351) [user:arp...
графах](http://codeforces.me/blog/entry/337) [user:Ripatti,2017-10-21] [persistent segment tree, /entry/337) [user:Ripatti,2017-10-21] [persistent segment tree](https://drive.google.com/file/d, ://codeforces.com/blog/entry/337) [user:Ripatti,2017-10-21] [persistent segment tree](https, ] [subsets DP and paths in graphs](http://codeforces.me/blog/entry/337) [user:Ripatti,2017-10-21

Full text and comments »

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

25.
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| |--...
| — | | 337 | [user:EnAnimant,2022-02-11] | 7 | 7 | — | — | — | &mdash, ; | — | — | 8 | — | | 337 | [user:EnAnimant,2022-02-11] | 7 | 7 | — | &mdash

Full text and comments »

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

26.
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...
; | | 337 | [user:emma,2020-12-08] | 8 | — | 8 | — | — | — | &mdash, ; | | 337 | [user:emma,2020-12-08] | 8 | — | 8 | — | — | — | — | | 337

Full text and comments »

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

27.
By Salat, 16 years ago, In Russian
Ссылки <a href="http://codeforces.me/blog/entry/325">Dynamic Programming Type</a><br><div><br></div><div><a href="http://codeforces.me/blog/entry/546">Discussions Of CodeForce Round</a><br></div><div><br></div><div><a href="http://codeforces.me/blog/entry/529">Problem Set Analysis Of CodeForce</a><br></div><div><br></div><div><a href="http://codeforces.me/blog/entry/337">Динамика по подмножествам и маршруты в графах</a></div><div><br></div><div><a href="http://codeforces.me/blog/entry/417">Codeforces FAQ</a></div>
> Динамика по подмножествам и <http://codeforces.me/blog/entry/<B>337</B>>, Динамика по подмножествам и маршруты в графах <http://codeforces.me/blog/entry/<B>337</B>>

Full text and comments »

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

28.
By faiyaz26, 12 years ago, In English
How to solve this UVa Problem ? How to solve this problem ([http://uva.onlinejudge.org/contests/337-93cec436/12829.pdf](http://uva.onlinejudge.org/contests/337-93cec436/12829.pdf)) ? How to get result from 2D grid ? I have some idea about the offline solution, but what about online solution (which is required by this problem) ?
How to solve this problem ([http://uva.onlinejudge.org/contests/337 -93cec436/12829.pdf](http

Full text and comments »

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

29.
By lazyCoding, history, 11 years ago, In English
Doubt about contest number Last codeforces round was round 335..and in upcoming contest next round is round 337 .so what about round 336 ?
Last codeforces round was round 335..and in upcoming contest next round is round 337 .so what about

Full text and comments »

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

30.
By InshaAllah, history, 9 years ago, In English
How to solve this problem in dp? http://codeforces.me/contest/337/problem/A There are three tags for this problem( Greedy, Graph matching, dp). I have solved it using a greedy technique. Please help me to solve it using dp. Thanks, advanced!!! N:B You can also suggest the graph matching solution.
http://codeforces.me/contest/337/problem/A

Full text and comments »

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

31.
By slappy, history, 7 years ago, In English
Is it me or everyone ? Could anyone check the blog: [here](https://codeforces.me/blog/entry/337) ? The blog content is not showing up. I tried even Chrome incognito and other browsers Firefox and Edge. Does anyone have any idea about this ? ![ ](/predownloaded/a8/f9/a8f91fc56d5206161f101478510a4281d13ded18.png) UPD: **Don't know how, but now it's working. Thanks**
Could anyone check the blog: [here](https://codeforces.me/blog/entry/337) ? The blog content is

Full text and comments »

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

32.
By mo7amed_a7med, history, 10 years ago, In English
337A How to apply dynamic programming how to solve [337A](http://codeforces.me/problemset/problem/337/A) by using dp as it mentioned in its tag ?
how to solve [337A](http://codeforces.me/problemset/problem/337/A) by using dp as it mentioned in

Full text and comments »

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

33.
By MikeMirzayanov, 8 years ago, In English
Mail.Ru Cup 2018 — Results of R1+R2+R3 Here are merged results of [contest:1054], [contest:1055] and [contest:1056] according to the GP100 scores (see the announcement for the details https://codeforces.me/blog/entry/62355). Best two contests give the summary score of a participant. This table is unofficial yet. But anyway... congratulations to the winnerzzzz! | Place | Contestant | = | Round 1 | Round 2 | Round 3| | - | - | - | - | - |-| | 1 | [user:mnbvmar,2018-11-25] | 1497 | 1000 | 497 | 29 | | 2 | [user:V--o_o--V,2018-11-25] | 1281 | 575 | 575 | 706 | | 3 | [user:Radewoosh,2018-11-25] | 1265 | &mdash; | 265 | 1000 | | 4 | [user:aid,2018-11-25] | 1204 | 204 | 1000 | 142 | | 5 | [user:LHiC,2018-11-25] | 1203 | 497 | 706 | 226 | | 6 | [user:Um_nik,2018-11-25] | 997 | 706 | 291 | 235 | | 7 | [user:ksun48,2018-11-25] | 788 | 291 | &mdash; | 497 | | 8 | [user:SpyCheese,2018-11-25] | 742 | 371 | 371 | 265 | | 9 | [user:RAVEman,2018-11-25] | 619 | 19 | 176 | 443 | | 10 | [user:scott_wu,2018-11-25] | 614...
| [user:Zhukov_Dmitry,2018-11-25] | 337 | 235 | — | 102 | | 36 | [user:OO0OOO00O0OOO0O00OOO0OO, ] | 337 | 235 | — | 102 | | 36 | [user:OO0OOO00O0OOO0O00OOO0OO,2018-11-25] | 325 | 325

Full text and comments »

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

34.
By AHMADUL, history, 4 years ago, In English
To- "The Codeforces community" Is it really a bug of the judges??? I have given same input for 2 different accepted codes for the following problem: https://codeforces.me/contest/1771/problem/C But, they gave me different output! Input: 1 101 2 3 5 7 1 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 4 First code: submission_id- 184778210 Output: NO. Second code: submission_id- 185537533 Output: YES. And the valid answer is "YES". But the judges also accepted "NO"!!!
241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389, 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397

Full text and comments »

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

35.
By user_temp, history, 9 years ago, In English
In-Out DP "Problem — 337D" I was doing this question 337-D but couldn't get it accepted, Can anyone please look at the code and tell me what error am I making, Yes, I've looked at Rachit Jain video. #### Problem &mdash; http://codeforces.me/contest/337/problem/ #### Submission... &mdash; http://codeforces.me/contest/337/submission/36897531
#### Problem — http://codeforces.me/contest/337/problem/ #### Submission... — http, I was doing this question 337-D but couldn't get it accepted, Can anyone please look at the code

Full text and comments »

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

36.
By Tanmoy1228, history, 11 years ago, In English
Codeforces Round #337 (Div. 2) Problem D Problem: [problem:610D] can not understand the solution in editorial can anyone give me any idea of solution in deails???
Codeforces Round #337 (Div. 2) Problem D

Full text and comments »

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

37.
By aryan_cp, history, 6 years ago, In English
Help in a problem - Hello CodeForces can any body help me as to how to solve this problem? link : [Problem Link](https://cses.fi/337/list/) I wanted help in Problem B &mdash; Horse Routes (when translated in English ) Thanks!
://cses.fi/337/list/) I wanted help in Problem B — Horse Routes (when translated in English

Full text and comments »

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

38.
By kissu_pari_na, history, 11 years ago, In English
Rating change of Codeforces Round #337 (Div. 2) What is the problem of rating change of todays contest?! Why the rating is changing sevaral times?! Can the authority give us some message?!
Rating change of Codeforces Round #337 (Div. 2)

Full text and comments »

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

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...
&year=2010&hour=18&min=00&sec=00">2010-12-17 [contest:49] 337th, > [contest:49] 337th place

Full text and comments »

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

40.
By orz, history, 2 years ago, In English
Milestones: ratings below 1500 and greatest rises (2024 edition) <i>Note.</i> This is an updated version of [this post](https://codeforces.me/blog/entry/104683). If you like [this style](https://codeforces.me/blog/entry/104320) more, please tell me in the comments. Since [user:tourist,2024-09-05]'s [breakthrough](https://codeforces.me/blog/entry/133401), I've received a lot of requests to update my old posts with rating achievements. However, I wasn't able to do it immediately since my method of doing it requires to download the rating change history of every user, which, in turn, requires to perform several hundred thousand requests to Codeforces, about which the website (and Cloudflare) is not happy. It took more that three days, but finally the job is done! Below are two tables. The first one is the greatest positive rating changes. The second one is the first users ever to reach some rating value. [cut] <table> <tr> <th>Place</th> <th>&Delta;</th> <th>Person</th> </tr> <tr> <td>1<sup>st</sup></td> <td><b>1182<...
> [contest:49] 337th place

Full text and comments »

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

41.
By orz, history, 2 years ago, In English
Milestones: ratings above 1500 and greatest falls (2024 edition) <i>Note.</i> This is an updated version of [this post](https://codeforces.me/blog/entry/104681). If you like [this style](https://codeforces.me/blog/entry/104320) more, please tell me in the comments. Since [user:tourist,2024-09-05]'s [breakthrough](https://codeforces.me/blog/entry/133401), I've received a lot of requests to update my old posts with rating achievements. However, I wasn't able to do it immediately since my method of doing it requires to download the rating change history of every user, which, in turn, requires to perform several hundred thousand requests to Codeforces, about which the website (and Cloudflare) is not happy. It took more that three days, but finally the job is done! Below are two tables. The first one is the greatest (by absolute value) negative rating changes. The second one is the first users ever to reach some rating value. [cut] First table: <spoiler> <table> <tr> <th>Place</th> <th>&Delta;</th> <th>Person</th> </tr> ...
>15th -337 [user:olmrgcsi,2024-05-26, >th -337 [user:olmrgcsi,2024-05-26]

Full text and comments »

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

42.
By ublog, 13 years ago, In English
Judging problem on FPC functions, please help Recently I submit problem 337C and got compilation error. my [code](http://codeforces.me/contest/337/submission/4309699) works correctly on latest version of Free Pascal but here got compilation error. The problem happens just when I use functions. is it judge problem? please help me. thank you.
/337/submission/4309699) works correctly on latest version of Free Pascal but here got compilation

Full text and comments »

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

43.
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...
Type * A little bit of classics: dynamic <http://codeforces.me/blog/entry/<B>337</B>>, >A little bit of classics: dynamic programming over <http://codeforces.me/blog/entry/<B>337</B>>

Full text and comments »

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