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
itsmysyntax: 2019-04-21 16:19:56

follow this tutorial this could help you

charlles: 2019-04-09 16:35:18

for primality of n, check :
base cases;
only odd numbers;
only from 3 to sqrt(n)

vasunaidu: 2019-04-07 14:23:56

Showing time limit exceeded for prime generator.

piecyk: 2019-04-05 10:01:13

I get input error, tried python 2.7 raw_input() and python 3 input()
What is the correct way to collect results? Keyobard input? Reading from file?
I am constantly getting runtime error

f20180295: 2019-04-05 08:15:10

it is showing time limit error what to do

keshav_garg27: 2019-04-02 15:16:20

it works fine even on ideone but here it shown time limit exceeded.
What to do?

ahsan_habib: 2019-04-02 14:40:33

sala point discis na kn??

ravikuril: 2019-03-25 16:01:03

segmented sieve

adarshanp_01: 2019-03-18 11:06:19

it works fine even on ideone but here it shown time limit exceeded.
What to do?

smriti195: 2019-03-17 12:54:40

it works fine at ideone but here on spoj it shows runtime error...what to do?

Last edit: 2019-03-17 12:55:21

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