| 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
|
||||||||||||||
|
2022-10-26 16:08:50
i used segmented seive..still getting runtime exceeded:( |
||||||||||||||
|
2022-10-02 13:20:16
<snip> i got the output of the code but this editor threw a runtime error [Simes]: Read the footer - Don't post source code here, use the forum. Last edit: 2022-10-02 21:27:19 |
||||||||||||||
|
2022-10-01 09:30:56
To everyone who getting TLE, use segmented sieve |
||||||||||||||
|
2022-09-29 06:00:37
You can solve it , it is easy enough. |
||||||||||||||
|
2022-09-21 17:21:15
what to do in case of m = n = 1 |
||||||||||||||
|
2022-09-21 17:17:37
how to handle the case of m = n |
||||||||||||||
|
2022-09-08 16:29:25
i am unable to solve it. |
||||||||||||||
|
2022-08-09 02:23:19
use segmented seive. |
||||||||||||||
|
2022-08-01 19:23:08
I am getting runtime Error |
||||||||||||||
|
2022-07-18 08:02:20
i have used sieve but gettign wrong answer |
||||||||||||||
RSS