辗转相除法求最大公约数。原数除以最大公约数就是最小公倍数了!
code:
#include<iostream.h>
int gcd(int a,int b)
{
if(b!=0)
return gcd(b,a%b);
else
return a;
}
int gcd2(int a,int b)
{ int r;
while(b!=0)
{ r=a%b;
a=b;
b=r;
}
return a;
}
int aaa(int temp,int x)
{ int a,temp2;
a=temp;
temp*=x;
while(x!=0)
{
temp2=a%x;
a=x;
x=temp2;
}
temp/=a;
return temp;
}
int main()
{
int m,n;
while(cin>>m>>n)
{
cout<<"递归求:"<<gcd(m,n)<<endl;
cout<<"循环求:"<<gcd2(m,n)<<endl;
cout<<aaa(m,n)<<endl;
}
}