| 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
|
||||||||||||||
|
2018-05-16 18:11:38
let m <= i <= n I initially would've looped to check divisibility between 2 and i / 2. Why does 2 and sqrt(i) work? Would it not be less accurate? |
||||||||||||||
|
2018-05-14 20:47:38
http://www.spoj.com/submit/PRIME1/id=21660203 This is my solution..its giving TLE ..please suggest what to do? |
||||||||||||||
|
2018-05-02 22:53:02
I am using segmented sieve with range using c++ stl but getting SIGABRT runtime error can anyone help.The code runs fine on ide. |
||||||||||||||
|
2018-05-01 04:44:00
Hint: You can see that prime numbers always satisfy the 6n+1 and 6n-1 conditions. So you can check a prime number by check if it is divisible by a number which satisfy 6n+1 or 6n-1 ( of course, first you should check if it is less than 6). |
||||||||||||||
|
2018-04-29 03:28:47
Anyone can do this with Sieve of Eratosthenes ? To me it works but gets time limit.I use C++ Last edit: 2018-04-29 03:29:44 |
||||||||||||||
|
2018-04-25 22:55:07 shyaam kumaraselvan
After years :/ 0.32 sec |
||||||||||||||
|
2018-04-16 18:57:42
I'm having TLE. Can anyone help me,please? |
||||||||||||||
|
2018-04-10 15:58:36
What does runtime error NZEC mean? |
||||||||||||||
|
2018-04-09 05:17:35
cobwebs, welcome to SPOJ. While many problems here have idiotic time limits preventing AC with a correct Python solution, this is not one of them. It's a great entry point to this site for a pythonist though, as putting work into AC here will reward you in many other problems. C coders can get away with ridiculous stupidity sometimes as the compiler will straighten it out, we can't; your program *has to* be elegant and efficient. There will be an immense satisfaction in other problems later on when daddy compiler can't help "AC in 1 go" usual suspects while your solution gets a green bar. Got a tad sentimental as it's been almost a year when I came here, an old man trying to relearn things I gave up many years ago. Passed this one with miserable 0.99s after a fierce battle but have taken advantage of this experience in hundreds of other problems. Finally came back a month ago armed with an enlightement I had while brushing my teeth and got my katharsis with a 0.06s. Good luck to every Python enthusiast banging his head against the wall this one problem is, it might just be a begin of a great adventure for you all =) |
||||||||||||||
|
2018-04-08 06:42:02
my python3 algorithm can give the correct answer, but it always exceeds the time. The logic is exactly the same as a friend who coded in C++, but his doesn't exceed. Help. http://benchmarksgame.alioth.debian.org/u64q/compare.php?lang=python3&lang2=gpp ^ this shows the unfairness in timings Last edit: 2018-04-08 07:21:40 |
||||||||||||||
RSS