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
carcomortesi: 2019-09-16 23:08:39

Testing my code in my VS2017 and timing it I always obtain about 15-16 millis. But here I always obtain TLE. What am I doing wrong? Is there any sample of input that could be realistic?

coder_mukul: 2019-09-08 20:51:17

Help my whole code is correct and but spoj declares it wrong.

sanket_meshram: 2019-08-31 09:15:30

Use Primality tests for each number in range(m,n). time = O((n-m)*(log(n))^2)

Last edit: 2019-08-31 09:16:07
youssef00: 2019-08-30 00:53:40

Last edit: 2019-08-30 12:15:12
divine_rythm: 2019-08-25 11:29:01

using SOE algorithm it's giving runtime error while it's running perfectly on ideon

Last edit: 2019-08-25 12:04:45
eternity1198: 2019-08-22 17:59:48

@adnane27 there are some hidden test cases in the compiler to test your code perfectly, so your code will be lacking the correct answer for complex test cases.

uri_12: 2019-08-21 19:42:23

the code works in cpp while the same sqrt logic doesn't work in python 3 ?

adnane27: 2019-08-20 01:17:51

my code works perfectly when i run it on my machine ( using C ), but when i upload the file it says wrong answer, what's going on here ??

urblakeenened: 2019-08-13 14:04:51

Hi ALL, iam new to c++ my code have time issue can some one tell me what i can do to make it faster

i am using pair<int,int>
sqrt(n) method
and 4 for loops
1st for loop for input
2nd to caal by reference the prime function
3 and 4 are inside the prime generator

Last edit: 2019-08-13 14:07:59
vanshs: 2019-08-13 04:13:12

Make sure that your segmented sieve only goes up to root of n. This will avoid TLE.

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