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
|
Krishan Kumar Tripathi:
2013-03-13 22:12:29
can any one tell me that is the Time limit given in task for compile time ? |
|
Ankur Ahuja:
2013-03-13 22:12:29
Hi, my id is 8686693, please see if you can tell me why I am getting WA everytime. |
|
Moriarty:
2013-03-13 22:12:29
@prabhat pandey. Which runtime error? There are several. If it is the SIGSEV, it's probably because you are accessing memory illegally e.g. array index out of bounds. |
|
prabhat pandey:
2013-03-13 22:12:29
my code is working properly when i compile it in cygwin which is using gcc compiler but when i submit the answer it gives me runtime error .any help will be appreciated |
|
Dheeraj Tak:
2013-03-13 22:12:29
my solution is working but here it is exceeding time...so how to see best submitted solutions
|
|
Bychutkin Aleksey:
2013-03-13 22:12:29
for sqrt() in C just use C++ compiler,should work) |
|
Francky:
2013-03-13 22:12:29
@pratul : You can include math.h, and then use sqrt in C, there is no problem with that. |
|
Srividhya:
2013-03-13 22:12:29
My id is 8651035... it dint show any compilation error for me..But the result is compilation error.. Can anyone say y..??? Last edit: 2013-02-04 05:29:03 |
|
spiderweb:
2013-03-13 22:12:29
my prgrm is taking only last pair of m and n to execute the function t no. of times... tell me some way to work it out |
|
S:
2013-03-13 22:12:29
@Nikhil Bhandari: n^2 is the obvious 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 |
RSS