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 #283: editorial (with bonuses!)
By Endagorion, 12 years ago, translation, In English
Codeforces Round #283: editorial (with bonuses!) Each problem comes with a challenge — a bonus task somehow related to the problem; you may tackle at the challenges for fun and practice, also feel free to discuss them at the comments. =) [problem:496A] For every option of removing an element we run through the remaining elements and find the maximal difference between adjacent ones; print the smallest found answer. The solution has complexity $O(n^2)$. It can be noticed that after removing an element the difficulty either stays the same or becomes equal to the difference between the neighbours of the removed element (whatever is larger); thus, the difficulty for every option of removing an element can be found in $O(1)$, for the total complexity of $O(n)$. Any of these solutions (or even less efficient ones) could pass the tests. **Challenge**: suppose we now have to remove exactly $k$ arbitrary elements (but the first and the last elements have to stay in their places). How small the maximal difference between adjacen...
[problem:496C]/[problem:497A]

Full text and comments »

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

2.
Hack me! (Codeforces Round #283 (Div. 2))
By kostka, 12 years ago, In English
Hack me! (Codeforces Round #283 (Div. 2)) Hey there! Here are the hacking statistics from [contest:496]. It wasn't very good round for hackers (especially because of strong pretests), but still &mdash; let's take a quick look. (Hacks description will be added later, sorry). Previous posts can be found [here](http://codeforces.me/search?query=hackme), including [div. 1](http://codeforces.me/blog/entry/15248). [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:496A] </small> | 0 (0.00%) | 27 (55.10%)| 22 (44.90%) | 49 | 18 (0.81%) | 2193 (99.19%) | 2211 | 0.00% | <small> [problem:496B] </small> | 3 (8.57%) | 19 (54.29%)| 13 (37.14%) | 35 | 78 (6.67%) | 1091 (93.33%) | 1169 | 3.70% | <small> [problem:496C] </small> | 5 (11....
(37.14%) | 35 | 78 (6.67%) | 1091 (93.33%) | 1169 | 3.70% | [problem:496C] | 5, #### [problem:496C], %) | 35 | 78 (6.67%) | 1091 (93.33%) | 1169 | 3.70% | [problem:496C] | 5 (11.90, /hacks/129950">129950| [problem:496C] | 0:54:36 | [user:vishwacs111,2014-12-17] | [user:logico

Full text and comments »

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

3.
Problem with 496C test case 20!
By 300pound, 12 years ago, In English
Problem with 496C test case 20! Hi. I'm trying to solve 496C here but I ran into a problem with test case 20. Any help would be greatly appreciated. [http://codeforces.me/contest/496/submission/9372508]( http://codeforces.me/contest/496/submission/9372508)
Problem with 496C test case 20!, Hi. I'm trying to solve 496C here but I ran into a problem with test case 20.

Full text and comments »

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