| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 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 | 164 |
| 2 | adamant | 150 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
|
+10
__builtin_orz() : warner1129, Egg_OwO, BOSON._. |
|
+16
Dear Codeforces Team, I recently received a message regarding a similarity between my solution 288544883 and asd7766zxc's solution 288588555 for problem 2026E. This was due to the coincidence of the algorithm used in the problem, the algorithm source code from mine and asd7766zxc's are the same, but both were written and published before the start of the round. I kindly request the Codeforces Team to review our submissions and source codes. Thank you for your time and attention. Best regards, jakao |
|
+10
|
|
0
Can problem H use min cost flow to solve? |
|
0
Got it! Thanks! |
|
-11
Auto comment: topic has been updated by jakao (previous revision, new revision, compare). |
| Name |
|---|


