| 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
|
||||||||||||||
|
2020-06-24 19:18:03
Python3 TLE Prime Logic (TLE) convert it to C++ and it will get accepted like a charm.! Shows just how important C++ in CP.! |
||||||||||||||
|
2020-06-22 08:10:18
After I submitted my problem it says "time limit exceeded". Then I clicked on "ideone it". And after running in ideone I saw that it's taking less than 0s to run. Still my answer not getting accepted. |
||||||||||||||
|
2020-06-22 05:49:25
it says wrong answer but where to look which is the wrong one in python 3.7 in Atom its giving correct answer Anyone help [NG]: Don't post code in comments; vide the notes at the bottom of the page. Also, your solution is bruteforce and wouldn't pass even if it gave correct answers. Last edit: 2020-06-22 06:53:10 |
||||||||||||||
|
2020-06-20 12:48:08
Is it not possible to answer this question using C? My code keeps exceeding the time limit |
||||||||||||||
|
2020-06-10 06:07:11
I am getting runtime error. I am using brute force in python. I also tried using the sieve of eratosthene but I am still getting runtime error. Is there any more efficient algorithm for python users? [NG]: There are several approaches that can get AC with Python in fraction of the TL. Your code is getting CE not RE, ensure your IDE replaces tabs with spaces correctly. Last edit: 2020-06-11 03:35:04 |
||||||||||||||
|
2020-06-03 09:07:25
I'm getting time exceeded warning when compiled on C . Any one help me!!! |
||||||||||||||
|
2020-05-31 14:30:12
I'm not getting the question clearly. those inputs and outputs are different with respect to the question. |
||||||||||||||
|
2020-05-29 17:43:00
If you try your Python3 (time limit exceeded) code in C++, you won't get that error. |
||||||||||||||
|
2020-05-26 16:14:05
getting runtime error |
||||||||||||||
|
2020-05-25 16:32:11
see dassatyaki's comment it's true. |
||||||||||||||
RSS