SPOJ.com - Problem PRIME1

PRIME1 - Prime Generator

#number-theory

Peter wants to generate some prime numbers for his cryptosystem. Help him! Your task is to generate all prime numbers between two given numbers!

Input

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.

Output

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.

Example

Input:
2
1 10
3 5

Output:
2
3
5
7

3
5

Warning: large Input/Output data, be careful with certain languages (though most should be OK if the algorithm is well designed)

Information

After cluster change, please consider PRINT as a more challenging problem.

Submit solution!

hide comments

< Previous 6 7 8 9 10 11 12 13 14 15 16 Next >

	gabe3491: 2017-07-12 12:33:39 seriously a single line mistake ruined my day.. use segmented sieve.. Last edit: 2017-07-12 13:24:02
	sravan_maddika: 2017-07-04 10:26:14 can anyone explain the code please
	sidh13: 2017-07-02 17:30:07 MY code is working fine in my system in language c++ but here it shows time limit exceeded although i have tried it many times please help!!
	skap_21: 2017-07-01 16:59:22 I KEEP GETTING SEGMENTATION ERROR EVEN THOUGH IT WORKS PERFECTLY FINE ON ideone, codeforces and codechef here is the link https://www.codechef.com/ide Last edit: 2017-07-01 17:08:55
	sanjitpd_777: 2017-07-01 04:54:39 those getting TLE use segmented sieve with bool array. AC in 0.00 sec
	manish_nit97: 2017-06-28 09:08:10 please provide a proper solution of TLE
	priyesh212: 2017-06-25 12:55:46 my code is working fine on codechef ide but here its showing time limit exceeded
	rohit5840: 2017-06-22 05:22:34 where i can see my submitted answer?
	larunrahul: 2017-06-21 06:30:53 For each of the number in the range, 1) find if it is prime or not (iterate till square root of number). 2) use sieve to cancel all its multiples within given range
	callmebray: 2017-06-20 18:58:00 This may be the dumbest question ever asked on here.. I know I can figure out how to print all the prime numbers, but i'm not sure how to actually read the input into my Javascript function? Do I just use readline(); and the input comes through as an array that I can save into a variable? for example, var data = readline(); and now the input is saved into the variable data as the array [2, [1, 10], [3, 5]]? or does the input come through as text that I need to split? or do I need to do it some other way?

Submit solution!

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