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
|
masterbios:
2017-04-09 14:25:12
In java int is sufficient!
|
|
wahyupermadie_:
2017-04-07 19:26:41
how to solve LTE -_- |
|
sonu1801:
2017-04-05 00:07:43
1st try after little google search accepted haha |
|
pc_wallace:
2017-04-03 18:33:00
nzec run time error coming in my case
|
|
anhvu261:
2017-04-01 09:18:04
time limit :( |
|
dev1604:
2017-03-29 19:03:44
The time limit exceed error generally occurs in two cases :
|
|
soumya_dip:
2017-03-29 08:23:21
why I am getting time limit exceeded? |
|
anurag_tangri:
2017-03-28 14:26:19
my 50th:) |
|
asvs_kartheek:
2017-03-23 11:36:39
My code is running good in ideone but here it is showing time limit exceeded |
|
amandal799:
2017-03-22 13:16:08
keep track of prime numbers up to sqrt(1e9) and apply sieve simply
|
| 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