三个数gcd与lcm

给定三个数，求出它们的最大公约数和最小公倍数：gcd(a,b,c)=gcd(gcd(a,b),c)，lcm(a,b,c)=a*b*c/gcd/gcd。

/*------------------Header Files------------------*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <ctype.h>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <limits.h>
using namespace std;
/*------------------Definitions-------------------*/
#define LL long long
#define PI acos(-1.0)
#define INF 0x3F3F3F3F
#define MOD 10E9+7
#define MAX 500050
/*---------------------Work-----------------------*/
int gcd(int a,int b)
{
	return b==0?a:(gcd(b,a%b));
}
void work()
{
	int a,b,c;
	scanf("%d%d%d",&a,&b,&c);
	int ans=gcd(a,b);
	ans=gcd(ans,c);
	printf("最大公约数:%d\n",ans);
	printf("最小公倍数:%d\n",(a*b*c)/(ans*ans));
}
/*------------------Main Function------------------*/
int main()
{
	//freopen("test.txt","r",stdin);
	//freopen("cowtour.out","w",stdout);
	//freopen("cowtour.in","r",stdin);
	work();
	return 0;
}