| 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
|
||||||||||||||
|
2017-03-03 13:38:37
How should I do？My code can only determine the number from 2 to 1000000 |
||||||||||||||
|
2017-03-02 10:17:23
sieve of eratosthenes :D |
||||||||||||||
|
2017-03-01 15:10:45
My code runs perfectly on my laptop. But when i submit my solution on SpOJ, it is giving runtime errors. Everything is perfect in my code. Any clue?? Please Help... |
||||||||||||||
|
2017-02-25 21:02:38
After multiple tries, I finally got an accepted solution for my R code. SPOJ would repeatedly say 'wrong answer' with a time of 5.99 seconds. But it was more a compilation/timing out issue than a bad algo. It took a lot of work to optimize the math approach and code. The accepted code took 5.31 sec to execute. If interested, writeup here: http://discuss.spoj.com/t/prime1-prime-generator-wrong-answer-in-r/21127/1 |
||||||||||||||
|
2017-02-13 13:42:25
Hi guys, I am getting time limit exceeded for my solution in java. But it is running fine on my ide. Please suggest. Below is my solution- [Do not post any source code here] Last edit: 2017-02-14 10:35:10 |
||||||||||||||
|
2017-02-12 18:51:56
is there any chat option on spoj platform ? =(Francky)=> On top banner, you should see "Discuss" : that's a place. There's a link too, in notes, point 3, to the forum (same place). Last edit: 2017-02-12 18:55:49 |
||||||||||||||
|
2017-02-11 23:17:27
simple friend..no use of any sieve....think simply...get AC more simply |
||||||||||||||
|
2017-02-09 20:51:04
bro if you get an error you try and try but don't go through any suggestions unless you are a beginner . it took me two days to do this code for which i was able to think about four totally new algorithms and new ways to percieve things hope you understand this |
||||||||||||||
|
2017-02-06 09:05:13
Time Limit Exceeded Last edit: 2017-02-06 09:05:54 |
||||||||||||||
|
2017-02-05 15:01:53
good one! segmented sieve and AC! |
||||||||||||||
RSS