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
rashmit:
20171030 09:22:27
tle is there for more than 20000


kegoru:
20171030 03:18:33
done in 0.01s in C++ 

kotal_kahn1:
20171025 20:06:11
did it using java , but same code in python shows time limit exceeded


evilspirit:
20171022 09:18:13
0.12s


luckytuvshee:
20171015 02:17:42
Hi all. Please show me the source code? What is prime generator :) Help 

jgaurav6:
20171011 21:17:42
getting nzec error in java even with correct output :( 

prasadjoshi:
20171004 09:33:17
finally done in 0.58s in C++ 

mani_kasera:
20170930 07:18:31
No need of advanced algorithm, just check if every no. in between, m and n is prime or not by running a loop from 2 to square root of that number. It will definitely work in c++. Last edit: 20170930 07:20:53 

slothse7en:
20170929 10:00:43
nhật hào sạch 

killercode:
20170928 19:41:03
using sieve of eratosthenes in python 3, still time limit exceeded wtf 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 