C++求最大公約數，最小公倍數

#include 
using namespace std;
int main()
{
int m,n,a,b,m1;
cout << "請輸入兩個正整數： ";
cin >> m >> n;
if(m>n)
{
a=m;
b=n;
}
else
{
a=n;
b=m;
}
while(m1!=0)
{
   
    m1=a%b;
    a=b;
    b=m1;
}
cout << "最大公約數=" << a<<endl;
cout << "最小公倍數=" << m*n/a;
return 0;
}