首页 > 代码库 > Lowest Common Multiple Plus(hdu2028)

Lowest Common Multiple Plus(hdu2028)

技术分享

不解释。

#include<stdio.h>
int gcd(unsigned x, unsigned y)
{
    unsigned r;
    while ((r = x%y) != 0)
    {
        x = y;
        y = r;
    }
    return y;
}
int lcm(unsigned x, unsigned y)
{
    unsigned d;
    d = gcd(x, y);
    return (x*y / d);
}
int main()
{
    int  n;
    char d;
    while (scanf_s("%d%c",&n,&d)!=EOF)
    {
        unsigned d1 = 1;
        for (int k = 1; k <= n; k++)
        {
            unsigned  a;
            scanf_s("%u", &a);
            d1 = lcm(d1, a);
        }
        printf("%u\n", d1);
    }
}

 

Lowest Common Multiple Plus(hdu2028)