求两数最大公约数和最小公倍数

#include <iostream>
using namespace std;
void swaptwo(int &a,int &b)
{
int t=a;
a=b;
b=t;
}
int yushu(int n,int m)
{
if (n<m)
{
swaptwo(n,m);
}
return n%m;
}
int main()
{
int n1=60,n2=80;
int num1=n1,num2=n2;
int gcd;
if (yushu(num1,num2)==0)
gcd = num2;
else
{
int temp=0;
while ((temp=yushu(num1,num2))!=0)
{
num1=num2;
num2 = temp;
}
gcd = num2;
}
cout << gcd <<endl;
cout << n1*n2/gcd << endl;  //最小公倍数
return 0;
}