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
karthik_77:
20170724 11:54:46
I am getting a timeexceeded error. How should I go about it?


rambosek:
20170723 14:38:20
pastebin.com/5z58hpWF > Python code


shreyansh96:
20170718 18:19:14
Why am i getting SIGSEV?


jangir_1:
20170718 17:22:01
Last edit: 20170725 13:55:28 

skyzhi:
20170716 07:19:43
AC in 0.00sec happy ? 

win2009:
20170716 04:01:12
Proof of my theory above/below: look at jhaanuj2108's code. It is terrible, but it uses a square root trick. He succeeded. almost NO optimizations and he still passed. Use the square root trick. Last edit: 20170716 04:15:36 

win2009:
20170716 03:59:17
The trick is to use the square root trick when considering factors. Sieve or no sieve does not matter. Just use the square root trick and you will be fine. Also, optimize your code. You do not have to handle the worst case scenario ( 999900000 1000000000), at least that was the case for me. 

jhaanuj2108:
20170715 23:00:34


pyrojathon:
20170714 12:09:31
Last edit: 20170714 12:18:27 

gabe3491:
20170712 12:33:39
seriously a single line mistake ruined my day..

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