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
joe_erwaa:
20180908 18:35:18
would anyone please tell me what sieve is? i'm new for SPOJ 

noob_101:
20180907 20:07:10
finally got the solution in python 

aj_254:
20180904 19:38:18
finally got AC!! after 23 TLE.same logic of python works in c++ and in python its tle . 

anant6025:
20180903 22:19:53
I tried Sieve of Eratosthenes>TLE


contrevien:
20180903 15:59:11
Description says "between", however the second sample test case contradicts this. 

dragost_305:
20180831 23:42:40
guys i am getting runtime error


mittalyash:
20180829 20:13:52
time limit exceeded.. means? 

rajiv2605:
20180826 20:50:26
The classical O(n2) solution gets accepted but segmented sieve shows TLE.. How is it even possible? 

p_vishnu:
20180826 12:57:28
why isn't sieve working?? 

ani1107:
20180824 21:45:13
Guys this is not a fair problem of checking the optimal solution!! 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 