| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
| Name |
|---|



i.e.
see sample via my submission -> source ID -> test case is on the bottom.
in contrast to Round # 58
Problem E needs more clarification!!
Karlsson wins when he makes the final chocolates eating !!?
and the same for Lillebror!?
this was ambiguous point.
/////////////
Question off the round - what's the effect of checking out of the round button in the right top of the standings page !?
I'm afraid that makes me out of the today contest !!! :D
But hopelessly ;My rating decreased although today's rank [173] is my best rank and also today's score is my best score 1240
I'm trying to understand the rating system mechanism from here
http://mirror.codeforces.com/blog/entry/102
but no sufficient details or (examples ) !!!
FOR(a,1,n) if (rank[a]<k) ans=max(ans, k-rank[a]+a-1);
cout << ans;