寻找一个马上回复的大神
用while循环求两个正整数的最小公倍数
unsigned std_gcd( unsigned a, unsigned b ) { for( ; b!=0; ) { unsigned t = a; a = b; b = t%b; } return a; } unsigned std_lcm( unsigned a, unsigned b ) { return (a==0&&b==0) ? 0 : a/std_gcd(a,b)*b; }