| 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-05-05 21:32:42
I got tle error when i use sieveof eratosthenes |
||||||||||||||
|
2020-04-30 09:14:13
you can use segmented sieve to solve this problem complexity of this is around max (root(n) , n-m)) * loglogn which is always less than o(n) for this problem Idea is first generate all prime from 1 to root(n) and store that in a list and then check prime for number between range m to n using same like sieve |
||||||||||||||
|
2020-04-28 04:03:06
Even with somewhat optimized algorithm (restrict scan to 6k+-1 and primes up to sqrt(n)) it's not possible to avoid timeout in python! That's OK for a challenge but not for a introductory problem. |
||||||||||||||
|
2020-04-18 15:41:16
sqrt is enough , add 6k+1/6k-1 logic if needed. Last edit: 2020-04-18 15:47:43 |
||||||||||||||
|
2020-04-13 14:48:06
Guys, just use the sqrt and 6k+1 & 6k-1 method and ur solution will be accepted..not need to use the sieve method..All The Best!! |
||||||||||||||
|
2020-04-12 18:40:46
I am very confused now. I tried doing a brute force prime checker (using sqrt of number and looping through), O(loglogn) sieve, and an O(n) sieve and I still get TLE using PYTHON3. |
||||||||||||||
|
2020-04-11 17:51:09 nra
"time limit exceeded" every time I run it :( though it runs fine in my machine! any pointers? PS: I am using the sqrt method already! Last edit: 2020-04-11 18:40:36 |
||||||||||||||
|
2020-04-09 07:33:11
@shruthi123 use long int for such case |
||||||||||||||
|
2020-04-08 19:12:53
I tried this problem with sieve, but it doesn't seem to work in this case. Can anyone tell me why that's the case? But just writing an isPrime function that simply loops till the square root of n works. Why is that so? |
||||||||||||||
|
2020-04-08 12:12:32
One punch AC :)) |
||||||||||||||
RSS