编程之美2.6-2.7 最大公约数

bool iseven(int a){if(a&1==0)return true;elsereturn false;}int gcd(int a,int b){int result=1,tmp;while((b!=0)&&(a!=0)){if(a<b){tmp=a;a=b;b=tmp;}if(iseven(a)){if(iseven(b)){a/=2;b/=2;result*=2;}elsea/=2;}else{if(iseven(b))b/=2;else{tmp=a;a=b;b=tmp;b=b-a;}}}return result*a;}

最小公倍数=a*b/gcd(a,b)