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
这题第一次提交的时候显示的是WA,原因在于第一次没有对操作数a,b取模,导致a,b早就超出了int 可以表示的范围,同时这个错误很隐蔽,我通过输出b(两个操作数中大的那个 )的值才发现正负交错,早就越界了!
所以对于与mod有关的题目,一定要有对操作数提早取模的意识!
AC代码