| Submit | All submissions | Best solutions | Back to list |
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.| 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 |
hide comments
|
||||||||||||||
|
2018-09-03 15:59:11
Description says "between", however the second sample test case contradicts this. |
||||||||||||||
|
2018-08-31 23:42:40
guys i am getting runtime error Exception in thread "main" java.lang.NumberFormatException: null is anyone else is also getting this |
||||||||||||||
|
2018-08-29 20:13:52
time limit exceeded.. means? |
||||||||||||||
|
2018-08-26 20:50:26
The classical O(n2) solution gets accepted but segmented sieve shows TLE.. How is it even possible? |
||||||||||||||
|
2018-08-26 12:57:28
why isn't sieve working?? |
||||||||||||||
|
2018-08-24 21:45:13
Guys this is not a fair problem of checking the optimal solution!! |
||||||||||||||
|
2018-08-19 17:19:41
even with sieve if i use cout for output time limit exceeded |
||||||||||||||
|
2018-08-17 10:53:28
guys always check for 1. it should not suppose to be printed and use square n method |
||||||||||||||
|
2018-08-12 20:17:00
Guys check for 1. I spent a ton of time only to find 1 was showing up as prime. And use sqrt(). |
||||||||||||||
|
2018-08-06 12:15:23
use normal method no need to use sieve or segmented |
||||||||||||||
RSS