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
|
Giovanni Botta:
2013-03-13 22:12:29
@Neha: as suggested, it's a segmented sieve, not a full sieve.
|
|
Luthfan Aufar:
2013-03-13 22:12:29
TLE .___. |
|
Vikas:
2013-03-13 22:12:29
I have a question.
|
|
Neha:
2013-03-13 22:12:29
@Giovanni Botta I tried using Erathostenes sieve but the heap runs out of memory.. |
|
|
Neha:
2013-03-13 22:12:29
@ Giovanni Botta : I tried using Erathostenes sieve but the memory of heap is not to save such large numbers. How did you do it? |
|
Daphne Fourier:
2013-03-13 22:12:29
It would be fun using Template Haskell so the calculations are done at compile time :D |
|
|
Giovanni Botta:
2013-03-13 22:12:29
Still getting WA. I have NO idea what's wrong with my code: I tested multiple cases and double checked the results with Matlab. No apparent mistake! |
|
|
Giovanni Botta:
2013-03-13 22:12:29
@Ahmed.Mahmoued
|
|
Ahmed.Mahmoud:
2013-03-13 22:12:29
@Giovanni Botta
|
|
|
Giovanni Botta:
2013-03-13 22:12:29
Getting WA over and over. I'm a little confused about how the output should be formatted. Is this correct?
|
| 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