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 115 116 117 118 119 120 121 122 123 124 125 Next >

	Mr. Rook: 2013-03-13 22:12:29 @keshav as far as i know if you allocate an array of size int(1000000) if gives runtime error in many compiler maybe thats y u r getting. correct me if i am wrong :) next thing donot post your codes here Last edit: 2012-05-30 07:16:18
	Max: 2013-03-13 22:12:29 <snip> can someone please tell why it gets a runtime error when I sumbit? Works just fine here Last edit: 2023-05-27 18:29:46
	ronak poddar: 2013-03-13 22:12:29 getting WA again and again...unable to debug...plz help...my code is <snip> Last edit: 2023-05-27 18:31:00
	Mads: 2013-03-13 22:12:29 Hi when i run my program on local computer it works and generates the right results and when i test it on Ideone.com it gets the green light and generates the correct results. But when i run it on SPOJ i get NZEC error. What is the problem? Sorry no code because it says comment to long but the code is in JAVA.
	Ali Abdallah Awad: 2013-03-13 22:12:29 I Hate Time limit executed :(
	Tom: 2013-03-13 22:12:29 with input 2 1000 2000 100 200 i get time: 0.02s mem: 2860 kB and still time limit exc. ;-(
	KRISHNA: 2013-03-13 22:12:29 <No code in the comments> Last edit: 2012-12-07 08:40:03
	Abhishek Joshi: 2013-03-13 22:12:29 can somebody please tell me why the submission id 7001755 is giving a TLE I am using sieve of erastothenes.
	Thang Do: 2013-03-13 22:12:29 result: success time: 0.04s memory: 37984 kB returned value: 0 input: 2 1000 2000 100 200 This is what I get from Ideone.com But I still encounter runtime error SIGKILL from SPOJ ? Is it because I didnt specify the input for SPOJ? Need help, please
	Andrew: 2013-03-13 22:12:29 I don't think this can be done in Ruby unless you just build a giant prime container and pull primes out of it instead of calculating them. Or embed C, but that's cheating, 'cuz it's no longer ruby

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