| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | Proof_by_QED | 131 |
|
+6
nice :) |
|
+6
163E - Электронное правительство is also a aho problem |
|
+1
... thank's :D |
|
+1
how did u solve it with Dsu on tree? can u explain your approach ? :) |
|
0
hi i cant find the bug in my code can anyone help ? http://codeforces.me/contest/893/submission/32598508 |
|
0
yes |
|
+3
bro in youre pow function you should set it to : long long pow(long long x, long long y, long long mod) { ... } you've overflowed ;-) |
|
+3
read my next comment |
|
+5
I like the way of setting pretests and main tests ;-) good job |
| Name |
|---|


