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!
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.
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.
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)
InformationAfter cluster change, please consider PRINT as a more challenging problem.
|Added by:||Adam Dzedzej|
|Cluster:||Cube (Intel Pentium G860 3GHz)|
|Languages:||All except: NODEJS PERL 6 SCM chicken|
primality test is the learning factor in this question
NZEC in java help me
Real Fun... Learnt many new things :)
The "Primality test" is the easiest method of solve this problem.
prime generator problem successfully compiled and run on my compiler codeblocks but here it shows time limit exceeded...why??
I am facing wrong answer although its giving right answers on the cases I have tried
I don't understand why my submition doen't pass spoj's test.
0.24 sec.Last edit: 2015-03-28 12:41:49
OMG, this is tough...Last edit: 2015-03-26 06:59:00
Well, even though the algorithm takes less than .6s on a modest low power notebook, it seems to take more than 6 seconds to complete at the judge. I will be skipping it as there seems to be some problem with the judge.