→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Find user
→ Recent actions
Comments
|
0
could anyone explain the proof of problem-c greedy? |
|
0
this works for the given question, without follow-up, right? |
|
0
Could anyone explain, why dividing elements by 2 until we get an odd number works? |
|
0
could you please explain it with some examples, didn't get it. |
|
0
Choose two adjacent slimes, and combine them into a new slime. They must be adjacent. |
|
+68
Sir, editorial isn't accessible. Could you please look into it? |
|
0
yeah, me too. I don't know why. |
|
+22
Could anyone please provide link to the editorial? It's showing you are not allowed to view the requested page. |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/18/2026 12:22:23 (g1).
Desktop version, switch to mobile version.
Supported by
