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_jsk: 2018-02-12 13:32:02

I've used 2 to sqrt(number) to solve the problem.Solution is accepted but the time is over 1 sec(1.15). How do I reduce the compilation time. BTW I've used C++ to code.

ducluong: 2018-02-10 14:23:56

Last edit: 2018-02-10 14:24:05
laconic: 2018-02-09 19:25:40

no need of using sieve here

jonmanu: 2018-02-06 18:14:16

guys ,getting runtime error sigsegv.what to do?
and whats the difference between a sieve and a segmented sieve.........?

rogers078: 2018-01-26 16:13:51

sieve divided in segments

rsgilbert: 2018-01-23 14:16:50

Guys what is segmented sieve

shashankpathak: 2018-01-23 12:22:46

AC finally! use segmented sieve

Last edit: 2018-01-23 16:19:22
hackerboy7862: 2018-01-21 13:26:35

run from 2 upto square root of number while checking for prime

Last edit: 2018-01-21 13:27:10
ptrsn311: 2018-01-21 01:19:18

@hsakiv220290, a prime has exactly two divisors, the number 1 only has 1 (itself)

shubham_chopra: 2018-01-19 20:29:38

use segmented sieve, normal sieve will give TLE

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