| Title |
User |
Message |
Date Posted |
| Re: Re: So this is what your supposed to do, right? |
ilovepi |
Can't you use an array of [1..5000000] of boolean for this question instead? |
Mar 15, 2011 - 5:44:02 pm UTC |
| Re: Re: So this is what your supposed to do, right? |
bbi5291 |
I recommend that you try this problem later when you have more coding experience. You should at least try coding the original Sieve, anyway, and see whether you can get Primes (1) accepted. |
Jan 20, 2011 - 2:19:08 am UTC |
| Re: Re: So this is what your supposed to do, right? |
ilovepi |
Well, can you give me a clue on the variation? Is it, a), an integer, b) string, c) char? An array as well, right? |
Jan 20, 2011 - 2:18:15 am UTC |
| Re: So this is what your supposed to do, right? |
bbi5291 |
The Sieve of Eratosthenes finds prime numbers. So I'm not sure what you mean by "and then"... all you do is print the prime numbers you find. You do need to implement a variation on the standard Sieve... |
Jan 18, 2011 - 1:21:21 am UTC |
| So this is what your supposed to do, right? |
ilovepi |
So first you use the sieve of Eratosthenes and then...? |
Jan 18, 2011 - 12:16:46 am UTC |
| Re: MinGW max array size |
ryuuga |
That's because memory on the stack is limited. There's much more on the heap. On windows, you could try (assuming mingw uses gnu gcc compiler ) Go to CodeBlocks->Settings->Compiler and Debugger->Linke... |
Jan 10, 2011 - 1:54:28 am UTC |
| MinGW max array size |
HelloMelloC |
Anyone know why you can't set an array of 5000000 bools in MinGW on Code::Blocks 10.05? Gives general SIGSEGV fault, but works fine on judge. Is it a Windows limitation? I thought I could create array... |
Jan 09, 2011 - 11:57:54 pm UTC |
| Re: runtime error |
bbi5291 |
Yeah, executing your program on the terminal gives "terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc Aborted" However, even when the memory limitation is remov... |
Aug 27, 2009 - 7:42:16 pm UTC |
| runtime error |
ragulan5 |
I am getting runtime error. Is it because I am exceeding the memory limit. |
Aug 27, 2009 - 6:16:16 pm UTC |
| Re: Any more hints???? |
bleung91 |
there is a "well-known" algorithm for generating prime numbers up to N, as Dr. Sane pointed out. Try finding it. |
Feb 12, 2009 - 2:51:05 am UTC |
