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|
Time limit issues in Python.
@dr_strange - Yes, i did it using a simple property of prime numbers.
this is very hard in Scala... What about time limits BY language?
what is NZEC? could any one help me out..n also what is MEM under analysis give fr our submission
Finally done it.
is there a way to do it without sieve
showing segmentation error .how to remove. pls someone help me.
my code shows correct output on ideone but here it shows wrong answer
I took an array of a[n] but it says a is too large . what should i do ?
Sheikh Ashiqul Islam:
This problem can be solved very easily without even using sieve :D