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
vishnu_: 2023-01-31 15:16:46


Last edit: 2023-01-31 20:20:15
ayush_7901: 2022-12-20 08:03:48

used segmented sieve nice problem

tpoet: 2022-12-16 10:27:08

where is the forum?
[Simes]: follow the Discuss link at the top of the page, or go directly to

Last edit: 2022-12-16 16:30:53
galaxie_729: 2022-11-25 01:27:02

I used Elatonian prime sieve,but the the code runs out of runtime limit.

aditi078: 2022-10-26 16:08:50

i used segmented seive..still getting runtime exceeded:(

shivatmika98: 2022-10-02 13:20:16

i got the output of the code but this editor threw a runtime error
[Simes]: Read the footer - Don't post source code here, use the forum.

Last edit: 2022-10-02 21:27:19
aryan_2574: 2022-10-01 09:30:56

To everyone who getting TLE, use segmented sieve

laopig: 2022-09-29 06:00:37

You can solve it , it is easy enough.

vats_ayush: 2022-09-21 17:21:15

what to do in case of m = n = 1

vats_ayush: 2022-09-21 17:17:37

how to handle the case of m = n

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