| 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
|
||||||||||||||
|
2020-04-06 12:11:27
Don't getting why the f*** this is giving me wring answer. Done everything right, I'm 100% sure. |
||||||||||||||
|
2020-04-05 16:25:02
I am getting correct o/p in ideone, but it's showing wrong answer here, can someone explain why? |
||||||||||||||
|
2020-03-31 17:28:49
Can any one explain me how to print the inputs m and n with this condition (1 <= m <= n <= 1000000000, n-m<=100000) . I am writing the code in c++, and I am not knowing how to give the inputs. |
||||||||||||||
|
2020-03-30 04:29:08
I am getting a TLE (Time Limit Exceeded) when the code works in my IDE. My code is simply looping through square root of each number to check if it's prime. Last edit: 2020-03-30 04:29:49 |
||||||||||||||
|
2020-03-27 12:49:11
use trial division method. Run the loop till sqrt of n. No need to use any kind of Sieves for this simple problem. |
||||||||||||||
|
2020-03-26 06:21:19
when i am running my code in other IDE... my code is correct and giving the correct output but when i submit it here it is displaying time limit exceeded . someone please help me out of this? |
||||||||||||||
|
2020-03-25 17:42:39
i used Fermat's primality test algorithm which takes O(k*log(n)) to check whether a number is prime or not. i took k = 20 and got AC with .56 sec. just iterate from m to n and check whether the number is prime or not . time complexity O(n*logn). hope it helps : ) Last edit: 2020-03-25 17:42:59 |
||||||||||||||
|
2020-03-25 14:07:25
Do we have an editorial section on spoj |
||||||||||||||
|
2020-03-22 22:15:05
AS SOON AS THE VALUE OF COUNTER IS MORE THAN 1,COME OUT OF LOOP,AC IN ONE GO....THANK ME LATER Last edit: 2020-03-22 22:15:34 |
||||||||||||||
|
2020-03-21 06:19:34
using the usual prime number code with square root will give u the answer. |
||||||||||||||
RSS