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
|
firefoxbn_01:
2023-06-05 01:58:18
if you got TLE, may be you looped check prime from 1 to n, just change it to check from 1 to sqrt(n) then it should be OK |
|
hongnam207:
2023-04-29 09:21:01
what the f**k is that I used the sieve of eratostenes and TLE but when I don't, I passed
|
|
deuncle_16:
2023-04-18 17:31:19
Guys try to search for Sieve of Eratosthenes |
|
mafia_987:
2023-04-06 17:13:15
normal prime sieve can not be used because memory limit exceds |
|
samayh09:
2023-03-20 01:01:52
i am submitted solution, however, it is giving me "Time limit exceeded. " error. I am new this space. may i know the reason? |
|
czester_56:
2023-02-19 21:35:43
11 |
|
vishnu_:
2023-01-31 15:16:46
<snip>
|
|
ayush_7901:
2022-12-20 08:03:48
used segmented sieve nice problem |
|
tpoet:
2022-12-16 10:27:08
where is the forum?
|
|
galaxie_729:
2022-11-25 01:27:02
I used Elatonian prime sieve,but the the code runs out of runtime limit. |
| 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