| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Hi all,
As far as I remember a couple of months ago I saw a post (or comment) on Codeforces with the link for the extension that allows showing only difficulty tag for the unsolved problems on the particular problem page (like https://codeforces.net/problemset/problem/1385/G).
Could anyone suggest a link to the post, the comment, or the extension? I have tried to Google it but did not manage to find.
Hi!
Today I faced this problem: https://www.hackerearth.com/codex-6-0/algorithm/dummy-4-1/.
Problem statement in short: there are ones and zeroes in two-dimensional array N × N. How many ways do exist between top-left corner and bottom-right corner, if you can travel in horizontal or vertical directions only (not only down/right but in any direction) and you cannot visit any cell twice? N ≤ 100
All accepted solutions are simple bruteforce, that gets TL on array 100x100 with all zeroes in it.
What is the approach to solve this problem?
During several years Codeforces users created useful userscripts that collected significant amount of fans. Tonight I merged a couple of popular scripts into one Chrome extension Codeforces Enhancer.
Brief description of features:
Based on userscript by yak_ex (http://codeforces.net/blog/entry/1871). 
Based on userscript by yak_ex (http://codeforces.net/blog/entry/1743). 
Based on userscript by pablo.aguilar (http://codeforces.net/blog/entry/4357). 
You can download the extension at the Chrome Web Store: https://chrome.google.com/webstore/detail/codeforces-enhancer/ocmandagmgmkcplckgnfgaokpgkfenmp.
Source code on Github: https://github.com/agul/cf-enhancer.
I will be happy to receive feedback and suggestions :)
UPD (25.06.2015): Now on Results page number of unsuccessful attempts is shown near submission time.
UPD (25.06.2015): Latest version on Github (if unable to download from Web Store): https://github.com/agul/cf-enhancer/releases/latest.
UPD (27.07.2015): Options page added: now you can enable only functions that you like.
UPD (22.07.2020): Fixed HTTPS issue. Changed color scheme in Standings, similar programming languages are group by the same style. Latest version is available on Github.
Now you can see a clip near the blog header: "Attach this blog to some contest as a resource". Then you can choose there next options:
So now you should not find blog with links to all editorials or use search to find some discussion. Thanks MikeMirzayanov and whole Codeforces team!
