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 93 94 95 96 97 98 99 100 101 102 103 Next >

	Venkatesh S: 2014-05-28 07:28:24 Guess there is some issue with the Java Compiler. Code runs fine in eclipse. but it shows compilation error here.
	David Winiecki: 2014-05-28 07:07:31 The first line is a single number, indicating the number of lines of input that follow.
	amala: 2014-05-27 22:54:16 How does one know that the user has finished entering input values? Say he gives just 1 line of input--> 1 3. (Nothing afterwards)How is this handled?
	Wasim Thabraze: 2014-05-24 09:44:07 @sourabh sharma ..Use segmented sieve of eratosthenes :)
	Akshay Vilekar: 2014-05-24 08:32:08 Can anyone provide hint which data structure I should use ?
	PRITHA GANGULY: 2014-05-24 06:09:39 time limit exceeded! :( how do I solve this?
	Sourabh Sharma: 2014-05-22 15:47:07 can anyone tell what are the techniques of optimization to avoid time limit problem? any link ..?help
	Kaushal Manna: 2014-05-21 21:23:54 how to reduce the time limit?? anyone...anyidea
	Michael Moerschell: 2014-05-21 13:41:52 If there is no output for a testcase (e.g.: 32 33), has the program to print an empty line? --ans(Francky)--> Judge ignore extra-whitespace, so you can can add an empty line, or not, it doesn't matter. Good luck. Last edit: 2014-05-21 13:58:57
	Michael Moerschell: 2014-05-21 13:40:07 To fix TLE error: http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes

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