→ Pay attention
Before contest
Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2)
00:01:15
Spectral::Cup 2026 Round 2 (Codeforces Round 1100, Div. 1 + Div. 2)
00:01:15
*has extra registration
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | Kevin114514 | 3678 |
| 3 | VivaciousAubergine | 3647 |
| 4 | jiangly | 3582 |
| 5 | strapple | 3515 |
| 6 | tourist | 3473 |
| 7 | Radewoosh | 3418 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | turmax | 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
Yes, my bad! you are right :) |
|
+3
Thanks...my bad, I was submitting the wrong code!!! |
|
-15
I have tried both %lld and %I64d, none of them works :( |
|
0
it is really surprising, i replaced min/max by fastMin/fastMax and it got accepted!!! (time taken = 2.9s) |
|
+8
How to compute P? |
|
0
Can someone please explain how to compute q(s) efficiently? Is it possible to compute within 1s (Total number of states is 10^9) ? |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/23/2026 17:33:47 (g1).
Desktop version, switch to mobile version.
Supported by
