44 人解决，46 人已尝试。
56 份提交通过，共有 116 份提交。
3.1 EMB 奖励。
单点时限: 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.
2 3 5 7 15 6 4 10296 936 1287 792 1
105 10296
44 人解决，46 人已尝试。
56 份提交通过，共有 116 份提交。
3.1 EMB 奖励。