辗转相除法求最大公约数和最小公倍数

最大公约数
#include<stdio.h>
int gcd(int a, int b)
{
while(b > 0)
{
int tem = a % b;
a = b;
b = tem;
}
return a;
}
int main()
{
int n, m;
scanf("%d %d",&m,&n);
printf("%d\n",gcd(m,n));
return 0;
}

最小公倍数

#include<stdio.h>
int gcd(int a, int b)
{
while(b > 0)
{
int tem = a % b;
a = b;
b = tem;
}
return a;
}
int main()
{
int n, m;
scanf("%d %d",&m,&n);
printf("%d\n",m * n / gcd(m,n));
return 0;
}