Page 1 of 1

how do they solve in 0ms?

Posted: Tue Jan 20, 2015 3:16 am
by BlackBeard
I'm not an experienced programmer myself. So it maybe a stupid question. But often wonder that how the highest rank holders in most problems in uva solve them in 0 ms.
Even when I submitted a code by just writing:

Code: Select all

int main()
{return 0;}
I took 13ms. So how do they solve these problems so efficiently. do they use any library or algorithm? And what do I need to learn to solve problems efficiently like them..?

Re: how do they solve in 0ms?

Posted: Tue Jan 20, 2015 10:14 pm
by brianfry713
You can submit the same code twice in a row and get slightly different runtimes. It depends on many factors outside your control. Perhaps the old server gave faster runtimes.