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
|
rasputin_87:
2024-10-16 08:30:12
<snip>
|
|
urkarmafr:
2024-09-25 15:16:25
sain uu
|
|
dannsmr:
2024-08-29 15:30:09
super hint: Sieve of Eratosthenes
|
|
satish7978:
2024-03-05 18:43:36
use segmented sieve |
|
sathvik_g:
2024-02-21 12:21:55
zxvxv |
|
hauntedcode:
2024-02-13 01:06:45
easy easy Last edit: 2024-02-13 01:07:37 |
|
beyondcode:
2024-02-12 20:41:59
study hard |
|
otoya:
2024-02-06 13:37:20
snder, segmented sieve, check cp algorithms |
|
snder_z07:
2024-02-06 03:51:12
someone explain to me
|
|
|
snder_z07:
2024-02-06 03:50:45
sainuuu mobgolchuuuda
|
| 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