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
mycode_123:
20160623 13:41:35
use segmented sieve,,,,and u wil AC it!!!


octav:
20160619 15:19:33
I've read a lot of comments here that are pure nonsense.


ishaandhamija:
20160619 14:15:55
Segmentation Fault .... even after declaring an array of 10000000 indexes .... Why ?? 

dronaa:
20160618 18:48:58
can someone explain this program to me??? 

poojaha:
20160618 09:05:10
My code is working good oni deaone as well as loacally even though its giving wrong answer ? 

ab_bh:
20160618 06:48:48
using sieve and still nzec


zimspoj:
20160617 22:06:40
using devc++ ide on which compilation time is coming around 1.40s then also on submission showing TIME LIMIT EXCEEDED error 

mychemromance:
20160617 16:26:53
I've tried it many times, made my code more efficient, yet the time limit is exceeded! 

vaibhavahuja:
20160616 03:20:23
yeah, time limit exceeded. come on? 

mychemromance:
20160613 16:17:58
Time limit exceeds all the time!

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