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
execusioner: 2021-02-24 04:08:45

i love you

mohsehga: 2021-02-23 18:00:21

What should be the output if there is not prime number possible between the the range for example : 25 27 ??

kanhabindal: 2021-02-16 17:53:24

test cases are weak solved it without using sieve

vishal_0303: 2021-01-18 15:28:25

odd loop+flag +2 loops

aarindey: 2021-01-12 17:01:59

I ran it on vs code. Its absolutely fine there. Can anyone say why its showing wrong?

[NG]: Don't post any code here. Use forum for debug help and discussion.

Last edit: 2021-01-12 22:48:29
yatharth08: 2021-01-03 19:17:09

brute force works but segmented sieve gives tle

yatharth08: 2021-01-03 19:02:49

Sieve will give a runtime error because the array size(n>10^9) is too large to be stored in ram use segmented sieve

easeen56: 2020-12-25 11:57:51

I thought this is a easy problem but....when i saw sieve algo....then i am start crying

tutturushi: 2020-12-18 17:10:39

Test cases are definitely weak. I got away with ~7s processing for some cases.

dexterdude: 2020-12-11 01:44:26

Bruteforce works

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