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 5Warning: 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.hide comments
Piotr:
2013-03-13 22:12:29
TLE ... ideo all ok |
|
Rohit Retnakaran:
2013-03-13 22:12:29
Works fine in ideone but why TLE?????
|
|
lemme code:
2013-03-13 22:12:29
somebody tell me how to increase output file size
|
|
aaditya s:
2013-03-13 22:12:29
how to reduce the time limit? am new to programming. please help |
|
StupidGuy:
2013-03-13 22:12:29
My same code differs on time when submitted twice, thats weird. Last edit: 2012-08-13 07:05:07 |
|
Hirein Nag Bharadwaj:
2013-03-13 22:12:29
Works fine in Ideone. But wen i submit it,it's showing Time Limit Exceed. Any help will be highly appreciated. |
|
Ashok:
2013-03-13 22:12:29
time limit exceeded, wat to do?? it works fine in ideone. |
|
Hesham Hossam:
2013-03-13 22:12:29
This is my result on ideone..and u always give me time limit exceeded i dunni why
|
|
garretthh07:
2013-03-13 22:12:29
I have made a little mistake on my code ,AC now !! |
|
vanathi:
2013-03-13 22:12:29
I m getting index bound of exception while trying to creating an boolean array size 1000000000 in java. kindly help me Last edit: 2012-07-31 09:36:14 |
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 |