HDU 1019 Least Common Multiple

最新推荐文章于 2022-02-14 22:34:26 发布

wpfengqi

最新推荐文章于 2022-02-14 22:34:26 发布

阅读量255

点赞数

分类专栏： hdu ACM 水题128题文章标签： integer output numbers input each ini

本文链接：https://blog.csdn.net/wpfengqi/article/details/8039028

版权

hdu ACM 水题128题专栏收录该内容

61 篇文章 0 订阅

订阅专栏

Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17945 Accepted Submission(s): 6671

Problem Description

The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105.

Input

Input will consist of multiple problem instances. The first line of the input will contain a single integer indicating the number of problem instances. Each instance will consist of a single line of the form m n1 n2 n3 ... nm where m is the number of integers in the set and n1 ... nm are the integers. All integers will be positive and lie within the range of a 32-bit integer.

Output

For each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.

Sample Input

  
  
   
   2
3 5 7 15
6 4 10296 936 1287 792 1

Sample Output

Source

East Central North America 2003, Practice

Recommend

JGShining

分析：本题就是求多个数的最小公倍数，2个数的最小公倍数的求法就是a*b/(a,b的最大公约数)，然后依次套用公式即可

代码：（注意a先除以gcd(a,b)再乘以b这样做防止a*b数据过大溢出）

#include<stdio.h>

int gcd(int a,int b)
{
    if(b==0)
        return a;
    else
        return gcd(b,a%b);
}

int lcm(int a,int b)
{
    return a/gcd(a,b)*b;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,i,t;
        int temp=1;
        scanf("%d",&n);
        for(i=0;i<n;i++)
        {
            scanf("%d",&t);
            temp=lcm(temp,t);
        }
        printf("%d\n",temp);
    }
    return 0;
}