| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 130 |
|
0
I got 3 penalty for this one |
|
0
Can anyone explain problem E i have doubt how we find r[0] as we have to sum over all r[i] and once we find r[0] all other expressions depends on r[0] only and if I want to find r[0] by traverse from 0 to 10^9(M) then it's gave me TLE also I find that we can build a function and here only one variable is r[0] and then I have to check whether this function gave us maximum but how to implement I have no idea. |
|
On
TheEvilBird →
Codeforces Round #1078 (Div.2, based on Moscow Olympiad for Young Students, rated), 8 months ago
0
yes i am waiting for when we submit the solution for problem |
|
On
TheEvilBird →
Codeforces Round #1078 (Div.2, based on Moscow Olympiad for Young Students, rated), 8 months ago
+1
also i have implemented DP solution but 4 minutes after contest |
| Name |
|---|


