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
|
yogeshk_108:
2020-09-14 10:00:08
better if you use segmented seive without pre-generate all prime numbers upto sqrt(R); |
|
prakharrai:
2020-09-12 20:07:38
To anyone who reads , normal n^2 approach (2 loops) or sieve of erothnes wont work! Try something else
|
|
appuk:
2020-09-09 18:10:27
Getting a tle when using sieve...
|
|
madhusurisetti:
2020-09-09 11:27:14
solved it with common lisp!!! |
|
dharan1011:
2020-09-06 15:30:36
Easy one. AC ⭐️ |
|
david_lodianto:
2020-09-06 06:36:02
used sieve, and it always gives segmentation fault after 46349, any idea what I should do? |
|
parth_cp_n0ob:
2020-08-28 08:19:02
I used Segmented Sieves but it give a time limit exceeded error. Is there a better way to do it? |
|
eyepatch020:
2020-08-17 19:02:17
just return false if divisible by 2 |
|
hary_roger2001:
2020-08-13 16:08:25
my standard input is empty,what should i do
|
|
manxmaniac:
2020-08-08 09:18:11
segmented sieve makes it a charm |
| 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