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
|
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 ... |
|
Jure Ratkoviæ:
2013-03-13 22:12:29
@Prakash kumar
|
|
Prakash kumar:
2013-03-13 22:12:29
I am new joined here any budy help me. |
|
Uday Shankar:
2013-03-13 22:12:29
For each number n there is some other number 'x' which is less than n.If you check until that number 'x' it is enough
|
|
Aakash Srivastava:
2013-03-13 22:12:29
@uday...then what do you suggest,i`ve run out of options,plz help Last edit: 2011-09-22 05:20:30 |
|
|
Uday Shankar:
2013-03-13 22:12:29
@Aakash
|
|
|
Aakash Srivastava:
2013-03-13 22:12:29
time limit exceeded,i have already removed the even numbers from being checked,and when checking for divisibility for a number,m checking uptil half that number,excludind the even numbers
|
|
Mr.[T]:
2013-03-13 22:12:29
my program runs good on gcc but on spoj it gives runtime error(SIGSEGV)...any suggestions? |
| 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