| 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
|
||||||||||||||
|
2016-07-20 20:40:45 Shidhu
unbelievable !!!! Solved at 0.01s by Segmented Sieve :) |
||||||||||||||
|
2016-07-18 23:19:42
Use segmented sieve, as said by the comments.. but documents on the net may not tell it easily, so you have to understand and implement it yourself. It took me for 2 days (about 10 hours) to understand it. |
||||||||||||||
|
2016-07-13 08:53:35
Very nice question, first learnt sieve, Runtime Error. Then converted into segmented sieve, AC. :) |
||||||||||||||
|
2016-07-12 08:27:49
I used Rabin–Miller primality test for solving this question in python |
||||||||||||||
|
2016-07-04 12:59:25 Sumant Mann
anybody solved this question in python? |
||||||||||||||
|
2016-06-29 23:51:45
Use Segmented Sieve of Eratosthenes |
||||||||||||||
|
2016-06-27 18:49:06
thangaram:: You just use sqrt or log inloops that reduces the loop iteration greatly |
||||||||||||||
|
2016-06-27 15:07:47 thangaram
it shows TIME LIMIT EXCEEDED even though it runs at less than 6s in ideone.com for larger intervals. |
||||||||||||||
|
2016-06-26 05:07:58
ain't time limit too long for such a short algorithm? i think for most computers it should work within fraction of seconds. |
||||||||||||||
|
2016-06-23 13:41:35
use segmented sieve,,,,and u wil AC it!!! |
||||||||||||||
RSS