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
execusioner:
20210224 04:08:45
i love you


mohsehga:
20210223 18:00:21
What should be the output if there is not prime number possible between the the range for example : 25 27 ?? 

kanhabindal:
20210216 17:53:24
test cases are weak solved it without using sieve 

vishal_0303:
20210118 15:28:25
odd loop+flag +2 loops 

aarindey:
20210112 17:01:59
<snip>


yatharth08:
20210103 19:17:09
brute force works but segmented sieve gives tle


yatharth08:
20210103 19:02:49
Sieve will give a runtime error because the array size(n>10^9) is too large to be stored in ram use segmented sieve 

easeen56:
20201225 11:57:51
I thought this is a easy problem but....when i saw sieve algo....then i am start crying 

tutturushi:
20201218 17:10:39
Test cases are definitely weak. I got away with ~7s processing for some cases. 

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