《算法笔记》5.2小节——数学问题->最大公约数与最小公倍数 问题 A: Least Common Multiple

                                问题 A: Least Common Multiple

题目描述

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 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.

输出

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

样例输入

2
2 3 5
3 4 6 12

样例输出

15
12

AC代码：

#include<cstdio>
int gcd( int a , int b )
{
   if( b == 0 ) return a;
   else return gcd( b, a%b );
}
int lcm( int a , int b )
{
  int d = gcd(a,b);
  return a / d * b;
}
int main()
{
    int n,m;
    while(scanf("%d",&n)!=EOF)
    {
        while(n--)
        {
            scanf("%d",&m);
            int num[m];
            for(int i=0;i<m;i++)
            {
                scanf("%d",&num[i]); 
            }
            int res=num[0];
            for(int i=1;i<m;++i){
               res= lcm(res,num[i]);
            }
            printf("%d\n",res);
        }
    }
    return 0;
}
/**************************************************************
    Problem: 2136
    User: 2015212040209
    Language: C++
    Result: 正确
    Time:0 ms
    Memory:1116 kb
****************************************************************/