PRINT  Prime Intervals
In this problem you have to print all primes from given interval.
Input
t  the number of test cases, then t lines follows. [t <= 150]
On each line are written two integers L and U separated by a blank. L  lower bound of interval,
U  upper bound of interval. [2 <= L < U <= 2147483647] [UL <= 1000000].
Output
For each test case output must contain all primes from interval [L; U] in increasing order.
Example
Input:
2 2 10 3 7
Output:
2 3 5 7 3 5 7
hide comments
otoya:
20240128 01:39:22
seg sieve check cp algorithms Last edit: 20240128 01:39:45 

magnesium12:
20230608 18:49:25
very tight time limit, TLE with endl but AC with '\n' 

tripodsan:
20230107 12:56:44
@deepamgupta, I wrote a solution in jsmonkey and the only way to optimise was to output lines at once. i.e. instead of calling print() 1000 times, concatenate the string, and print() only once. this reduced the execution time by about 1 second. 

c7h5n3o6_tnt:
20220523 05:24:12
RE:( It's not wise to use array or vector. 

guru_shreyansh:
20210504 12:52:18
Solved in JAVA in 0.55 secs. With bufferedReader & Segmented Sieve. 

4444:
20210102 12:11:20
Thank You @i_m_chitti 

i_0__0_i:
20201109 06:59:40
@Roman Sol


i_am_chitti:
20200725 15:36:29
Use segmented sieve. Don't use cout and cin.


lone_coderrr:
20200626 11:04:37
Easy peasy! AC in one go, used the idea of segmentation for finding primes in range LR and set the upper bound to the sqrt of INT_MAX!! 

ganjaboi:
20200621 07:25:29
sieve of eratosthenes will work here or not

Added by:  Roman Sol 
Date:  20050328 
Time limit:  1.223s 
Source limit:  15000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ZCon 