| Submit | All submissions | Best solutions | Back to list |
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.| 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 |
hide comments
|
||||||||||||||
|
2022-06-12 14:56:02
I think I solved it in an optimal way using sieve method I don't know why I get TLE ! |
||||||||||||||
|
2022-06-11 12:40:14
Who is getting the Time limit exceeded issue try this solution? Don't forget to follow on github. <snip> [Simes]: No thanks, we don't want links to code. Last edit: 2022-06-12 09:42:04 |
||||||||||||||
|
2022-05-28 07:17:53
If you are getting TLE error . Use segmented Sieve method (though there are two more method, segmented sieve is easy to understand). You can refer to "cp-algorithm" prime number section. |
||||||||||||||
|
2022-05-26 15:07:45
its not fair.Getting time limited exceeded |
||||||||||||||
|
2022-05-26 14:03:13
Why Time limit exceeding is showing? |
||||||||||||||
|
2022-05-03 06:50:58
it is quick at ideone but when i submit it the result is time limit exceeded :( |
||||||||||||||
|
2022-04-28 19:58:54
Why is it giving TLE! |
||||||||||||||
|
2022-04-27 08:07:10
i also have time limit issues... tried to run only till sqrt, only run odd numbers, but still get TLE!! PS: Even use Sieve of Eratosthenes, but still get TLE in python Last edit: 2022-04-27 09:38:49 |
||||||||||||||
|
2022-04-23 09:49:30
Same problem as with others. Gives time limit exceeded even though the algorithm itself runs locally in few milliseconds. Since this requres potentially printing _hundreds_ of lines into console, almost all of the execution time is spent in printing. I wonder does it play a role here too? Last edit: 2022-04-23 09:53:12 |
||||||||||||||
|
2022-04-17 22:24:16
dont know why its giving TLE. |
||||||||||||||
RSS