第十一周 OJ 求最大公约数和最小公倍数

#include <stdio.h>
#include <stdlib.h>
int gcd(int a, int b);
int lcm(int a, int b);
int main()
{
int n,m,gys,gbs;
int gcd(int a, int b);
int lcm(int a, int b);
scanf("%d%d",&n,&m);
gys=gcd(n,m);
gbs=lcm(n,m);
printf("%d %d\n",gys,gbs);
return 0;
}
int gcd(int a, int b)
{
int r;
do
{
r=a%b;
a=b;
b=r;
}while(r!=0);
return a;
}
int lcm(int a, int b)
{
int r,p,gbs;
p=a*b;
do
{
r=a%b;
a=b;
b=r;
}while(r!=0);
gbs=p/a;
return gbs;
}