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
soumya_dip:
20170329 08:23:21
why I am getting time limit exceeded? 

anurag_tangri:
20170328 14:26:19
my 50th:) 

asvs_kartheek:
20170323 11:36:39
My code is running good in ideone but here it is showing time limit exceeded 

amandal799:
20170322 13:16:08
keep track of prime numbers up to sqrt(1e9) and apply sieve simply


abidzz178:
20170321 14:35:05
what things do i need to keep in mind to save myself getting run time error ? 

mhto:
20170317 19:39:55
finally.. after 9 attempts :D 

mosta7il_:
20170315 15:30:08
an easy AC 

nitisha1:
20170315 01:45:45
After so much try........... Finally AC!!! 

tekfyl:
20170311 14:51:59


sunny:
20170308 13:57:30
Use sieve .simple :). 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 