| 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-02-08 20:13:51
Getting SIGSEGV error.....but works fine on any compiler including ideone |
||||||||||||||
|
2016-02-06 07:09:51
where am i rong when i am writting prime generator program on gcc then it is ok but when i am writting on spoj then time limit exceeded shown plz help me |
||||||||||||||
|
2016-02-01 19:16:50
a silly mistake got me 2 WA... a nice problem.... |
||||||||||||||
|
2016-01-31 12:27:00
how i can show the output of my wrong submission |
||||||||||||||
|
2016-01-31 08:33:38
What does for every test case means |
||||||||||||||
|
2016-01-29 09:23:06
is there any chance to see where and what "wrong answer" appears? |
||||||||||||||
|
2016-01-23 14:33:10
getting sigsegv again and again but code workking fine with ideone |
||||||||||||||
|
2016-01-18 19:31:33 Manishi Goel
Did not use segmented sieve ;) |
||||||||||||||
|
2016-01-17 09:09:11
I'm implementing sieve in Python 2.7. However, I get TLE, which I believe is due to the fact that I create a second list from 2 to the first number and then delete find multiples of the numbers in the new list and delete the occurrences of those multiples in the actual list. Is there a faster way for me to do this? Last edit: 2016-01-17 09:40:21 |
||||||||||||||
|
2016-01-17 07:24:45 Kumud Khandelwal
there is no need to use sieve this is a very easy question, also very irritating. use simple method. |
||||||||||||||
RSS