how do they solve in 0ms?

Write here if you have problems with your C++ source code

Moderator: Board moderators

Post Reply
New poster
Posts: 18
Joined: Wed Dec 17, 2014 9:44 pm

how do they solve in 0ms?

Post by BlackBeard » Tue Jan 20, 2015 3:16 am

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..?

Posts: 5947
Joined: Thu Sep 01, 2011 9:09 am
Location: San Jose, CA, USA

Re: how do they solve in 0ms?

Post by brianfry713 » Tue Jan 20, 2015 10:14 pm

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.
Check input and AC output for thousands of problems on uDebug!

Post Reply

Return to “C++”