杭电1019

Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 22572    Accepted Submission(s): 8404

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
  
  

 

Java代码：

import java.util.*;

public class Main {
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        while(a-- != 0){
            int n = sc.nextInt();
            int k = 1;
            while(n-- != 0){
                int w = sc.nextInt();
                k = LCM(k,w);
            }
            System.out.println(k);
        }
    }
    
    public static int LCM(int k,int a){
        int kk,aa;
        kk = k>a? k:a;
        aa = k>a? a:k;
        int r;
        while(aa != 0){
            r = kk%aa;
            kk = aa;
            aa = r;
        }
        return k/kk*a;
    }
}

从前之后辗转相除求出最大公约数，得出两数的最小公约数，然后与下一个数进行操作。

注意：防止溢出须先除后乘。