Can polynomial interpolation for two given arrays of size n, be done with a complexity better than O(n2)?
Lately, nearly every day I come across with comments which advertise something, from online games, through websites, to online courses. These comments are always made by unrated users, who has just registered to the site.
I think the problem could be solved, if making comment had some prerequisite, like having participated in a contest, having made accepted submissions, or something.
When I'm solving problems in practice section, and I keep getting WA/TLE on some case, I usually peek on the test case which I failed, so I can find the bug in my code, or realize my solution is wrong.
Should I keep doing it, or it ruins the practice? (So I won't get better if I use it)
During the CEOI there is always an online contest, on the official page of CEOI, where non-participant people can solve the tasks too on the online judge.
I'm interested, if there is an online (preferably live) mirror for IOI 2017, as I couldn't find anything about it on the official site of IOI 2017.