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
|
Pratyush Sharan:
2014-05-21 13:11:01
How to remove the time limit exceeded error in C? Can someone post some special test cases here? My code is running perfectly fine . |
|
Love Bisaria:
2014-05-19 10:49:51
Time limit exceeded issue.. Not able to solve.
|
|
pvkcse:
2014-05-14 20:17:36
<snip> here is my code in c# but here in spoj it is runtime error(NZEC)...can't find what the error is...!!! Last edit: 2022-06-19 12:35:46 |
|
Jatin Kathuria:
2014-05-13 16:30:24
are m and n random numbers or user input numbers?
|
|
Mislav:
2014-05-12 23:18:37
My segmented sieve doesn't work :S Last edit: 2014-05-13 18:51:23 |
|
sai spoorthy:
2014-05-11 19:29:18
SIR
|
|
amir elsayed:
2014-05-10 11:14:19
my code run on visual studio and give right answer but judge said time limit exceed why |
|
Michael Moerschell:
2014-05-08 13:09:37
@Darshak Mehta If m == n print m if it's a prime number, otherwise don't print anything |
|
Darshak Mehta:
2014-04-21 19:01:55
Can any one say me what should i print for m==n 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 |
RSS