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

	StupidGuy: 2013-03-13 22:12:29 How the execution time measured? Always 0.01 on Ideone but 0.7s here.
	sodom: 2013-03-13 22:12:29 just for clarification, if an entry has -1 100 as input, should it be ignored?
	Prateek Taori: 2013-03-13 22:12:29 time limit is for execution or compilation?
	Abi: 2013-03-13 22:12:29 how to apply sieve by giving starting and ending range.if i start from 2 and proceed as sieve algo it is again showing time limit exceeded
	Aditya Pande: 2013-03-13 22:12:29 plz check submission ID 7094038. it is giving WA but i dont know why
	iostream: 2013-03-13 22:12:29 @naveen bansal even I am getting the same problem , it is showing 0.01 sec on ideone but shows "time limit exceeded ' on Spoj , Plz help if u get to a solution thanx
	Abi: 2013-03-13 22:12:29 when iam running my code on ideone.com it shows success 0.01s but when i submit on spoj it shows runtime error(SIGSEGV).pls anyone help
	Naveen Bansal: 2013-03-13 22:12:29 I am getting 'Time Limit Exceeded error' but when i run the code on ideone.com, its running successfully in just 0.02 secs. Please see the ideone.com statistics below- result: Success time: 0.02s memory: 2864 kB returned value: 0 Help please!
	Mr. Rook: 2013-03-13 22:12:29 may this wuld help u what is the max no u need to check if no is prime or no???
	Mr. Rook: 2013-03-13 22:12:29 hint is u only need array of size <1,000,000,000 if u think little bit

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