1950. Least Common Multiple

单点时限: 2.0 sec

内存限制: 256 MB

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.


3 5 7 15
6 4 10296 936 1287 792 1

43 人解决,44 人已尝试。

55 份提交通过,共有 114 份提交。

3.0 EMB 奖励。

创建: 14 年,1 月前.

修改: 4 年,8 月前.

最后提交: 1 月,3 周前.

来源: East Central North America 2003, Practice