Submit | All submissions | Best solutions | Back to list |
PRIME1 - Prime Generator |
Peter wants to generate some prime numbers for his cryptosystem. Help him! Your task is to generate all prime numbers between two given numbers!
Input
The input begins with the number t of test cases in a single line (t<=10). In each of the next t lines there are two numbers m and n (1 <= m <= n <= 1000000000, n-m<=100000) separated by a space.
Output
For every test case print all prime numbers p such that m <= p <= n, one number per line, test cases separated by an empty line.
Example
Input: 2 1 10 3 5 Output: 2 3 5 7 3 5Warning: large Input/Output data, be careful with certain languages (though most should be OK if the algorithm is well designed)
Information
After cluster change, please consider PRINT as a more challenging problem.Added by: | Adam Dzedzej |
Date: | 2004-05-01 |
Time limit: | 6s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: NODEJS PERL6 |
hide comments
|
||||||||||||||
2013-03-13 22:12:29 Hasib Al Muhaimin
I have faced the <b>run time error</b> with C :( |
||||||||||||||
2013-03-13 22:12:29 Radnus Mayhs
when i compiled this program on my pc the execution time was 5secs which is less than time limit for this problem...but spoj produces the error "time limit exceeded " can anyone help? |
||||||||||||||
2013-03-13 22:12:29 Giovanni Botta
@Neha: as suggested, it's a segmented sieve, not a full sieve. @Vikas: the first integer you read is the number of test cases. |
||||||||||||||
2013-03-13 22:12:29 Luthfan Aufar
TLE .___. |
||||||||||||||
2013-03-13 22:12:29 Vikas
I have a question. The input numbers in this problem should be read from a file or from standard input console ? If it is from console how do we define end of input numbers ? Last edit: 2011-11-24 16:16:26 |
||||||||||||||
2013-03-13 22:12:29 Neha
@Giovanni Botta I tried using Erathostenes sieve but the heap runs out of memory.. |
||||||||||||||
2013-03-13 22:12:29 Neha
@ Giovanni Botta : I tried using Erathostenes sieve but the memory of heap is not to save such large numbers. How did you do it? |
||||||||||||||
2013-03-13 22:12:29 Daphne Fourier
It would be fun using Template Haskell so the calculations are done at compile time :D |
||||||||||||||
2013-03-13 22:12:29 Giovanni Botta
Still getting WA. I have NO idea what's wrong with my code: I tested multiple cases and double checked the results with Matlab. No apparent mistake! |
||||||||||||||
2013-03-13 22:12:29 Giovanni Botta
@Ahmed.Mahmoued So there's a blank line only in between non-trivial cases and no blank line at the end? That's very confusing and not specified in the problem statement! |