Comments

Cheer to the committed pupils :)

Oh I need to participate this at 2:35 am :(

Brilliant contest.

Additionally, during contest I remembered the problem 2255D which involves binary searching the answer with time back-tracking trick while checking. It helps a lot for solving problem E.

My first Div.1+2 after reaching 2100 let's GOOOOOOOOOOOOOOOOO

I don't have the answer either, but here's something I want to tell you: a plateau can be really, really long — mine has been. This past year I trained a ton, and I realized CF rounds are a whole different beast from ordinary ones. They have their own system of methodology. A lot of the time you have to read the setter's mind — even guess the first couple of steps of the solution — before the rest just falls into place. And regular practice doesn't build that skill at all. Let's both keep improving.

-8

More Cyan, Green, Gray testers. That's very good.

On Temirulan → DeepInfra Intro, 11 days ago
-27

It will be my first div.1+2 after reaching 2100

Good luck everyone

The gap between D and E is very huge, as 1400 to 2300.

And why $$$O(n^2)$$$ or $$$O(n\log^3n)$$$ can pass E's system test ?????????

+130

I can avow that the account is a thoroughly innocent account.

I don't think CF administrator has such right to seal the 6'000 RMB without providing any reason.

That's a great shock.

Here's a previous similar one:

CF1909I

a div1+2 I rated 1900

0

No it's 74TrAkToR we are in great danger

Best chance to reach 2100

Fantastic round, enjoy it

On clist.by we can check the hardest div2D since 2026:

wonderful 2500 difficulty!

B1 B2 are crazy

Why no cyan- testers

Educational rounds are not that good since edu189.

No expectations.

On Bufu → Codeforces Round 1115 (Div. 2), 2 months ago
+11

Hope to solve problem E!

-17

Love satyam343 round. Love chromate00 as a tester.

I guess the previous one will change it's schedule first.

The most arrogant, immature, stupid author forever.

I'm also a victim in alt banning.

We don't have any other fault except using alt accounts.

On makrav → Codeforces Round 1111 (Div. 2), 3 months ago
+13

Hope my rating keep 2026 after this contest :)

Propose multiple constructions and pure-guess problems won't make your reputation be more positive.

Sincerely to every author who have the very bottom-line sympathy to participants.

No way two legendary binary contest 1100 and 1110 are both Spectral::Cup

It's a little surprising that the difficulty of problem E is probably above 2600 which may(I think) contradict with what authors and testers had predicted.

If the final ratings are 800 — 800 — 1300 — 1800 — 2600 — 2800 as clist shows,It will give out

1.The biggest D~E difficulty gap so far in 2026.

2.The most complex counting problem on C which is just 1300.

On ezraft → Codeforces Round 1108 (Div. 2), 3 months ago
+16

my #99 rated contest! good luck every participant!

Solve E in $$$O(Tn\log^2V)$$$ too,and failed on system test.

I heard that there're only 6 weak pretests in problem E,which was misleading.

Fight for Master go go go

0

Can you teach me how to get positive delta 13 times in a row :(

0

Don't want to lose rating anymore TAT

Cool,got -100 rating

But problems are good

I'm stupid

Hope to solve 3 problems and get higher rating! don't want to become CM :(

Have lost 120 rating in Order Capital Round 1 :(

Wow 67 problems that's not a good choice

On yanb0 → Codeforces Round 1102 (Div. 2), 4 months ago
+23

It can be interpreted that F is the hard version of D

0

So many C1+C2 these weeks

Fantastic!

I'm a fan of Kuro_neko awa

On xoxo → Codeforces Round 1099 (Div. 2), 5 months ago
+20

Wow unexpectedly short announcement.

Hope the contest proceeds well!

After 35 contests and over 220 days practice I finally reach master again

On Sanae → Codeforces Round 1098 (Div. 2), 5 months ago
+25

You say you want to carry on the "pure love" of that passion.

But which I see is you are just stealing others love of CP by setting such ragebait problemset.

On Sanae → Codeforces Round 1098 (Div. 2), 5 months ago
0

Are you Kuro_Neko?

On Sanae → Codeforces Round 1098 (Div. 2), 5 months ago
+15

Same task arrangement as the last full-cf div2 round!

I like that and hope to become master again awa.

Good luck to everyone!

Have lost my chance to participate offline

On yse → Codeforces Round 1096 (Div. 3), 6 months ago
-6

As a VIP participant of cf rounds,I've fully prepared to solve div3 problems.

Wow it's very hintive that the score of E,F,G are same...

Are you serious?is that meaning their difficulty are identical.It's lack of probability.

Anyway,hope to get more rating!

On SpectralTech → Spectral::Cup 2026, 6 months ago
+3

Hope to become master again!

I wish it a successful contest better than edu185!

edu185 is the worst edu I've ever participated.

I wish this a best alternative for THUPC.

Just show what a fantastic rated div1/div2 contest should be like

show not leaking contest problems is a very easy thing

Though there're many tough days,I believe I can make it(to get higher rating and reach master!).

PS: I wish one day I can contribute my problem for the following THUPCs in the future!

14th April,guys

My last chance to reach master before my birthday :(

My 23th try to become master!

On Zheng_iii → Invitation to CYCPC Round 2, 7 months ago
+18

As a VIP tester,give me contribution

Hope to become master again:)

Killed by H

I CAN'T BELIEVE H IS NOT A DP PROBLEM after solving ABC437G

I've done a unbelievable weird job during this round

solved 6 but ranked 850+

because of 10+ penalties

I suspect I'm not a human being

On twosquares → Good Bye 2025 Editorial, 10 months ago
+19

I thought I've trained hard by the end of 2025,but last night I was stuck by D and haven't noticed "removing maximal" in problem E so I got -77.

It really makes me depressed but I think I will get a better score in 2026.

Ruler always communicates smoothly

On Endagorion → Pinely Round 5 editorial, 11 months ago
0

For problem F,after reading I feel a little awkward Is the editorial discussing all about the weighted tree version,which is strictly harder than the unweighted tree version?

Fail to solve D for over 100 minutes ): I believe it has a really wonderful solution (: but it really hits me fiercely when my rating is 2098 ):

On Kuroni → Codeforces Global Round 25, 3 years ago
+125

I'm very unsatisfied with this "unbelievable" round

3 constructions,2 of them use k < 3 conclusion

guess guess and guess

I can't learn anything except guess from the "global" round

I'll DOWNVOTE it

C is much harder than D,I even used a segment tree to solve it.

Speed Forces!