TBH I looked at div 2 B and it looked kinda hard but that could also be because I didn't force myself to sit down and really think about it. At least statistically it seemed like everyone thought B was easier than C.

Bad variance is also absolutely a thing, sometimes you'll have a hit or miss problem and you miss. Reference spectral cup round 1 when I got cooked by C and got a pupil perf as a 1900 :sob:

AI finds nothing there so they can't be cheating

At this point I just participate in contests for fun, rating is a joke kinda with today's cheating situation. For rating I just participate on AtCoder which I feel is more fair and reflects your growth with more honesty.

i lowkey took less time solving c and d than a and b lol. so it's not just you

This round ranking is very abnormal.

Div 1 has two CM that reach top 20 and several Master, one of the CM beat tourist and have been cheated in history. You can check the profile.

Div 2 is even worse, so many Newbies AK this contest, and problem Div 2F accepted users is nearly as same as Div 2E, which makes no sense because Div 2F is much harder.

One newbie have stayed in the Newbie for 15 rounds and AK this round, could you believe it? Here is this user's profile. Link

Valid crashout.

The bad problems order and mismatch points is already bad.

The solve count based on the difficulty of the problems also makes no sense.

Editorial gives little to zero explanation (Div2B) even I think explanation is misleading so I have to ask around for the better one...

The overall quality is so bad.

For me it was one of my fav div2B, i think this might be just me hating greedy and constructives, but yeah it really isn't as bad as people say it is, because there are people like me who found B easier, so you can't project your weakness in some area as the problem being unfairly placed. It was different from the normal B's is what I'd like to say and bringing something fresh is necessary to keep the platform alive.

B one was pure luck type thing see , all answers were in power of 2 so i first tried k=(r*c) then ans= 2^(n*m-k) then i tried r-- ; c--; then same then just did r=n-r , c=m-c; then ans=2^(n*m-(r*c)) then did r--; c--; then again same formula and all were matching testcases and got ac i thought of something else did something else but got correct answer so i see it as a win ig although lost 32 rating points

I dont know why but i found C more easier than be it took me less time to solve it maybe because i think knew the bitwise thing and in B was more a guesswork (acc to me) The problem with B was it wanted us to write down the guesses, the assumption, It was playing with our daring to not pick up the pen on A B and start the writing part in C or D so the thing most people didnt solve B my guess they they were trying to visualise it in their head rather than writing it down on a piece of paper. It really tested the EGO of the guys saying div 2 B i can just do it like i do div2 A

Exactly it took me 2 hours to solve B .

Then i did C , D within 2 hours after contest with no editorial :(

div 2 B was kinda hard, however, i didn't solve C at all! B was kinda fun too!

I literally don't understand how people might even think that C/D is easier than B. B took me only 9 minutes, C took me 30 mins, and D took me over an hour. Sure, there might be some difference (I know combinatorics for B very well, C is just legit hard, and I was just stumbled on D), but not an hour long one...

You're genuinely referring to Camus' philosophy.

There is only one really serious philosophical question, and that is suicide.

i guess it might be guessing? cheaters yes, but I think B is guessable. also B literally gives you a pre-rref'ed matrix and asks you to print the rank which is literally the number of rows btw :sob:

Just become a candidate and skip div2 AB... Sometimes that problem is crazy.

Yeah I think every single one of problems A through E from yesterday's contest is underrated on CLIST. Kinda wild

I would say B is easier than you make it out to be, but I never really understood why my solution worked and just guessed as soon as I found something that worked since test case 1 was generous. I do generally prefer problems with edge cases in the test cases but this one just felt like the one edge case in there was to help you make a wild guess rather than a collection of edge cases to save you the time of brute forcing them yourself.

I just read that problem and I think it's completely free if you notice that you can think about each prime independently; for all primes $$$p$$$, if $$$x, y, z$$$ are their exponents in $$$a, b, c$$$, then the condition is just $$$\min(\max(a, b), \max(b, c)) = \min(a, c)$$$ , which one can see is equivalent to $$$b \leq \min(a, c)$$$ after thinking for a bit.

Maybe you're overrating the difficulty of the problem because the editorial doesn't mention that?

I do agree that solve counts are often ultra sus nowadays, but not really for this problem imo

Sorry for writing this, since then I realized I'm just stupid and not meant for cp, and I was blaming it on other factors. I will never do this again