| 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
|
||||||||||||||
|
2019-12-17 14:50:21
use sieve of eratosthenes for solving this problem |
||||||||||||||
|
2019-12-13 12:45:09
i got tle but the ideone gives correct output and in 0.11s |
||||||||||||||
|
2019-12-05 21:31:06
i have got time limit exceeded!! |
||||||||||||||
|
2019-12-04 01:11:56
Please help i got TLE over and over, what shoud i do? |
||||||||||||||
|
2019-12-03 11:43:56
use sieve of eratosthenes algorithm |
||||||||||||||
|
2019-12-02 16:05:43
Getting time limit exceeded |
||||||||||||||
|
2019-12-02 08:31:36
Getting TLE again!!! Does simple sieve work? |
||||||||||||||
|
2019-12-01 04:45:33
You arent supposed to use a brute force approach but rather something like segmented sieve or sieve of atkin. |
||||||||||||||
|
2019-11-28 17:02:58
i have got time limit exceeded?? |
||||||||||||||
|
2019-11-18 16:47:33
i am getting time limit exceeded plz help!!!! |
||||||||||||||
RSS