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!


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, n-m<=100000) separated by a space.


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.


1 10
3 5


Warning: large Input/Output data, be careful with certain languages (though most should be OK if the algorithm is well designed)


After cluster change, please consider PRINT as a more challenging problem.

hide comments
free__bird: 2017-01-12 11:26:22

don't use the exact segmented sieve, read the segmented sieve and use your brain a bit, and you will get ac ,one more advise take long long ,chances of overflow

triplejay2013: 2017-01-11 21:55:05

The program works as intended on my device. But I get 'time limit exceeded' when I submit my solution. I am not sure what that means, or what I can do to change that.

adityaviki: 2017-01-11 04:59:44

i am using segmented sieve method and still getting time limit exceeding error

jmrt666: 2017-01-11 02:31:10

no ce ase kon kriba zolo rekorran dhe M asta N i inpriman loz k son prrimos kon 1 mtodo k sea optico pra dtrminar zi 1 numro ez primo :)

akhileshsoni96: 2017-01-01 10:30:42

Hint:Use segmented sieve for this

anouriel: 2016-12-31 21:42:33

why limit exceed?

Last edit: 2016-12-31 21:47:40
mitch97: 2016-12-29 21:49:57

Time limit exceeded, what am I supposed to do now ?

shreeshiv: 2016-12-26 10:58:56

in which way we have to take input ?
first "m" or "n".

zealsham: 2016-12-25 23:46:47

i dont really get the input logic

erkbai_kubatov: 2016-12-24 12:02:02

i have the same problem

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