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
|
amitkr100:
2017-12-19 22:11:49
Make Seive for 1-10^6 then extract and store all prime numbers, Now if you need prime >10^6 use stored prime numbers.
|
|
aishwarya100:
2017-12-19 14:52:50
Time limit exceeded! |
|
namanruhela03:
2017-12-14 15:23:49
i don't understand it will always showing TLE again and again ??? |
|
mrinaal007:
2017-12-11 16:11:14
The code is compiled correctly but TLE is coming out of the blue! |
|
utsav807:
2017-12-10 14:47:36
On ide its running successfully under allowed time limit and memory limit, however on submission its showing time limit exceeded. |
|
aman9d:
2017-12-08 15:45:36
TLE what to do |
|
neelaksh_07:
2017-12-01 20:17:41
time limit exceeded..what to do
|
|
marcel_39:
2017-11-27 13:49:42
Anyone figured out this runtime error? same problem here
|
|
daddythicc:
2017-11-21 21:33:13
my answer is correct but it says ts wrong..... |
|
ajay_raj_:
2017-11-20 15:10:28
I used command line and my code executed well... Here i get runtime error. |
| 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