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
@ Michael T.: thanks! will look into that.
|
|
Vitor Santos:
2013-03-13 22:12:29
I have a TLE problem, but the output is correct.. Any help? :S |
|
vinay:
2013-03-13 22:12:29
i am getting a NZEC error.someone please help me handle it.!
|
|
arifian rahardianda:
2013-03-13 22:12:29
oh boy, this problem really frustrates me all day. even though the input and the output is correct. they take it as a wrong answer -______-. any idea guys?. oh, i use c for this problem, and i am a "noob", so i can't figure it out how to apply the sieve alg. Last edit: 2011-10-27 18:53:27 |
|
VIKAS SHARAN:
2013-03-13 22:12:29
number greater than 10 it should not divisible by 2,3,5 and 7;
|
|
Loki:
2013-03-13 22:12:29
Yes indeed! It is a segmented sieve |
|
|
Loki:
2013-03-13 22:12:29
This is a long long program. Last edit: 2011-10-23 20:04:05 |
|
rector george:
2013-03-13 22:12:29
my program receives runtime error(SIGSEGV) even though it runs just fine on my computer(i did it in c using the sieve of eratosthenes with some adjustments),i cannot make a char vector of lenght the upper bond... any ideas... Last edit: 2011-10-04 12:01:51 |
|
:D:
2013-03-13 22:12:29
You should use "sieve of eratosthenes" all the way in your algo. Also how many times are you doing the "find all prime numbers up to root of n". And how many do you actually need? |
|
Alejandro:
2013-03-13 22:12:29
please put some data sets, and I uploaded many solutions and TLE .... I did the following: find all prime numbers up to root of n, and then compare the results when the range is greater than 1000000 ... |
| 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