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
arpan_jain_946:
20160924 13:50:50
Can anyone tell me how i can get correct code for this problem??


tushar_018:
20160909 15:13:17
my code runs on ideone with time:0.06 but here ir shows time limit exceeded ?? 

onursurme:
20160908 00:54:12
my code runs on ideone withe success, but gives runtime error here. 

mrinal_007:
20160907 08:33:22
If i use sieve it shows segmentation error ? how to encounter this ?


avishek_arora:
20160904 19:50:03
can i use segmented SOE if input is small or it is only applicable on large inputs. 

devanshu95:
20160831 15:28:14
how are you all storing the result.?


ashish16iitr:
20160829 19:58:58
whats the time limit for this question?


hush01:
20160824 21:07:03
this is tough! Last edit: 20160824 21:14:30 

k_dhingra2013:
20160824 08:55:43
did it using sieve in just 0.01 seconds 

hashem sllat:
20160818 12:49:16
binary search + sieve 0.24s 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL 6 