| # | 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 | 142 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 8 | maroonrk | 132 |
| 10 | qwexd | 129 |
|
+1
div2 B and Cis too hard |
|
0
That's because you might know the answer of the questions after the end of contest. So, if you want to increase your rating, please registered for rated before the contest is started. |
|
+10
How do you know that before the contest??? |
|
0
hope to finish D and E to increase my rate |
|
0
In fact, you should buy as less as you can in one deal. but, the limit of k makes you must make some large deals. So, you should use as less as you can deals to fit the limits by greedy. and an important step is to find out that break a great deal is better than break a little deal.So you break the largest deal into three small deal and the count of deal plus 2.Repeat it untill reach the limit |
|
0
please tell me where to hack others code?I hadn't use this function before.Thanks |
|
0
I can't agree more.In fact,testing this kind of code is really easy.Just put a piece of code made by AI on the against-cheating platform can test it out.However,many of the newcommer have the ability to finish problem E.they may ranked high on Luogu,Atcoder or other OJ platform |
|
0
I solved 2 questions at last,and ranked 8626.I think it's a good result for a beginner.btw,I don't know how to participate in div3or4,I can only find div1 or2 in the contests page |
|
0
thank you. |
|
0
It is my first game in codeforces.I hope that I will pass at least 1 question.I don't know how hard the questions because I am a beginner of computer science.Good luck for me. |
| Name |
|---|


