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
surajnobi:
20181103 06:45:39
how I take two or more inputs in single line using scanf ????? Last edit: 20181103 06:46:11 

dev_gupta01:
20181101 13:38:07
for c++ use fast I/O and segmented sieve 

thegravityguy:
20181101 09:21:07
sqrt(n) approach solution is being accepted. And Sieve of Eratosthenes shows TLE. Can anybody explain this? I can clearly understand that Sieve of Eratosthenes will take up more memory but why is it taking up more time than sqrt(n) approach?


aryan_sapra:
20181031 16:20:57
escobar 'Sieve Of Eratosthenes' is a better approach then 'Segmented Sieve' but still it is giving TLE. 

duonglee:
20181031 15:54:58
C++: TLE may be due to the use of the int data type. I use the LL data type and succeed 

ianc1339:
20181027 20:58:41
TLE is the biggest problem for prime number questions... 

kaiwalp:
20181024 16:07:54
ideone show that my code is working properly, while spoj shows TLE. why would be this happenig? 

cyrilcaro:
20181023 14:30:43
i dont know why but my code always get time limit exceded 

escobar:
20181018 15:50:39
If you are traversing from m to n and check every number to be prime or not then complexity will be


maxz_2136:
20181018 07:15:15
getting a time exceed limit may i know why even though i used sqrt(n) for closing condition of for loop 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 