| 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-09-02 14:20:02
https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes |
||||||||||||||
|
2017-08-27 18:31:17
my code is right but it shows time limit exceeds. How can I resolve this problem ? anyone please ? ? ? Last edit: 2017-08-27 18:31:37 |
||||||||||||||
|
2017-08-18 16:55:29
my fifty |
||||||||||||||
|
2017-08-18 15:24:32
just run the loop till sqrt(n) values the judge will accept your solution |
||||||||||||||
|
2017-07-27 21:19:52
TLE pls tell me the best way for it ->python |
||||||||||||||
|
2017-07-24 11:54:46
I am getting a time-exceeded error. How should I go about it? |
||||||||||||||
|
2017-07-23 14:38:20
<snip> -> Python code Can someone explain me why it doesn't work? (TLE) There are any other faster solutions to check if number is prime? Thanks for help ;) Last edit: 2023-05-27 18:02:43 |
||||||||||||||
|
2017-07-18 18:19:14
Why am i getting SIGSEV? |
||||||||||||||
|
2017-07-16 07:19:43
AC in 0.00sec happy ? |
||||||||||||||
|
2017-07-16 04:01:12
Proof of my theory above/below: look at jhaanuj2108's code. It is terrible, but it uses a square root trick. He succeeded. almost NO optimizations and he still passed. Use the square root trick. Last edit: 2017-07-16 04:15:36 |
||||||||||||||
RSS