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
priyankamani: 2018-08-01 15:28:06

why you are saying the answer is wrong .plz give the test cases

suyashky: 2018-07-31 15:35:14

Do not forget to check 1!

vishalroybitp: 2018-07-29 18:18:25

What the heck.Tried running sqrt(),n,n/2.and guess what still TLE.

danfrown: 2018-07-21 18:36:29

Well god help me. I ran the loop till sqrt(n) till n/2 till n. And guess what? I still get time limit exceeded. I'm using C. Help me... Anyone..?

amoghraj: 2018-07-19 06:20:22

for anyone struggling with time complexity ....check divisibility up to the sqrt(x) instead of x/2 ! worked for me

sourav_bh: 2018-07-19 05:45:48

Tle in c.

neel_2000: 2018-07-18 13:32:28

How shall I make sure the time limit is not exceeded while I am using C++(gcc 4.3.2) ?

learnerinblack: 2018-07-14 21:05:39

Done in O(sqrt(N)*loglogN) + t*(m-n)) N = 1e9 :D

rogu_auto: 2018-07-13 16:02:35

i think u should code this with pascal :)

shubham_here: 2018-07-11 08:14:33

How to take input m and n using std::cin in c++ seperated by spaces.

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