| 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
|
||||||||||||||
|
2019-10-02 05:33:17
Why it writing time limit ? I pass all self test by code it done succesfull I dont understand which test give a wrong answear? i am write fast and stable algoritme to find all prime numbers in diapazone beetween 2 ....10000000/ How can i see failed test? Last edit: 2019-10-04 07:51:09 |
||||||||||||||
|
2019-09-29 07:37:07
@uri_12 I know right, tried it in Python 3, PyPy and C++, and only C++ worked. They really need to adjust their time limits. |
||||||||||||||
|
2019-09-27 14:15:47
no need for segmented seive. |
||||||||||||||
|
2019-09-25 15:12:27
apply segmented sieve algorithm |
||||||||||||||
|
2019-09-17 20:00:48
I'm getting TLE why? |
||||||||||||||
|
2019-09-16 23:08:39
Testing my code in my VS2017 and timing it I always obtain about 15-16 millis. But here I always obtain TLE. What am I doing wrong? Is there any sample of input that could be realistic? |
||||||||||||||
|
2019-09-08 20:51:17
Help my whole code is correct and but spoj declares it wrong. |
||||||||||||||
|
2019-08-31 09:15:30
Use Primality tests for each number in range(m,n). time = O((n-m)*(log(n))^2) Last edit: 2019-08-31 09:16:07 |
||||||||||||||
|
2019-08-25 11:29:01
using SOE algorithm it's giving runtime error while it's running perfectly on ideon Last edit: 2019-08-25 12:04:45 |
||||||||||||||
|
2019-08-22 17:59:48
@adnane27 there are some hidden test cases in the compiler to test your code perfectly, so your code will be lacking the correct answer for complex test cases. |
||||||||||||||
RSS