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
raufoon: 2018-10-17 16:57:28

same approach. TLE in python3, AC with 1.69s in C++ :|

imharveer: 2018-10-07 11:17:06

i am using sqrt(n) then also its giving me time exceeded may i know why??

gozubair: 2018-09-28 13:09:46

Now my codes runs 0.01 second but i am getting run time error??

reclu: 2018-09-28 12:54:05

See the input constraints!
Queries are less than 10.
No sieves required. Plain brute force checking till sqrt(n) works!!

gozubair: 2018-09-28 06:20:38

My code still giving me tle plz guide me in python

gozubair: 2018-09-27 19:28:24

I am not finding python's solution yet

karate_25: 2018-09-24 01:21:10

I wanna know why i get a wrong answer , could I know how u test inputs , do u test it as a collection of input or every input separately ?!!

julkas: 2018-09-23 15:41:35

@kire85 I have tested sieve-of-atkin from geeksforgeeks on with your modification for limit=10**6 (without printing primes) with PyPy. It's very slow - 0.17s. My PyPy implementations of SE (sieve of Etatosthenes), OSE (odd sieve of Etatosthenes), SS (sieve of Sundaram) for limit=10**6 give 0.04s.
For this problem I use precomputed primes below (10**9)**0.5 with non orthodoxal Sundaram algorithm and then sieve interval for each query (my PyPy time - 0.02s).
You can make custom and random tests on or
If you want good Python time you must optimize I/O also.

Last edit: 2018-09-23 16:41:22
kire85: 2018-09-23 09:53:33

in c++ i get a 0.4 solution with first sieve-ing the primes below 32000 (sqrt of 1 000 000 000) and then using those primes with modolus to check if each number is prime in the range for each testcase. I have coded the same solution i python but TLE. i used as sieve. The python code as a flaw. It is missing r =r+1 in the last while loop. I have pointed this out in the comments.

marcobw1: 2018-09-09 19:01:16

Use complexity O(n^2) , check up division until squared(n), it shall work

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