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
1 最小公倍数算法（输入两个数，输出两个数的最小公倍数）
你可以自己想自己写
也可以参考https://blog.csdn.net/narzisen/article/details/79832105，也可以参考其它的算法自己百度
剩下的就简单了，一个数列的最小公倍数就是那两个 算个最小公倍数
再拿这个最小公倍数继续和下一个数算最小公倍数
一个循环下来就得到一个数列的最小公倍数
优化算法可能有，就是先给数列排序然后取最大两个数算最小公倍数，然后小的数大概率能整除，那样除法计算次数就会表少。