| 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
|
||||||||||||||
|
2015-06-27 10:36:48 Ashish
AC in first go, 0.00 :) |
||||||||||||||
|
2015-06-26 22:22:41
take uint variable and I*I instead of math.sqrt in loops no runtime error will be faced |
||||||||||||||
|
2015-06-26 18:17:55
Works correctly here but I still keep getting a NZEC, can anyone help? http://ideone.com/4McRBf |
||||||||||||||
|
2015-06-26 17:58:02 poojan
why wrong ans????????????????????????????????????????????????????? |
||||||||||||||
|
2015-06-24 21:45:03
Here are some tips for faster execution: 1. Only check odd numbers (All even numbers are non prime except 2) 2. Make the condition i<=Math.sqrt(n) Hope it helps! :) |
||||||||||||||
|
2015-06-23 10:09:28
Can anyone help me... I am getting tle? |
||||||||||||||
|
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? |
||||||||||||||
|
2015-06-22 10:24:54
i have use logic to find divisor tiill square root of that nuumber i am getting correct ans but time limit exceeded what to do |
||||||||||||||
|
2015-06-17 13:50:07 siddharth rai
plzz help getting tle...earlier i used 3 nested loops now using 2 loops still getting tle...i have coded in both c and java..but getting tle in both :( |
||||||||||||||
|
2015-06-16 11:51:41
my code is running properly on ideone but here it's showingg wrong answer.....!! |
||||||||||||||
RSS