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
|
imran879:
2015-06-16 11:51:41
my code is running properly on ideone but here it's showingg wrong answer.....!! |
|
ahmed55:
2015-06-15 14:06:45
is c++ what make the problem get time limit exceeded ?? what should i do
|
|
joy_the_coder:
2015-06-15 13:00:09
my code works on ideone.com
|
|
himanshu_tiw:
2015-06-13 12:49:24
getting runtime error again and again, I'm using C. My code is working on other IDE's. Please help. |
|
i_love_inu143:
2015-06-13 03:09:03
should I use DP for shortout of tle ?
|
|
|
i_love_inu143:
2015-06-13 03:07:09
TLE why ? <snip>
|
|
nbisht30:
2015-06-12 15:34:26
what should be the format of the output. Can anyone explain with an example? |
|
|
nbisht30:
2015-06-12 15:23:49
Please help me with the code. Always wrong answer. <snip> Last edit: 2023-05-27 18:15:20 |
|
safari2477:
2015-06-12 13:53:44
Did anyone pass it on Python? |
|
|
nbisht30:
2015-06-12 11:13:14
@admiraldoge I have done it using Sieve, does primality test matter? |
| 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