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
|
smriti195:
2019-03-17 12:54:40
it works fine at ideone but here on spoj it shows runtime error...what to do?
|
|
rahul11197:
2019-03-15 12:43:48
ac in one go :)
|
|
cipher135:
2019-03-14 09:35:01
For primality test, run the loop up to sqrt(n)(i.e; i=2; and i<=sqrt(n)). and if i divides n, break the loop, because n is not a prime now. if the loop runs completely then n is prime. |
|
phoenix2021:
2019-03-12 14:36:18
Last edit: 2019-03-18 18:07:26 |
|
tenick:
2019-03-08 17:57:09
dang i got tle even though it works.. Last edit: 2019-03-08 18:11:05 |
|
the_best07:
2019-03-08 13:47:23
i used sqrt still its showing compilation error |
|
Max:
2019-02-27 15:30:10
My code submission result was 0.02s in Ideone.com, but here dont works. |
|
balasarius:
2019-02-16 23:24:56
OK confused I ran my Python3 solution on ideone and it works as expected in 0.01s but I run it on spoj and it times out, whats going on. I even set a break for the last setup of values in the stdin to get out of the "for i in sys.stdin:" loop to ensure the loop didn't cause it to hang, but still I get a timeout. I'm missing something here |
|
sam28:
2019-02-16 17:06:55
T*(n-m)*log(n) using miller-rabin gets TLE ?? lol weird Last edit: 2019-02-16 17:07:36 |
|
aksr27:
2019-02-12 18:20:08
Don't use seive algo just simply use sqrt(n) complexity prime check on each number. |
| 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