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
|
ss:
2013-03-13 22:12:29
what is wrong with my code ,,,,,, <snip>
|
|
andy:
2013-03-13 22:12:29
Can anyone help to check what's wrong with my code? <snip>
|
|
Diego Paradeda:
2013-03-13 22:12:29
TLE in C.. can someone help me?? |
|
Udit Bansal:
2013-03-13 22:12:29
TLE!!!
|
|
kv2253:
2013-03-13 22:12:29
nice prob sufficient to teach how to handle big integer
|
|
Bharat Jain:
2013-03-13 22:12:29
after last output is there any space or new line ?? |
|
Sanjith Kanagavel:
2013-03-13 22:12:29
time limit problm some1 can help me??? |
|
Aritra Chatterjee:
2013-03-13 22:12:29
This problem initially game me loads of probs, but later after optimizing the code, I was able to pull it off.... |
|
Piotr:
2013-03-13 22:12:29
TLE ... ideo all ok |
|
Rohit Retnakaran:
2013-03-13 22:12:29
Works fine in ideone but why TLE?????
|
| 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