| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | Dominater069 | 131 |
| 9 | Proof_by_QED | 130 |
| 9 | AmShZ | 130 |
|
On
Proof_by_QED →
EPIC Institute of Technology Round Summer 2025 (Codeforces Round 1036, Div. 1 + Div. 2) Editorial, 9 months ago
0
My solution is also wrong in this case. Can you help me? |
|
0
In problem E, the writer says "This will be the optimal answer because all the cards taken from array a will be at least as large as all the cards that have not yet been taken from array b , meaning there is no point in making additional swaps of cards from one array to another." Can any explain this? I don't understand. |
|
0
Congratulations. Thanks for your stories. And have learnt something. I am practicing intensively for the Vietnamese National ICPC and hope to qualify for the Finals one day. |
|
On
CF_contest_practice_2 →
[Segment Tree?] Count the number of pairs in a range less than a given pair., 19 months ago
0
I think task 1 can be solve using offline queries or persistent segment tree for online. |
|
0
|
|
0
I have no ideas why I got wrong answer on problem G: https://codeforces.me/contest/1980/submission/264341580. My solution is the same as editorial. |
|
0
In problem 1874C — Jellyfish and EVA, in second test case, I have no idea why the output is "0.625000000000".Please explain to me. |
|
0
I got it, thanks. |
