| 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-08-07 14:25:04
I've applied sieve, duration of the program with m=1 n=100001 10 times lasts for 0.56 s for me and I still get time limit exceeded. Any hint? (Python) update: just found out that it's impossible to solve it with Python on SPOJ, always TLE will appear. Same methods in Java or CPP work just fine. [NG]: How does your solution do with L = 999900000, R = 1000000000, 10 times? https://www.spoj.com/ranks/PRIME1/lang=PYTH%203.2.3 Last edit: 2020-08-07 21:51:19 |
||||||||||||||
|
2020-07-30 06:26:05
My Program works flawlessly in NetBeans (JAVA) , still it's showing as WA , please help !! |
||||||||||||||
|
2020-07-24 04:29:17
i am a beginner and i dont even know where to start from |
||||||||||||||
|
2020-07-21 06:50:09
Finaly ! i have managed to write code that works in 0.00 ms. Hint: use faster io in c++. Last edit: 2020-07-21 06:52:00 |
||||||||||||||
|
2020-07-10 16:02:02
I have a error of Standard input is empty what I need to do? |
||||||||||||||
|
2020-07-01 07:11:14
segmented sieve is more interesting than the normal sieve |
||||||||||||||
|
2020-06-27 10:46:30
I got the algorithm but I am getting Run Time Error in Python 3.7. edit: Okay I got it. The hint is that you should sieve it ;) Last edit: 2020-06-27 10:54:06 |
||||||||||||||
|
2020-06-25 15:13:29
it took only 30 sec with very simple approach |
||||||||||||||
|
2020-06-24 22:05:19
Please can anyone can provide me with the solution in c++, as my code always gets TLE(time limit exceeded) error. |
||||||||||||||
|
2020-06-24 21:36:21
With the easiest possible solution for this problem, you can get it passed using C or CPP with slower time complexity, 1 - 3 sec. But I've done it using an algorithm(I'll not tell you, go Google it) and the runtime was 0.01 sec. The most efficient solutions are even less than 0.01s they are effectively less than 0.00s. So don't use simple logic. Go and do some research. Last edit: 2020-06-24 21:38:06 |
||||||||||||||
RSS