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
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 

nmirandaghn:
20170927 10:57:24
What are the test cases of this puzzle? 

anonymousamigo:
20170925 12:01:42
use dynamic programming.


bhoopeshkanna:
20170922 07:39:01
Even I am getting Time limit exceeded, I am using java.... but when I check the system execution time coding wise my execution time is 0 secs... any one help please!!!! Last edit: 20170922 07:39:26 

adi29raj:
20170919 20:49:15
finally ,,done,,0.90s for c++ 

bballer09:
20170908 17:57:32
You all could try and use sieve of eranthoses in case of encountring tle 

bquinn6:
20170907 21:07:36
I cant use modulus to find prime numbers? never heard of using square root to find prime Last edit: 20170907 21:07:48 

snipecoder1:
20170902 20:21:39
Guys edit code with sqrt(n) instead of n/2...it will work...in C or C++


albino_spoj:
20170902 14:20:02
https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 