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
|
hoangbonduy123:
2020-02-21 08:36:09
wow the time limit is large |
|
hoangbonduy123:
2020-02-21 08:35:41
Easy AC |
|
nguyen ngoc son:
2020-02-21 02:13:12
q |
|
shafaet:
2020-02-19 02:51:53
segment sieve or bit-wise sieve will be the best choice for beginner |
|
dileep32:
2020-02-17 18:38:37
yes, time limit is constant for all languages , i used sqrt and odd number method got accepted. |
|
asimmahmood88:
2020-02-13 05:45:55
my code is running fine on ideone but here my submission isnt being accepted. I am getting "runtime error (NZEC)". Can someone help me please |
|
aroramudit70:
2020-02-12 13:09:35
Last edit: 2020-02-12 13:10:07 |
|
vibavari:
2020-02-10 16:34:33
My sample case is giving the correct output in idone, no extra spaces or extra lines. but its giving wrong answer while i submit it in SPOJ. Please help |
|
tushar_dhote:
2020-01-29 13:19:48
AC in 1st attempt. XD |
|
dchhitarka:
2020-01-25 10:43:30
My code(Python3) is working fine on ideone.com and everywhere else but its showing time limit exceeded when I submit it. Can anyone help me? |
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 |