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
nikhil kumar singh: 2013-03-13 22:12:29

wats the solution to get rid of time limit exceeding problem..??

Vladimir Milenkovic: 2013-03-13 22:12:29

MY programe works fine, time limit is 6s, in worst test case it works for 4.84 s on , and it's always Time limit Exceeded :( Why??

Sardar Khan: 2013-03-13 22:12:29

how to solve sigsev error?

sudarshan: 2013-03-13 22:12:29

i m new here.. i think the problem can be done by using sieve erosthanes .. starting with 2, we check every prime ,and separate the composite ones, for each test case, we can check in btw.. i know it sounds obvious, but could you help me, in finding the soln..

strings: 2013-03-13 22:12:29

what is output if input is
34 36
or the likes... i print one blank line for such test cases and rest of the code runs well on ideone @1.33 sec and even on my comp...

yehya elmasry: 2013-03-13 22:12:29

My code is running perfectly on my PC but on submitting it gives Compilation Error !!!! please help
Hint: i am coding in C++

^lol!! you giving hint for problem setter?

Last edit: 2012-02-21 18:42:46
numerix: 2013-03-13 22:12:29

@Julian Leyh: There are already 20 AC Ada solutions. You have to think about another approach ...

Julian Leyh: 2013-03-13 22:12:29

Heap for Ada seems to be too small.. I can't allocate an array of Boolean with 1000000000 elements.

Ravi Upadhyay: 2013-03-13 22:12:29

you'll have to use sieves to generate primes maybe upto sqrt(10^9) and then running the sieve again on the nos. bw. m and n using those primes you have calc. earlier.

Shraddha Jain: 2013-03-13 22:12:29

wht cn b the cause of time limit exceeded.....

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