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
dtosidis:
20201005 02:01:20
That was awsome! Last edit: 20201006 21:20:37 

kya_bantai:
20201004 06:10:37
segmented seive


maxcool:
20200930 14:05:25
Where to find its solution


grazier_shahid:
20200930 07:29:40
how much time limit and memory limit? 

brofistaman:
20200927 21:24:37
says time limit exceeded 

cang:
20200923 20:52:15
It keeps saying runtime error even though it seems to work perfectly fine whenever I compile it myself with the g++ compiler. Not sure how to fix this. 

dip707:
20200916 10:38:08
its showing wrong answer but it works correctly on ideone for JAVA Last edit: 20200916 10:38:23 

yogeshk_108:
20200914 10:00:08
better if you use segmented seive without pregenerate all prime numbers upto sqrt(R); 

prakharrai:
20200912 20:07:38
To anyone who reads , normal n^2 approach (2 loops) or sieve of erothnes wont work! Try something else


appuk:
20200909 18:10:27
Getting a tle when using sieve...

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