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
|
thananhthien:
2019-07-03 11:54:56
Search MaxNumber, then Eratosthenes |
|
ing3ns:
2019-06-29 19:04:52
use aks
|
|
letschange:
2019-06-28 11:50:59
We just have to eliminate redundant calculations from the standard way of checking the same.
|
|
scolar_fuad:
2019-06-24 18:22:50
finally i solved it using segmented seive ....All the best for every one
|
|
dexu5:
2019-06-24 15:42:14
Wanted to understand what is the issue with my solution ? Any help is appreciated. Link : <snip> Last edit: 2023-05-27 17:55:54 |
|
debartha_007:
2019-06-24 07:22:52
Everytime...its saying time limit exceeded though my program is only 32 lines |
|
aarohan2kv:
2019-06-24 06:18:49
Use Sieve of Eratosthenes |
|
nananaw1:
2019-06-23 23:22:37
hate how i compile my code on my ide and it works but always getting error for this site
|
|
saurav_03:
2019-06-18 22:00:20
good problem for understanding segmented sieve. |
|
stocke777:
2019-06-18 20:23:48
horrible site, cant submit shit, no program ever seems to work, total time waste
|
| 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