| 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-07-16 03:59:17
The trick is to use the square root trick when considering factors. Sieve or no sieve does not matter. Just use the square root trick and you will be fine. Also, optimize your code. You do not have to handle the worst case scenario ( 999900000 1000000000), at least that was the case for me. |
||||||||||||||
|
2017-07-12 12:33:39
seriously a single line mistake ruined my day.. use segmented sieve.. Last edit: 2017-07-12 13:24:02 |
||||||||||||||
|
2017-07-04 10:26:14
can anyone explain the code please |
||||||||||||||
|
2017-07-02 17:30:07
MY code is working fine in my system in language c++ but here it shows time limit exceeded although i have tried it many times please help!! |
||||||||||||||
|
2017-07-01 16:59:22
I KEEP GETTING SEGMENTATION ERROR EVEN THOUGH IT WORKS PERFECTLY FINE ON ideone, codeforces and codechef here is the link https://www.codechef.com/ide Last edit: 2017-07-01 17:08:55 |
||||||||||||||
|
2017-07-01 04:54:39
those getting TLE use segmented sieve with bool array. AC in 0.00 sec |
||||||||||||||
|
2017-06-28 09:08:10
please provide a proper solution of TLE |
||||||||||||||
|
2017-06-25 12:55:46
my code is working fine on codechef ide but here its showing time limit exceeded |
||||||||||||||
|
2017-06-22 05:22:34
where i can see my submitted answer? |
||||||||||||||
|
2017-06-21 06:30:53
For each of the number in the range, 1) find if it is prime or not (iterate till square root of number). 2) use sieve to cancel all its multiples within given range |
||||||||||||||
RSS