| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
|
0
A difficult div2, but nice problem |
|
+1
Generally speaking, difficulty is ok, and solutions of problems are good, but A and B take more time to understand the meaning than to solve them, which I don't like. The style of problem D is not similar with common problems in codeforces, but I think it's a good problem. And I love problem E. |
|
0
I like problem D much |
|
0
C,D are good problems, and I like them much. However, I think it's not suitable to have these four problems as ABCD in div2, since they require no algorithm(need the thought of greedy, maybe) |
|
0
div2 D such an amazing problem. Once you find the key point by observation(the graph), you can immediately solve this problem |
| Name |
|---|


