Actually, I want to change my handle to "antidisestablishmentarianism", but it is too long so I could only change to "antidisestablishment" :(
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
The past round is unrated,I feel disappointed but I think unrated is the best decision.
So, why an Candidate Master can prepare problems after E? I think codeforces should set a limit.
In the Editorial, it didn't explain the SG function has a cyclic section of length $$$34$$$ by strictly proof. So I hope someone can help me.
And another problem : Why the conclusion that problem-maker cannot prove can become a problem in the contest ?
Although 1710E - Two Arrays can be found on the internet,this problem is actually a hard problem, *2400 is too outrageous.
Well, Can you image that 1E is well-known?
It is unfair.
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 00:16:16 (k2).
Desktop version, switch to mobile version.
Supported by
