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
k3rnel:
20191114 17:58:47
this is a very interesting problem....


r0land0:
20191113 07:22:34
Why I got internal error. Please, could somebody help me? 

ashok_shaun:
20191112 12:33:59
dont print extra line for last case!!! 

ummihopes:
20191105 14:03:13
how to resolve a runtime error problem in ideone help me resolve it?


pradeep_2001:
20191105 05:50:00
Last edit: 20191105 05:51:48 

pradeep_2001:
20191105 05:47:16
Last edit: 20191105 05:51:24 

a928384667:
20191103 07:14:57
#include<iostream>


zarif_2002:
20191102 07:34:37
segmented sieve 

the_deadshot12:
20191028 16:30:38
can anyone post the solution for this question??


rb_spoj:
20191020 00:53:56
In Python3 I tried to vary the inputs i.e. 'm' from 100 to 10(5) and 'n' from 10(4) to 10(6) and observed that if m and n are increased further from 10(5) and 10(6) respectively, the number of primes generated remain same in both cases....Could be because range of int is outranged at this juncture, in Py3.

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