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.hide comments
|
akhileshsoni96:
2017-01-01 10:30:42
Hint:Use segmented sieve for this
|
|
anouriel:
2016-12-31 21:42:33
|
|
mitch97:
2016-12-29 21:49:57
Time limit exceeded, what am I supposed to do now ? |
|
shreeshiv:
2016-12-26 10:58:56
in which way we have to take input ?
|
|
zealsham:
2016-12-25 23:46:47
i dont really get the input logic |
|
erkbai_kubatov:
2016-12-24 12:02:02
i have the same problem |
|
silentserpent:
2016-12-23 12:45:56
I am getting run time error, SIGABRT! I don't know what that is! |
|
rohit9934:
2016-12-15 18:36:23
how to know in which line error is occured if it shows compilation error
|
|
code0monkey1:
2016-12-11 15:55:09
can be done by the naive (find factors till sqrt(n) ) method ... but it's better to learn the segmented sieve to optimize it Last edit: 2016-12-11 15:56:05 |
|
mckay93:
2016-12-04 15:21:42
if (time limit exceeded) your program is running not enough fast. test your program with max possible values
|
| 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 |
RSS