寒假翻译题训练 2月11号

链接：https://acs.jxnu.edu.cn/problem/HDU1019

题目：

描述：

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.

翻译如下

描述：

最小的公倍数（LCM）是能被一组整数里所有数都整除的最小的数。比如，5，7，15的LCM就是105。

输入：

输入包含多组样例。第一行包含一个整数，表示样例的组数。每个样例各占一行，样例的第一个数表示该样例的整数组中的个数m，接下来m个整数分别为n1 n2 n3 ...，表示整数组里的每个整数。

所有的数据均为正数，并且范围在32位整数之内。

输出：

对于每组样例，输出该样例的LCM。所有的数据范围均在32位整数之内。