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
rohit9934: 2017-04-23 10:40:11

Same Solution without Sieve or Segmented Sieve(Time Limit 3 sec :p)
C : 1.66 sec
C++ : 0.7 seconds.

shahroz14: 2017-04-19 11:38:50

All natural numbers are either a prime or a multiple of a prime except 1.

Last edit: 2017-04-19 11:39:42
secretninja007: 2017-04-16 13:40:10

just use simple logic with long long int and run loop till sqrt(n) it would work,don't use segmented sieve if you are a beginner

supriya_jah: 2017-04-14 11:25:37

I am writing in Java, and the time is 0.06, still it says time limit exceeded. :(

coolboi567: 2017-04-12 22:51:15

@zero_shubham : nope.. Python is slow for that range of prime numbers and generates lots of intermediate datas that causes the either time limit or memory limit errors...

zeroq: 2017-04-10 18:14:39

TLE with java using sqrt. Any tips

zero_shubham: 2017-04-10 14:27:56

anyone successfully did it with python3?

payal_05: 2017-04-10 12:36:06

time limit exceeded :(

Last edit: 2017-04-10 12:36:43
masterbios: 2017-04-09 14:25:12

In java int is sufficient!
using long can cost you TLE...

wahyupermadie_: 2017-04-07 19:26:41

how to solve LTE -_-

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