Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026)
3 days
Register now »
Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026)
3 days
Register now »
| # | 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 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 137 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
|
+21
Anyone solve problem F by local search ? |
|
-14
Congratulations |
|
0
Thank you for your contest !!!!!!!!!!!!!!! I very love it |
|
0
Can you explain "We now iterate over these "blocks" of parallel lines and count the number of pairs each block contributes — a block of size s gives s(s−1)2 pairs." ?? And in problem B, why cnt[mx — 1] * (mx — 1) == i — mx && cnt[mx] == 1 is one color has the occurence 1 more than any other color ?? I don't understand. Thank you very much <3 <3 <3 |
|
-49
I think you can suffer it ! I was depressed when I 11 . So I think go travel to relax and suffer depression !!!!! (I'm not good at English !!!!!!!!!!!!) |
|
On
E869120 →
[Tutorial] A way to Practice Competitive Programming : From Rating 1000 to 2400+, 7 years ago
+18
Thank you for your tutorial !!!!!!!!!!!!!!! Love you so much !!!!!!!!!!!!! I want be the best !!!!!!!!!!!!!!!!!!!!!!!!!!! |
|
0
not |
|
0
Can you explain the algorithm of C?? |
|
0
How to take random result in problem A ??? |
