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
priyesh212:
2017-06-25 12:55:46
my code is working fine on codechef ide but here its showing time limit exceeded |
|
rohit5840:
2017-06-22 05:22:34
where i can see my submitted answer?
|
|
larunrahul:
2017-06-21 06:30:53
For each of the number in the range,
|
|
callmebray:
2017-06-20 18:58:00
This may be the dumbest question ever asked on here.. I know I can figure out how to print all the prime numbers, but i'm not sure how to actually read the input into my Javascript function?
|
|
hzshang:
2017-06-20 16:51:51
be careful of 1 and 2 =,= |
|
iamnoob_94:
2017-06-20 06:26:58
My code is working fine in my system but it is showing here that time limit exceeded.I wrote the code in java.Any solution??? |
|
jaykay12:
2017-06-18 17:44:04
AC in one Go. :) Use Segmented Sieve Concept with slight Logical change. |
|
chandan pandey:
2017-06-18 13:58:01
@priyanka_2: Use sieve algorithm. |
|
nd_1998:
2017-06-18 13:34:24
why i am getting wrong ans in c ?
|
|
hayatt143:
2017-06-14 09:10:07
can anyone tell me how to see submissions of others? |
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 |