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.hide comments
Vimeet Gautam:
2013-03-13 22:12:29
Thnx Sir for your help @Michael T |
|
Michael T:
2013-03-13 22:12:29
@Alexey: So hard to check? Read input and do nothing - you should get WA. |
|
Alexey:
2013-03-13 22:12:29
@admins
|
|
Michael T:
2013-03-13 22:12:29
@Vimeet: Runtime means compiling went OK and it breaks while running. |
|
Vimeet Gautam:
2013-03-13 22:12:29
My Program runs in gcc compiler but compiling in SPOJ it gives a runtime error NZEC please any body solve my problem |
|
hemezh:
2013-03-13 22:12:29
@Botta: have a look on http://www.algorithmist.com/index.php/Prime_Sieve_of_Eratosthenes.c |
|
Giovanni Botta:
2013-03-13 22:12:29
Really struggling with this one.
|
|
David Winiecki:
2013-03-13 22:12:29
Diogo's second comment about the Sieve was really helpful. I can't believe how effective that one change was. |
|
Mukul:
2013-03-13 22:12:29
I think this problem should be solve using Sieve algorithm, otherwise you will get TLE as i got. |
|
Adrian Kuegel:
2013-03-13 22:12:29
Try this case:
|
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 |