| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
|
-21
overrated |
|
+22
What way you will use to choose random prizes? For example in one of past cf rounds python code posted on the blog and rand seed was id of last submit in contest. |
|
0
|
|
+2
why not Java 7? |
|
0
just python is sooo slooooow. |
|
0
Сначала подумал, что вы из тех иностранцев, которые не знают о емаксе, но нет... вобщем глава "Всевозможные скалярные произведения" link. не само решение, но на нём основано. |
|
+3
don't know, but obvious mistake is
|
|
0
|
|
+1
|
|
+37
Black Day of Topcoder |
|
Last visit: 14 months ago yeah, he really should be banned!!... |
|
0
bfs find shortrest path from vertex to others in time O(V+E) if all edges have are same length. 0-1-bfs is the same, but edges can be with length x or 0. time O(V+E) too. sorry for bad english |
|
0
|
|
+9
my eyes UPD: much better |
|
+2
164 = 47*4 + 4 — 7*4, palindrome :) |
|
-9
too difficult, 164 = 74 + 74 + 4*4 |
|
+10
No, Round 164 div 2 == Round 82 == 82. |
|
+9
|
|
+14
220E — we use RSQ, not RMQ |
|
+2
but not 4096-th... |
|
+3
what's interesting, administration still don't comment this situation... |
|
+2
Вы не подумайте, я лично его не минусовал.
|
|
-54
You are green
|
