hdu 2028 Lowest Common Multiple Plus

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2028

题目大意：求最小公倍数，用辗转相除法。

#include <stdio.h>
int main ()
{
    int gcd(int a,int b);
    int a,b,n,i,c;
    while (scanf("%d",&n)!=EOF)
    {
        scanf ("%d",&a);
        for (i=1; i<=n-1; i++)
        {
            scanf ("%d",&b);
            c=gcd(a,b);
            a=a/c*b;
        }
        printf ("%d\n",a);
    }
    return 0;
}
int gcd(int a,int b)
{
    if (b==0)
        return a;
    return gcd(b,a%b);
}