| Title |
User |
Message |
Date Posted |
| Re: SourSpinach |
bleung91 |
no it's 2 seconds per test case, so my program could thereotically take 10 seconds. however, I can't take 3 secs on 1 test case and 1 on another. |
Nov 24, 2008 - 3:11:07 am UTC |
| SourSpinach |
zerglingrush |
Didn't SourSpinach exceed time limit? |
Nov 24, 2008 - 2:55:43 am UTC |
| Re: Re: Bosco |
hansonw1 |
The judge's accuracy is roughly +/-0.004s - if you want a faster runtime, optimize your program. Hint: cin and cout are rather slow. |
Nov 24, 2008 - 2:37:36 am UTC |
| ... |
DrSane |
Actually, looking at Sour Spinach's code, he still used the same algorithm. But not in the same way as the rest of us. |
Nov 22, 2008 - 3:00:37 pm UTC |
| ... |
DrSane |
It's only difficult if you don't know of the "well known" algorithm for generating primes. It's really quite straight forward once you do, and maybe even unfair for those who don't. (Is a hint perhaps... |
Nov 22, 2008 - 4:56:45 am UTC |
| Re: oh snap! |
bbi5291 |
¿Cómo? Did you mean "dissent"? |
Nov 22, 2008 - 4:10:36 am UTC |
| oh snap! |
Shankalon |
is that dissension i am hearing? |
Nov 22, 2008 - 3:48:01 am UTC |
| if it were so easy |
qinhaotian |
then why do you only have 3/20... |
Nov 21, 2008 - 4:36:38 am UTC |
| stop whining |
taimla101 |
the program isnt that hard if you really think about it so stop complaining. |
Nov 21, 2008 - 3:56:33 am UTC |
| Re: arrays |
bbi5291 |
The memory limit on this problem is 16 MB, which is around 4 million ints, 8 million shorts, or 16 million chars/bools. Standard compilers won't let you declare arrays larger than about 2 GB, but you ... |
Nov 09, 2008 - 5:30:14 pm UTC |
