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
|
pandektis:
2020-10-19 10:02:33
time limit exceeded... all the time.
|
|
emperorsamrat:
2020-10-17 16:16:20
how to understand what is the error, its just show me that have an error, but the same code works very perfectly in my ide.Also it doesnt exeed the given time limit. |
|
jayaprakash971:
2020-10-08 09:16:03
how much min time
|
|
darsna19:
2020-10-07 09:16:12
@maxcool Find it in GitHub that's where :) |
|
dtosidis:
2020-10-05 02:01:20
That was awsome! Last edit: 2020-10-06 21:20:37 |
|
kya_bantai:
2020-10-04 06:10:37
segmented seive
|
|
maxcool:
2020-09-30 14:05:25
Where to find its solution
|
|
grazier_shahid:
2020-09-30 07:29:40
how much time limit and memory limit? |
|
brofistaman:
2020-09-27 21:24:37
says time limit exceeded |
|
cang:
2020-09-23 20:52:15
It keeps saying runtime error even though it seems to work perfectly fine whenever I compile it myself with the g++ compiler. Not sure how to fix this. |
| 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