首页 > 其他 > 详细

Lowest Common Multiple Plus(hdu2028)

时间:2016-10-23 02:35:58      阅读:120      评论:0      收藏:0      [点我收藏+]

技术分享

不解释。

#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)

原文:http://www.cnblogs.com/Strugglinggirl/p/5988887.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!