| 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
|
||||||||||||||
|
2015-04-07 21:56:53 Asheesh Pathak
Real Fun... Learnt many new things :) |
||||||||||||||
|
2015-04-04 07:31:51 Nikhil
The "Primality test" is the easiest method of solve this problem. |
||||||||||||||
|
2015-03-30 20:17:22 man
prime generator problem successfully compiled and run on my compiler codeblocks but here it shows time limit exceeded...why?? |
||||||||||||||
|
2015-03-29 18:36:11 im9
I am facing wrong answer although its giving right answers on the cases I have tried |
||||||||||||||
|
2015-03-28 18:09:27 anonymous
I don't understand why my submition doen't pass spoj's test. Here is my code: https://ideone.com/********* Last edit: 2015-03-29 18:30:26 |
||||||||||||||
|
2015-03-28 12:07:01 anup30
0.24 sec. Last edit: 2015-03-28 12:41:49 |
||||||||||||||
|
2015-03-26 06:00:51 dsr
OMG, this is tough... Last edit: 2015-03-26 06:59:00 |
||||||||||||||
|
2015-03-25 04:52:17 ranieri
Well, even though the algorithm takes less than .6s on a modest low power notebook, it seems to take more than 6 seconds to complete at the judge. I will be skipping it as there seems to be some problem with the judge. (Francky) => There's no issue with the judge, just improve your method. I don't think so. It was only possible using PyPy, which compiles JIT, so Python will always be handicapped since it's SLOW. Last edit: 2015-03-25 16:33:49 |
||||||||||||||
|
2015-03-23 17:45:51 Seven.Martinez
first time to submit, it's accepted! :) look at http://en.wikipedia.org/wiki/Primality_test |
||||||||||||||
|
2015-03-16 08:07:47 Utkarsh
No need to implement the sieve algorithm. After 6 WA, changed a bit in the basic approach (optimized it) and got it ACCEPTED . If you need any help mail me at utkarshg******@gmail.com. Language used : C++. (Francky) => If someone need any help, the forum is the well designed place. Last edit: 2015-03-16 09:54:52 |
||||||||||||||
RSS