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. 

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

105
10296
两个两个求最小公倍数，用到辗转相除注意ａ先除最大公约在＊ｂ这样可以避免使用ｌｏｎｇｌｏｎｇ。

#include <iostream>
using namespace std;
#include<string.h>
#include<set>
#include<stdio.h>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include <cstdio>
#include <cstdlib>
#include<cstring>
int qqq(int a,int b)
{
    if(a%b==0)
        return b;
    return qqq(b,a%b);
}
int www(int a,int b)
{
    return a/qqq(a,b)*b;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int a,b;
        a=1;
        while(n--)
        {
            cin>>b;
            if(b>a)
                swap(a,b);
            a=www(a,b);
        }
        cout<<a<<endl;
    }
    return 0;
}