| 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
|
||||||||||||||
|
2013-08-01 17:45:56 ROHIT KUMAR
its done aftr 2 months... nice prob :) |
||||||||||||||
|
2013-08-01 09:46:21 vids
I am getting compilation error bcoz of sqrt(n), and header file, 'math'. what is the header file for sqrt, in c++. |
||||||||||||||
|
2013-07-31 16:25:45 vaibhav kumar
[code removed] wrong answer help plese !!!!!! "Notes: 1. Don't post any source code here." Last edit: 2013-07-31 17:45:14 |
||||||||||||||
|
2013-07-29 07:08:34 vids
I coded this problem, and got the same solution also. Still it is saying 'wrong answer'. Last edit: 2013-07-29 07:08:58 |
||||||||||||||
|
2013-07-27 08:20:53 rishi
the greeks have the answer |
||||||||||||||
|
2013-07-26 14:20:01 Mostafa 36a2
@mohamed gouda : your algorithm checks every number between m and n with a O(n) test if m==1000000 and n==1010000 you have to do 10000*1000000 cycle :P and this is too long . try your code on this case: 1 100000000 100100000 |
||||||||||||||
|
2013-07-23 04:31:19 Mohamed Gouda
i keep getting TLE i don't no why can somebody help , this is my code ( code removed :) ) Last edit: 2013-07-27 05:13:45 |
||||||||||||||
|
2013-07-18 15:42:28 innovolt
finally seive works run in 5.63s |
||||||||||||||
|
2013-07-18 13:55:12 paes marca
compilation error gcc-4.3 -c -O2 -x ada prog.ada prog.ada:1:01: compilation unit expected prog.ada:3:29: illegal character, replaced by "(" prog.ada:5:49: illegal character, replaced by "(" prog.ada:7:23: == should be = why! |
||||||||||||||
|
2013-07-16 17:28:42 GuiXin
notice this "n (1 <= m <= n <= 1000000000, n-m<=100000)" n may be large. i still fail now |
||||||||||||||
RSS