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
|
laconic:
2018-02-09 19:25:40
no need of using sieve here
|
|
jonmanu:
2018-02-06 18:14:16
guys ,getting runtime error sigsegv.what to do?
|
|
rogers078:
2018-01-26 16:13:51
sieve divided in segments |
|
rsgilbert:
2018-01-23 14:16:50
Guys what is segmented sieve
|
|
shashankpathak:
2018-01-23 12:22:46
AC finally! use segmented sieve Last edit: 2018-01-23 16:19:22 |
|
hackerboy7862:
2018-01-21 13:26:35
run from 2 upto square root of number while checking for prime Last edit: 2018-01-21 13:27:10 |
|
ptrsn311:
2018-01-21 01:19:18
@hsakiv220290, a prime has exactly two divisors, the number 1 only has 1 (itself) |
|
shubham_chopra:
2018-01-19 20:29:38
use segmented sieve, normal sieve will give TLE |
|
suchismitadhal:
2018-01-19 15:41:20
for TLE no need of Sieve algo., filter the numbers against 2 to the square root of the number. Accepted. |
|
hsakiv220290:
2018-01-17 12:17:05
@manahax, 1 is divisible by 1 and itself. SO it is prime |
| 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