HDU-ACM1019

Least Common Multiple

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

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
  
  

import java.util.Scanner;

class Main{
    public static void main(String[] args) {
        Scanner input=new Scanner(System.in);
        int n=input.nextInt();
        while (n-->0){
        	int m=input.nextInt();
        	int arr[]=new int[m];
        	int max=0;
        	int c=0;
        	for (int i=0;i<arr.length;i++){
        		arr[i]=input.nextInt();
        		if (arr[i]>max){
        			max=arr[i];
        		}
        	}
        	int t=max;
        	while (c!=arr.length){
        		c=0;
        		for (int i=0;i<arr.length;i++){
        			if(max%arr[i]==0){
        				c++;
        			}else {
        				max+=t;
        				break;
        			}
        		}
        	}
        	System.out.println(max);
        }
    }
}