haomeili2007-07-18 04:54:57
Write a C++/C function which prints out prime integers, i.e., given an input X, print out all its prime numbers. For example,

if X=20, prime elements will be: 1, 2, 3, 5, 7, 9, 11, 13, 17, 19.
If X= 100, primes are: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97.


void (int X)
{
???????
???????
}


Thanks.
haomeili2007-07-18 04:57:04
Correction: 回复:A C++ interview question
MGM2007-07-18 05:28:24
这是一个数学问题,算法不难, 不像interview能遇到的
MGM2007-07-18 05:30:26
last line should be: if is_prime then print i
上中下2007-07-18 06:16:54
回复:A C++ interview question
MGM2007-07-18 06:50:12
"if round i/j=0, i=i-1, count=0;" 这里递减i的值是不对的
连续工作2007-07-18 12:49:14
你数学怎么学的?!
德州女孩2007-07-18 14:49:26
你这么凶把女孩子们都吓跑了...
鸡毛蒜皮2007-07-18 19:19:35
回复:1 is a prime number? I don't think so!
德州老外2007-07-19 03:56:49
你也强不到哪里去