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 Sort by: relevance popularity time

1.
By object022, 10 years ago,
Codeforces Round #111 (Div. 2) Solution UPD:Minor mistakes in grammar and expression fixed. Disclaimer: This is not an official editorial. If you have better or easy-to-understand solutions and thoughts, feel free to share your idea. Also welcome to point out mistakes so I can fix it. ### [problem:160A] It's obvious that you should take the most valueable coins. so sort values in non-decreasing order, then take coins from the most valueable to the least, until you get **strictly** more than half of total value. Time complexity depends on the sorting algorithm you use. O(n^2) is also acceptable, but if you use bogosort which runs in O(n!)... ### [problem:160B] Deal with the situation that "first half is strictly less than second half" first. the other one can be solved accordingly. You can use greedy here: sort digits in first and second half seperately. then if the i-th digit in first half is always less than i-th in second half for 1<=i<=n, answer is YES. Time complexity is as same as problem A. Count...
. Java and Pascal users should beware of anti-quicksort tests. ### [problem:160D] Let's take, Sort algorithm working in O(n log n) is acceptable. Java and Pascal users should beware ofanti

• +51

2.
By tuna, history, 5 years ago,
Java: Arrays.sort(Integer) vs Arrays.sort(int) with Examples Java: Arrays.sort(Integer) is more faster than Arrays.sort(int) in the worst case: ============================================================================ The main reason is that Java uses two different sorting algorithms in the cases you mentioned. In the Arrays.sort(int) (or other primitive types) case, Java uses Quicksort, which has a O(n^2) worst case. Instead, in the Arrays.sort(Object) case, it uses Mergesort, which has a O(n log n) worst case. So some problems may give you Time Limit Exceeded when you use Arrays.sort(int) if there is an anti-quicksort test. **References:** http://codeforces.com/blog/entry/17565 http://stackoverflow.com/questions/3707190/why-java-arrays-use-two-different-sort-algorithms-for-different-types ### Example 1: Time limit exceeded because of Arrays.sort(int) http://codeforces.com/contest/285/submission/20103799 Same code but Accepted because of Arrays.sort(Integer) http://codeforces.com/contest/285/submis...
give you Time Limit Exceeded when you use Arrays.sort(int) if there is an anti- quicksort test, So some problems may give you Time Limit Exceeded when you use Arrays.sort(int) if there is ananti

• +10

3.
By halyavin, 6 years ago,
Educational Codeforces Round 9 Challenge Overview. 632A &mdash; Grandma Laura and Apples ------------------------------- There were no successful challenges for this problem. Thumbs up to everyone! I did find a couple of C/C++ solutions with uninitialized local variables though. Fortunately for them, the top of the stack is filled with zeros in the current testing system and compiler didn't decide to place uninitialized local variables in the register. 632B &mdash; Alice, Bob, Two Teams ---------------------------- There was quite a variety of off-by-one errors in this problem. My most successful test was ~~~~~ 2 1 1 BB ~~~~~ Some solutions just have to flip something. The were also 2 challenges where solution got TL due to slow input. The most crazy uninitialized variable prize for this problem goes to [submission:16447719]: ~~~~~ ll n; v b(n); cin >> n; forn(i, n) { cin >> b[i]; } ~~~~~ What is the size of vector b? Definitely not n. Fortunately for the author, it can't be challenged. Und...
challenges in this problem were anti-quicksort tests for Free Pascal solutions. One person used normal, in this problem were anti-quicksort tests for Free Pascal solutions. One person used normal sorting

• +78

4.
By Abinash, 7 years ago,
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...
& Searching** [Binary search implementation]( /blog/entry/9901) [Quicksort and chill](/blog/entry

• +99

5.
By AlexanderBolshakov, 10 years ago,
Завал java.util.Arrays.sort() <p>Собственно, данный пост ориентирован больше на новичков (большинство профессионалов с проблемой уже знакомы). Как известно, многие из тех, кто пишут quicksort вручную, попадались на anti-quicksort, и их решения получали TLE или, еще хуже, Stack Overflow. Явакодеров, казалось бы, эта проблема не касается: они пользуются стандартной функцией, которая, по идее, должна быть написана корректно. Не тут-то было... Короче, прилагаю <a href="http://pastie.org/2222386">исходник</a> (лицензия GNU GPL 2 with Classpath exception, т.к. основан на исходном коде из OpenJDK). Запускать следует с параметром&nbsp;-Xss64m; сгенерированный массив выведется в файл.</p><div><br></div><div>P.S. Прошу прощения за ужасное качество исходника, выкладываю чисто для демонстрации. Более подробную информацию для интересующихся я добавлю потом.</div><div><br></div><div><b>UPD. </b>Исправил ошибку с неправильным измерением времени сортировки.</div><p></p>
уже знакомы). Как известно, многие из тех, кто пишут quicksort вручную, попадались наanti-quicksort

• +11

6.
By Chilli, history, 2 years ago,
67238
quick sort has random parts, hasn't? so what the hell is Anti