Actually, I want to change my handle to "antidisestablishmentarianism", but it is too long so I could only change to "antidisestablishment" :(
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
1 | maomao90 | 163 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
Actually, I want to change my handle to "antidisestablishmentarianism", but it is too long so I could only change to "antidisestablishment" :(
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.
I don't want to see that Div4 is a speed competition, so I think it must have at least one *1800 or *1900.
Welcome to show your ideas.
Well, it is meaningless
Name |
---|