最大公约数和最小公倍数模板

int gcd(int a,int b){    return b==0?a:gcd(b,a%b);}int lcm(int ab,int a,int b){    return ab/gcd(a,b);}

hdu-1108

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