| Submit | All submissions | Best solutions | Back to list |
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.| 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
|
||||||||||||||
|
2017-06-10 20:01:56
why is it coming runtime error |
||||||||||||||
|
2017-06-03 09:31:36
in my code there is time limit exceed ,how to remove it ,i complexity of n^3 how to reduce it |
||||||||||||||
|
2017-06-03 02:28:50
You don't need a vector! |
||||||||||||||
|
2017-06-02 11:53:50
0.00s C++ |
||||||||||||||
|
2017-05-29 17:52:12
You really mean it, guys... Seive just make things worse, in this case the execution time. |
||||||||||||||
|
2017-05-29 12:51:22
0.33 s in one go without sieve. |
||||||||||||||
|
2017-05-26 09:01:44
Clue: You can solve it without a seive :) Last edit: 2017-05-26 09:02:08 |
||||||||||||||
|
2017-05-23 02:44:21
Then why it say Time running Error for 0.01s, I am Writing in C#. |
||||||||||||||
|
2017-05-21 18:46:10
AC in one go but took 3.64s in Java :( |
||||||||||||||
|
2017-05-16 22:38:23
Its possible with java? Always say time limit exceed |
||||||||||||||
RSS