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, nm<=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
the_nine_tail:
20200409 07:33:11
@shruthi123 use long int for such case 

trulyness:
20200408 19:12:53
I tried this problem with sieve, but it doesn't seem to work in this case. Can anyone tell me why that's the case? But just writing an isPrime function that simply loops till the square root of n works. Why is that so? 

sang611:
20200408 12:12:32
One punch AC :)) 

anand_yadav1:
20200406 12:11:27
Don't getting why the f*** this is giving me wring answer. Done everything right, I'm 100% sure. 

soni_p:
20200405 16:25:02
I am getting correct o/p in ideone, but it's showing wrong answer here, can someone explain why? 

shruthi123:
20200331 17:28:49
Can any one explain me how to print the inputs m and n with this condition (1 <= m <= n <= 1000000000, nm<=100000) . I am writing the code in c++, and I am not knowing how to give the inputs. 

anshbhatti:
20200330 04:29:08
I am getting a TLE (Time Limit Exceeded) when the code works in my IDE. My code is simply looping through square root of each number to check if it's prime. Last edit: 20200330 04:29:49 

ali_a:
20200327 12:49:11
use trial division method. Run the loop till sqrt of n. No need to use any kind of Sieves for this simple problem. 

supriya9:
20200326 06:21:19
when i am running my code in other IDE... my code is correct and giving the correct output but when i submit it here it is displaying time limit exceeded .


shammya:
20200325 17:42:39
i used Fermat's primality test algorithm which takes O(k*log(n)) to check whether a number is prime or not.

Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 