→ Pay attention
→ 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
|
On
dtc03012 →
After all, I think Solving Greedy and Dp problem is difficult Between all of algorithms, 6 years ago
+31
Exactly |
|
+16
But Ezreal is Toxic |
|
because of STUPID RIOT |
|
EZREAL BUFF PLZ STUPID RIOT!!! |
|
0
EZREAL BUFF PLZ STUPID RIOT!!! |
|
0
but.. sys fail on A... |
|
0
Yes! That is correct answer! |
|
0
Yes |
|
0
9 2 1 2 1 3 1 4 4 5 5 6 6 7 7 8 8 9 in this example, is your code going right? |
|
0
But is That solution O(N^2*M) ? |
|
0
anybody know how to solve E ? |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/20/2026 02:22:26 (g1).
Desktop version, switch to mobile version.
Supported by
