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
elliotto:
20180214 01:47:46
deleted by me =) Last edit: 20180214 02:15:30 

ltt_krzaq:
20180212 23:28:35
ARH.... my (C++) code works perfectly fine, but i get 'wrong answer' all the time.... this sucks if you don't get any advice why it's wrong if it works..... :/


nikhil_jsk:
20180212 13:32:02
I've used 2 to sqrt(number) to solve the problem.Solution is accepted but the time is over 1 sec(1.15). How do I reduce the compilation time. BTW I've used C++ to code. 

ducluong:
20180210 14:23:56
Last edit: 20180210 14:24:05 

laconic:
20180209 19:25:40
no need of using sieve here


jonmanu:
20180206 18:14:16
guys ,getting runtime error sigsegv.what to do?


rogers078:
20180126 16:13:51
sieve divided in segments 

rsgilbert:
20180123 14:16:50
Guys what is segmented sieve


shashankpathak:
20180123 12:22:46
AC finally! use segmented sieve Last edit: 20180123 16:19:22 

hackerboy7862:
20180121 13:26:35
run from 2 upto square root of number while checking for prime Last edit: 20180121 13:27:10 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 