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
|
sahil bhatia:
2014-12-08 14:22:17
how to minimize the runtime error please tell .. i am finding hell lot of problem with these runtime errors |
|
Ghareeb:
2014-12-07 23:38:48
the code is ok and works very well but it is still wrong x@@ |
|
computer science:
2014-12-07 19:30:04
compilation error
|
|
JC:
2014-12-05 16:58:08
NZEC -> return 0 |
|
lalit kumar:
2014-12-03 19:26:30
runtime error[NZEC] plz help...
|
|
getting started:
2014-12-01 19:20:38
done finally.......
|
|
parijat bhatt:
2014-12-01 12:48:07
finally accepted in 0.00 after 21 submissions... Use segmented sieve...
|
|
kishore:
2014-11-28 09:55:46
my code is working properly on ideone compiler all the answers are correct..............but iam getting as wrong answer .... can anyone help me with this |
|
BODLOGIIN-ANGUUCH:
2014-11-27 08:22:37
Francky) why u do this broooo |
|
gamer496:
2014-11-05 22:06:30
when i do using a normal algo it works
|
| 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