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
Sapan tanted:
2014-03-03 07:19:37
how to solve segmental error
|
|
shaleen bakshi:
2014-02-18 17:42:09
i have been trying this problem for pretty long time and I am able to generate the answer which pretty much are correct . however when i try to upload the answer in here it shows me "wrong answer " . can anyone please help me with it !! |
|
fernando:
2014-02-15 13:22:25
i have to hardcode the primes? because i have a nice algorithm and it exeed the time limit :( |
|
kailash:
2014-02-15 09:20:50
easy one.........:)
|
|
heatOn:
2014-02-14 19:35:51
Finally AC !! :D |
|
Ekta:
2014-02-14 08:53:52
Can anyone suggest why this code is giving wrong answer..
|
|
ANKIT KUMAR CODOPEDIAC:
2014-02-13 11:49:55
what if the input :
|
|
RAJAT SINGH:
2014-02-13 10:05:58
got AC in second attempt but first one is simple .///bt getting time limit exceed Last edit: 2014-02-13 10:06:13 |
|
Saumyajit Dey:
2014-01-27 08:42:46
the code is running on my pc with boundary condition but not running on pc |
|
Unknown:
2014-01-26 12:29:02
can someone tell me the problem with my code
|
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 |