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 101 102 103 104 105 106 107 108 109 110 111 Next >

	Sherfudeen Mohamed Kasim: 2013-08-22 20:04:19 My java code working fine but it's timed out. I might need to change the code to write into stringbuffer to print on console at one shot. But I welcome any suggestion. Thanks
	Mateusz: 2013-08-22 08:31:48 I believe I have some problems with input and output, as my solution passes all tests which I can only imagine on ideone... <snip> Last edit: 2022-06-19 12:30:40
	Andrey K: 2013-08-22 02:19:47 haha I have realized, to solve this quickly, you have to avoid O(n^2) Just make sure you avoid same calculations twice :-D
	Mateusz: 2013-08-21 21:57:49 yhm... I implemented solution in Ruby and it passes all test cases which I created however it shows Wrong Answer when I submit it to SPOJ. here is code and some tests on ideone: <snip> If someone could suggest what could be wrong. Last edit: 2022-06-19 12:32:37
	Kishlay Raj: 2013-08-13 14:35:32 vids u dont need to use sqrt u can simply campare it like i*i<n instead of i<sqrt(n)
	do_do: 2013-08-11 07:04:28 what is time limit exceeded?plz help
	Sushil: 2013-08-09 22:18:58 getting NZEC error using java ..help or any hints
	John and the cows: 2013-08-08 12:21:06 AC at first attempt :) Last edit: 2013-08-08 13:55:18
	Kishlay Raj: 2013-08-07 19:06:59 i hav used sieve but it giving worng and can any1 give me a good test case to check with
	Bohdan Taraba: 2013-08-07 16:26:36 i think i have some problem with input or output. My algorithm is working fine but i have still wrong answer. Which way is correct implementation of input in C/C++ ?

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