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
krishp:
20200524 21:51:28
.17 seconds PYTHON3


krishp:
20200524 19:13:05
Use segmented sieve to find primes within a range. Works with python. If still TLE, make sure you are using stdin/stdout. 

shivam05_spoj:
20200521 21:39:31
Can someone bring me any idea how to optimize the solution for the question as i have already done it in python3 but time limit exceeded. 

md__talha__007:
20200518 12:54:35
AC in one go!


austino92:
20200515 16:41:59
should i get all the inputs before processing? 

dassatyaki:
20200514 08:39:51
No need of sieve....run from 2 to square root and check if n is 1


aman905:
20200513 19:16:13
Last edit: 20200513 19:16:59 

summerbleach:
20200512 11:22:06
The Osqrt(N) approach took 3.63 sec 

sabat_raj3:
20200510 21:50:56
Hey!no need for any complex logic. Use simple logic to traverse from m to n and then check from 2 to root(m) with two loops and it will be accepted. runtime o(nroot(n)). 

subratdev:
20200509 20:20:49
Since the range difference is 10^5,we need not create a historical array to save result from 1  N (MAX  10^9)

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