HDU 1019 Least Common Multiple【gcd+lcm+水+多個數的lcm】Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 53016    Accepted Submission(s): 20171

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

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

Sample Output

Source

<a href="http://acm.hdu.edu.cn/search.php?field=problem&amp;key=East+Central+North+America+2003%2C+Practice&amp;source=1&amp;searchmode=source">East Central North America 2003, Practice</a>

分析：多個數的最小公倍數，直接每次對兩個進行lcm操作就好了，具體代碼如下：