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
|
aagnihotri:
2015-06-28 19:55:22
This was a tough one. I used PHP. You should look into the Miller-Rabin method. And check to see if there is a native implementation of it. |
|
dumborakesh:
2015-06-28 17:55:06
Can any one help? What to do.... Time limit exceed |
|
|
dumborakesh:
2015-06-28 17:52:56
Omg .. Time limit exeed .. What is this ... ?? 5 time |
|
Ashish:
2015-06-27 10:36:48
AC in first go, 0.00 :) |
|
adityaparmar:
2015-06-26 22:22:41
take uint variable
|
|
atg_abhishek:
2015-06-26 18:17:55
Works correctly here but I still keep getting a NZEC, can anyone help? http://ideone.com/4McRBf |
|
poojan :
2015-06-26 17:58:02
why wrong ans????????????????????????????????????????????????????? |
|
nihalar:
2015-06-24 21:45:03
Here are some tips for faster execution:
|
|
ankur_gupta54:
2015-06-23 10:09:28
Can anyone help me... I am getting tle? |
|
rohanp_91:
2015-06-22 14:59:22
I can't be sure about one thing. The constraints given on the inputs, are they already provided? As in can we take them as given or do we have to check for them? |
| 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