Discussion @ 1010. Discrete Function @ Timus Online Judge

need hint

Posted by Lalescu Liviu 14 Oct 2001 02:32

Can you give me a hint? What is the complexity? The
solution is O(n^2) with heuristics?

Re: need hint

Posted by Vinicius Fortuna 17 Oct 2001 08:02

The best solution is O(n).
Note that there is always an answer of the kind x and x+1.
And don't forget to take care of overflows.

> Can you give me a hint? What is the complexity? The
> solution is O(n^2) with heuristics?

Re: need hint

Posted by Lalescu Liviu 17 Oct 2001 16:31

Thank you very much

Discussion of Problem 1010. Discrete Function