最小公倍数及最大公约数

*********************************************************************

#include <stdio.h>

int gcd(int x,int y)

{return y==0?x:gcd(y,x%y);}

int
lcd(int a,int x,int y)

{return(x*y/a);}

intmain()

{

int x,y;

scanf("%d%d",&x,&y);

printf("最大公约数是%d\n",gcd(x,y));

printf("最小共倍数是%d\n",lcd(gcd(x,y),x,y));}

return 0;

}

******************************************************************

#include<iostream>

using namespace std;

int gcd(int x, int y)

{
if (x < y)
{
int t = y;
y = x;
x = t;
}
while (y != 0)
{
int r = x%y;
x = y;
y = r;
}
return x;

}

int main()

{
int a, b;
cin >> a >> b;
cout << gcd(a, b) << ' ';
cout << a*b / gcd(a, b);
return 0;

}