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
arpan_jain_946: 2016-09-24 13:50:50

Can anyone tell me how i can get correct code for this problem??
Thanks in advance....

tushar_018: 2016-09-09 15:13:17

my code runs on ideone with time:0.06 but here ir shows time limit exceeded ??

onursurme: 2016-09-08 00:54:12

my code runs on ideone withe success, but gives runtime error here.

mrinal_007: 2016-09-07 08:33:22

If i use sieve it shows segmentation error ? how to encounter this ?
I have solved this without sieve but I want to know the other process

Last edit: 2016-09-07 08:46:47
avishek_arora: 2016-09-04 19:50:03

can i use segmented SOE if input is small or it is only applicable on large inputs.

devanshu95: 2016-08-31 15:28:14

how are you all storing the result.?

ashish16iitr: 2016-08-29 19:58:58

whats the time limit for this question?

hush01: 2016-08-24 21:07:03

this is tough!

Last edit: 2016-08-24 21:14:30
k_dhingra2013: 2016-08-24 08:55:43

did it using sieve in just 0.01 seconds

hashem sllat: 2016-08-18 12:49:16

binary search + sieve 0.24s

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