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
bhoopeshkanna: 2017-09-22 07:39:01

Even I am getting Time limit exceeded, I am using java.... but when I check the system execution time coding wise my execution time is 0 secs... any one help please!!!!

Last edit: 2017-09-22 07:39:26
adi29raj: 2017-09-19 20:49:15

finally ,,done,,0.90s for c++

bballer09: 2017-09-08 17:57:32

You all could try and use sieve of eranthoses in case of encountring tle

bquinn6: 2017-09-07 21:07:36

I cant use modulus to find prime numbers? never heard of using square root to find prime

Last edit: 2017-09-07 21:07:48
snipecoder1: 2017-09-02 20:21:39

Guys edit code with sqrt(n) instead of n/ will C or C++

Last edit: 2017-09-02 20:44:40
albino_spoj: 2017-09-02 14:20:02

suyash_madhav: 2017-08-27 18:31:17

my code is right but it shows time limit exceeds. How can I resolve this problem ? anyone please ? ? ?

Last edit: 2017-08-27 18:31:37
kxingh: 2017-08-18 16:55:29

my fifty

pratikshit: 2017-08-18 15:24:32

just run the loop till sqrt(n) values the judge will accept your solution

bellapukonda: 2017-07-27 21:19:52

TLE pls tell me the best way for it ->python

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