hdu 1019

                                 Least Common Multiple
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 46238 Accepted Submission(s): 17405


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

105

10296

没什么好说的就是求最小公倍数

<span style="font-size:18px;">

#include <iostream>
#include<cstdio>
using namespace std;
__int64 judge(__int64 a,__int64 b)
{
    while(b!=0)
    {
        __int64 temp=a%b;
        a=b;
        b=temp;
    }
    return a;
}
int main()
{
    int t,n;
    scanf("%d",&t);
    while(t--)
    {
        __int64 a,b;
        scanf("%d",&n);
        scanf("%I64d",&a);
        n--;
        while(n--)
        {
            scanf("%I64d",&b);
            __int64 c=judge(a,b);
            a=a*b/c;
        }
        printf("%I64d\n",a);
    }
    return 0;
}</span>