SPOJ.com - Problem PRIME1

PRIME1 - Prime Generator

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!

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

hide comments

2018-01-17 08:21:48
I tested the problem and worked, but the real problem question doesn't work. hmmm

2018-01-16 22:08:24
@hsakiv220290, 1 is not prime

2018-01-14 07:53:39
I am using java and my code work in my computer(outside this website) but it is showing error when I submit it.

2018-01-11 13:51:24
Solved in java but getting WA in R. ID 20965189 and 20965178 (tried both with and without empty line at end of last test case). Sample test case prints expected output and I can't find any problem. Please help.

2018-01-10 08:35:52
In example, 1st test case ,1 is a prime number.

2018-01-03 15:34:22
It doesn't work when I use python 3, then I AC with C++ in 1.5s :v

2017-12-28 17:29:10
TLE ?? even after using sieve,,,please help

2017-12-25 17:04:45
Time limit exceeded any solution??

2017-12-24 04:45:25
just take care of large input and use SIEVE algo to make it run in O(N).

Last edit: 2017-12-24 04:46:04

2017-12-22 19:11:08
Something about TLE, if your algorithm does it with filter or screen method with O(n) memory cost (n means the largest number inputted), that may mean you use too much MEM, try other methods with lower time effect, but O(1) memory cost, will be accepted.