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 42 43 44 45 46 47 48 49 50 51 52 Next >

	shreyansh96: 2017-07-18 18:19:14 Why am i getting SIGSEV?
	skyzhi: 2017-07-16 07:19:43 AC in 0.00sec happy ?
	win2009: 2017-07-16 04:01:12 Proof of my theory above/below: look at jhaanuj2108's code. It is terrible, but it uses a square root trick. He succeeded. almost NO optimizations and he still passed. Use the square root trick. Last edit: 2017-07-16 04:15:36
	win2009: 2017-07-16 03:59:17 The trick is to use the square root trick when considering factors. Sieve or no sieve does not matter. Just use the square root trick and you will be fine. Also, optimize your code. You do not have to handle the worst case scenario ( 999900000 1000000000), at least that was the case for me.
	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

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