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
|
mursalatul:
2022-04-17 22:24:16
dont know why its giving TLE. |
|
zinfx_09:
2022-03-15 01:34:27
LETS GO I DID IT!! |
|
quarkeby3:
2022-02-27 19:32:36
use Segmented sieve |
|
|
zinfx_09:
2022-02-23 02:45:58
i don't get why my code is giving wrong answer, ive use long long and sqrt n solution |
|
sarkybastard:
2022-02-12 23:14:22
well @ivan_vanko, youre perfectly qualified to judge now that you've solved 1 problem |
|
styrix358:
2022-02-08 12:18:06
My C# code works perfectly fine on my machine, but I keep getting compilation errors. Anyone have an idea, why that could be?
|
|
shashwat10:
2022-02-06 15:11:25
Please don't add new line after every test case as shown in output
|
|
code_3r_:
2022-02-03 13:47:34
Why i'm getting runtime error?
|
|
ankitkumarx:
2022-01-10 15:49:21
My code is taking 0.01 sec to execute, but the website is leaving a message of 'time limit exceed'. |
|
orno:
2021-11-25 17:56:55
Does any of you have tricky testcases ?
|
| 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 |
RSS