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.
Codeforces Round #191 — Tutorial
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 – ...
[problem:327B]

Full text and comments »

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

2.
Haskell solutions
By erikr, 12 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://mirror.codeforces.com/problemset/status/1/problem/A) [1B](http://mirror.codeforces.com/problemset/status/1/problem/B) [1C](http://mirror.codeforces.com/problemset/status/1/problem/C) [2A](http://mirror.codeforces.com/problemset/status/2/problem/A) [2B](http://mirror.codeforces.com/problemset/status/2/problem/B) [2C](http://mirror.codeforces.com/problemset/status/2/problem/C) [3A](http://mirror.codeforces.com/problemset/status/3/problem/A) [3B](http://mirror.codeforces.com/problemset/status/3/problem/B) [3C](http://mirror.codeforces.com/problemset/status/3/problem/C) [3D](http://mirror.codeforces.com/problemset/status/3/problem/D) [4A](http://mirror.codeforces.com/problemset/status/4/problem/A) [4B](http://mirror.codeforces.com/problemset/status/4/problem/B) [4C](http://mirror.codeforces.com/problemset/status/4/problem/C) [4D](http://mirror.codeforces.com/problemset/status/4/problem/D)...
://codeforces.com/problemset/status/327/problem/A) [327B ](http://mirror.codeforces.com/problemset/status/327/problem/B, [327A](http://mirror.codeforces.com/problemset/status/327/problem/A) [327B ](http://mirror.codeforces.com

Full text and comments »

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

3.
327B - Hungry Sequence
By always_4ever_5_25__21_SS, history, 10 years ago, In English
327B - Hungry Sequence OK, so i didn't get what the tutorial of that really meant, and that tutorial looked long..-_- Fortunately, I found a better solution. And my solution is mainly like 2 lines!!! :p I think it's better if you see the code rather than me trying to explain it..... #include<bits/stdc++.h> using namespace std; int main(){ int n, i; cin>>n; for(i=0;i<n;i++)cout<<i+n*10<<" "; return 0; } For any question or suggestion, feel free!!!
327B - Hungry Sequence

Full text and comments »

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

4.
Is this a good way to solve this problem?
By fker, history, 2 months ago, In English
Is this a good way to solve this problem? [problem:327B] just guess that I can generate a wierd array with the bad numbers like 171. so I construct this formula: _x = (i+17)*71+177171_ then it is accepted..
[problem:327B]

Full text and comments »

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