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
billoybillyboy: 2016-10-18 13:45:05

Just use BigInteger.isProbablePrime ;)

esshuvo: 2016-10-18 12:05:22

Time limit 6s! So,naive approach will be accepted and I got accepted :)

ansar: 2016-10-17 20:27:38

Why this one is not working
Snowing error

[code snipped by EB]

Last edit: 2016-10-18 03:53:46
crazypython: 2016-10-16 21:08:55

Are we supposed to reuse data from one testcase to another?

Filip Sollar: 2016-10-13 17:14:02

Don't forget about printing empty line at the end of each test case, cost me 1 WA :((((

ashish80n: 2016-10-09 19:01:23

getting runtime error(segmentation error) using sieve.Can anyone help me with this?

adi_pra: 2016-10-08 19:48:31

applying the sieve theory , you will get the answer . Just think of it between number m and n , then you will
not get TLE .

tlee066: 2016-10-08 00:01:34

i dont get this, do you have to create a method that takes in the inputs or how does it my code gets called when i submit it?

rahadiankputra: 2016-10-07 17:51:00

Using naive algorithm O(m-n), got AC 0.96. Weird...

mannishrawwat: 2016-10-06 08:13:03

Last edit: 2016-10-15 07:29:45

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