| 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
|
||||||||||||||
|
2017-03-17 19:39:55
finally.. after 9 attempts :D |
||||||||||||||
|
2017-03-15 15:30:08
an easy AC |
||||||||||||||
|
2017-03-15 01:45:45
After so much try........... Finally AC!!! |
||||||||||||||
|
2017-03-08 13:57:30 sunny
Use sieve .simple :-). |
||||||||||||||
|
2017-03-07 15:46:47
why wrong answer........ |
||||||||||||||
|
2017-03-06 14:58:01
After 8 attempts finally an AC!!!! :D |
||||||||||||||
|
2017-03-06 11:54:04
My code is working fine in ideone, but here it says wrong ans. what to do? |
||||||||||||||
|
2017-03-03 13:38:37
How should I do？My code can only determine the number from 2 to 1000000 |
||||||||||||||
|
2017-03-02 10:17:23
sieve of eratosthenes :D |
||||||||||||||
|
2017-03-01 15:10:45
My code runs perfectly on my laptop. But when i submit my solution on SpOJ, it is giving runtime errors. Everything is perfect in my code. Any clue?? Please Help... |
||||||||||||||
RSS