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 119 120 121 122 123 124 125 126 127 128 129 Next >

	Hazem: 2013-03-13 22:12:29 please help me when i solve by sieve give me java.lang.OutOfMemoryError: Java heap space
	Vimeet Gautam: 2013-03-13 22:12:29 Thnx Sir for your help @Michael T
	Michael T: 2013-03-13 22:12:29 @Alexey: So hard to check? Read input and do nothing - you should get WA.
	Alexey: 2013-03-13 22:12:29 @admins Are you sure you have exactly t lines after integer t? Having runtime, input reading is the ony vulnarable place
	Michael T: 2013-03-13 22:12:29 @Vimeet: Runtime means compiling went OK and it breaks while running.
	Vimeet Gautam: 2013-03-13 22:12:29 My Program runs in gcc compiler but compiling in SPOJ it gives a runtime error NZEC please any body solve my problem
	hemezh: 2013-03-13 22:12:29 @Botta: have a look on http://www.algorithmist.com/index.php/Prime_Sieve_of_Eratosthenes.c
	Giovanni Botta: 2013-03-13 22:12:29 Really struggling with this one. @Rakib: I think that's the way to go for Erathostenes sieve, but I can't figure out how to properly index the integer into a bitset, that is, how given a number you can find its corresponding bit in the array of chars (or 32 bit integer) without being forced to perform modulo operations. I'm sure there is a way but my discrete math skill is not good enough to figure it out. By the way, if one chooses a 32 bit word, the prime numbers will have the form: 120n+1, 120n+7, ..., 120n+31, ... etc.
	David Winiecki: 2013-03-13 22:12:29 Diogo's second comment about the Sieve was really helpful. I can't believe how effective that one change was.
	Mukul: 2013-03-13 22:12:29 I think this problem should be solve using Sieve algorithm, otherwise you will get TLE as i got.

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