/*利用辗除法。*/
#include<iostream>
using namespace std;
int main()
{
int fac2(int a,int b);
int fac1(int a,int b);
int m,n;
cout<<"请输入两个数:"<<endl;
cin>>m>>n;
if(m<n)
{
int t;
m=t;
t=n;
n=m;
}
fac1(m,n);
cout<<"最大公约数为:"<<fac1(m,n)<<endl;
cout<<"最小公倍数为:"<<fac2(m,n)<<endl;
return 0;
}
int fac1(int a,int b)
{
int v;
while(a%b!=0)
{
v=a%b;
a=b;
b=v;
}
return b;
}
int fac2(int a,int b)
{
return a*b/fac1(a,b);
}