翻译（19）

题目：Least Common Multiple | JXNUOJ

描述：

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.
一组正整数的最小公倍数是能被集合中所有数整除的最小正整数。比如，5,7和15的最小公倍数是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.

输入包括大量例子。输入第一行包括一个整数表示问题例子的数量。每例由单行m n1 n2 n3 ... nm组成，m是集合中整数的数量，n1 ... nm是整数。所有的整数都是正的并且在32位整数范围内。

输出：

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。所有的结果都在32位整数范围内。

词汇：

divisible 能被整除的 instance 例子 lie within 在...范围内