peak

most CPers use C++

wildcard spots are so cringe. you take away the spots of teams 26-30 just to make everyone else beg for a chance to qualify

The cf format rewards speed; it isn't the problem's fault.

I agree that it's not the problem's fault. that's why i said the guessforces problems aren't inherently bad.

the only way i can think of requiring proofs is: here is some artificial operation i just invented and you will now be forced to find and and prove my observation.

Mathematical olympiads are a thing. in fact, in combinatorics problems (basically the closest thing to cf in MO), getting the right answer/construction is (most of the times) only a small part of the problem, usually earning less than 30% of the total score.

If they're (not) bad, why shouldn't they appear on codeforces?

Because they are not appropriate to the format, as i said. The same way that a problem that requires advanced knowledge isn't inherently bad, but it can't appear in IOI.

Where should they appear?

In mathematical olympiads.

The point is that guessforces problems aren't inherently bad, they just shouldn't appear on codeforces because of the format (speed is important and proofs are not required). it has nothing to do with whether or not one solved this particular problem.

use chat-gpt to get banned

fun fact about F: every planar graph has a dual, and some graph theoretic properties in the primal graph become other graph theoretic properties on the dual graph. for example, an Eulerian subgraph (all degrees are even) in the primal corresponds exactly to a cut (coloring the faces 0/1) in the dual. it turns out that thinking about the dual graph in this problem makes the weird alternating sum formula and the connectivity constraints a lot more intuitive (at least for me).

i think we can safely assume there will be 8 problems. if that was not the case, they would have made a 6 7 joke. right?

https://oj.uz/problem/view/JOI18_candies this problem is mind blowing, but its pretty hard

for C2 was the intended solution to just simulate dfs using the queries and use dp to store how many paths start at each node (and use the dp values to know which query you should make to find the neighbours of the current node)? i got so many WAs

greedy bitwise constructive... i hate cf brainrot so much :/

only allowing div1 people is ultra gay. a competitive programming discord server without greens is worthless.

another trash round :/

same... it was a WA forces for me

thank you

how to solve F?

dumbest contest ive ever participated in. gl CM :(

great! thank you

will the problem statements be in english?

i agree

i got CM, therefore the round was awesome