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|
IT CAN BE IMPLEMENTED USING SEIVE OF ERASTHRONES. I SUGGEST YOU TO GO THROUGH THIS FIRST AND IF YOU FIND DIFFICULTIES YOU CAN SEE THE CODE HERE
pls help me out
My code is working fine on my pc but here I am getting wrong answer and following error:
Why I get everytime a timeout error?
This was a tough one. I used PHP. You should look into the Miller-Rabin method. And check to see if there is a native implementation of it.
Can any one help? What to do.... Time limit exceed
Omg .. Time limit exeed .. What is this ... ?? 5 time
AC in first go, 0.00 :)
take uint variable
Works correctly here but I still keep getting a NZEC, can anyone help? http://ideone.com/4McRBf