I said solving olympiad problems is NP-complete task. Not problems themselves. See the difference? Let's say there is a relatively simple olympiad puzzle. Also

I said solving olympiad problems is NP-complete task. Not problems themselves. See the difference? Let's say there is a relatively simple olympiad puzzle. Also, let's say there is a imaginary robot which should solve this olympiad puzzle. What I said there is no fast universal algorithm for the robot which allows to solve any such olympiad puzzle. The only thing robot can do to solve many (but not all) problems is heuristics with random elements.