Hey Codeforces,
How is 20B - Equation actually rated 2000? The problem is literally high school algebra: solve Ax^2+bx+c=0. Even accounting for basic edge cases (A=0, infinite roots, precision), by today's standards this is an 800–1000 rated Div.2 A at most. Is this just a broken artifact of early Codeforces rating algorithms getting tricked by high submission fail rates in 2010, or am I missing something? What rating do you think it actually deserves today?
670 rating
here
btw some of my macros are messed up bc for the setprecision i had to change ints to doubles, and my ide's find and replace is stupid
Pretests are apparently pretty weak so in contest people got incorrect on the system tests with no way of fixing their submission. While in practice or even in a virtual contest now it is run on all tests.
I believe there're countless corner cases.
I think I can't solve it without over 10 WA submissions
I think Problem 10D is way more overrated than 20B. It's just a really easy DP. Its rating is mostly that high because there was an issue with the original contest D, and the current D isn’t actually the one that was used in the contest
I feel like 20C is more over-rated, since it is literally just Djkstra's algorithm
Dijkstra wasn't a famous algorithm those times