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
harshuraj2710: 2018-12-21 04:28:16


seantang001: 2018-12-19 05:39:10

works in terminal. i think my problem is with the io. can figure out why they format it this way.(python)

amit9bhasita_: 2018-12-05 02:36:42

the approach to problem i almost same for all. you have to run a loop for n then scan l and r and further check whether num is prime or not. but the magic doesnt appear there as it relies in what condition you put in the loop to check prime. the ideal one is run a loop such that for(int k=2;k*k<NUM;K++) this is the actual magic which can take you from tle. also the real magic stays back in printing numbers for that you have to use fast io , can google it for how to use . i recommend using string builder inside all for loops and finally print. fast io can be simply found on internet

Last edit: 2018-12-05 02:42:08
aashish_a2z: 2018-11-28 09:06:46

You can simply run two loops one for each number from m to n and one to check whether that number is prime or not....You can run the another loop from 2 to sqrt(number) ans as u got any number which divides number then increase temp variable and use break and check if temp is greater then 1 then number is prime

neon10: 2018-11-22 17:13:58

@thegravityguy, You got TLE because you can't generate prime number upto 10^9 using Sieve...It can generate at most 10^7 prime number using sieve...

ghastslayer29: 2018-11-19 15:25:52

I swear to god I ran my python program in my terminal, I even tried it with very large numbers, and it runs quick, even though I have a crap top. Yet it says: 'time limit exceeded!'

embiway1298: 2018-11-16 17:37:17

I know the sieve of Eratosthenes method but it is showing TLE.can anyone help????

immahesh10: 2018-11-05 16:13:10


Simes: 2018-11-05 14:37:10

@stephentjj- currently 5699 people have solved it in Java, see

Last edit: 2018-11-05 14:47:34
stephentjj: 2018-11-05 07:30:42

Did anyone solve this in java?

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