I noticed that most editorials of the last educational rounds will be published 1 or 2 days after the contest. Of course, I have nothing against it, but at all one trivial question, why?
→ Pay attention
Before contest
Codeforces Round (Div. 1, Based on Zhili Cup 2026)
5 days
Register now »
Codeforces Round (Div. 1, Based on Zhili Cup 2026)
5 days
Register now »
*has extra registration
Before contest
Codeforces Round (Div. 2, Based on Zhili Cup 2026)
5 days
Register now »
Codeforces Round (Div. 2, Based on Zhili Cup 2026)
5 days
Register now »
*has extra registration
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/01/2026 17:43:33 (g2).
Desktop version, switch to mobile version.
Supported by
We have an internal policy that editorials should be published not later than 24 hours after a round. I don't think that writers violate it often.
But, what about the problems' difficulty ratings update? In some cases, it is updated after 2 or 3 days. I think the difficulty rating is an important feature to know one's progress and it should also be affected within a day or so.
Pffff, is that a problem? If you couldn't solve some task, you can ask me!
bruh how to solve travelling salesman problem in polynomial time
I don't know exact time complexity, but use treap, where every node maintains '2D-Persistent tree with FFT on each node'. To further optimization use meet-in-the-middle, but I don't know how to merge, but at all you can create a graph, after that go to Dominator tree and do some stuffs with combinatorics or Burnside's lemma. But I don't know time complexity.
Are you kidding? Just use bitset
Oh, yes. I wasted my 20 years to solve it, but you find solution easier. 10q!
any other questions?
how to find girlfriend
how to find a boyfriend?
farmersrice please meet 731777 . Without assuming genders, you have 25% chance that both of you solved your problems here..
Wow, man, come on, you just assumed that gender is smth binary :(
I think the first problem is more solvable
That's simple enough...become a red coder!
It doesn't work that way
Yes.
I can confirm that this is not the case
Is P==NP?
No, P = NRT/V
lol weebs, P == F/A
NEZZ wrote NRT
you are the weeb here
The more general equation is (P+a/V^2)(V-b)=RT which holds true for all gases.
mind = blown
Sarcasm?
No
Why didn't you include moles in that equation?
wet_water V stands for molar volume, so no need to include n for moles.