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

	vaibhav kumar: 2013-07-31 16:25:45 [code removed] wrong answer help plese !!!!!! "Notes: 1. Don't post any source code here." Last edit: 2013-07-31 17:45:14
	vids: 2013-07-29 07:08:34 I coded this problem, and got the same solution also. Still it is saying 'wrong answer'. Last edit: 2013-07-29 07:08:58
	rishi: 2013-07-27 08:20:53 the greeks have the answer
	Mostafa 36a2: 2013-07-26 14:20:01 @mohamed gouda : your algorithm checks every number between m and n with a O(n) test if m==1000000 and n==1010000 you have to do 10000*1000000 cycle :P and this is too long . try your code on this case: 1 100000000 100100000
	Mohamed Gouda : 2013-07-23 04:31:19 i keep getting TLE i don't no why can somebody help , this is my code ( code removed :) ) Last edit: 2013-07-27 05:13:45
	innovolt: 2013-07-18 15:42:28 finally seive works run in 5.63s
	paes marca: 2013-07-18 13:55:12 compilation error gcc-4.3 -c -O2 -x ada prog.ada prog.ada:1:01: compilation unit expected prog.ada:3:29: illegal character, replaced by "(" prog.ada:5:49: illegal character, replaced by "(" prog.ada:7:23: == should be = why!
	GuiXin: 2013-07-16 17:28:42 notice this "n (1 <= m <= n <= 1000000000, n-m<=100000)" n may be large. i still fail now
	littlethunder: 2013-07-09 03:00:01 "time limit exceeded " !!! I cannot stand it any more!!!
	Madhusudhan K: 2013-06-29 21:01:41 My code ran in 0.01 sec on ideone.com http://ideone.com/vYN4MI But on spoj, it says "time limit exceeded". Can someone help me optimise this code? thanks! Last edit: 2013-06-29 21:05:38

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