| Title |
User |
Message |
Date Posted |
| Re: how did you guys get such fast run times? |
taimla101 |
Come on Bosco, if I, of all people, could figure it out, then you should be able to. |
Dec 18, 2008 - 1:54:06 am UTC |
| Re: Sieve |
bbi5291 |
Your method of checking for pairs is simply too inefficient. If you know one of the numbers of the pair, you already know what the other should be - why would you need to use a loop to search for it? |
Dec 18, 2008 - 1:44:58 am UTC |
| Sieve |
seyonv |
I'm getting time limit exceeded even with the sieve. I just created the array and found all prime numbers and then I stored all primes in another array and outputed them by just using an embedded for ... |
Dec 18, 2008 - 1:06:59 am UTC |
| I didn't even use the sieve. |
bbi5291 |
I just went through and determined all prime numbers by the brute-force method. |
Oct 25, 2008 - 3:03:38 pm UTC |
| how did you guys get such fast run times? |
bleung91 |
??? |
Oct 25, 2008 - 3:25:56 am UTC |
