HDU 2028 Lowest Common Multiple Plus

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		@SuppressWarnings("resource")
		Scanner in = new Scanner(System.in);
		
		while(in.hasNext()) {
			int n = in.nextInt();
			int arr[] = new int[n];
			for(int i=0;i<n;i++) {
				arr[i] = in.nextInt();
			}
			LCM(arr, n);
		}
	}

	public static void LCM(int[] arr, int n) {
		int tempMax = arr[0];
		//找出最大的值
		for(int i=0;i<n;i++) {
			if(tempMax<arr[i]) {
				tempMax = arr[i];
			}
		}
		
		//从tempMax开始寻找最小公倍数
		int lcm = 0;
		for(int i=tempMax;;i++) {
			int flag = 0;
			for(int j = 0;j<n;j++) {
				if(i%arr[j]!=0) {
					flag = 1;
				}
			}
			if(flag==1) {
				continue;
			}else {
				lcm = i;
				break;
			}
	  }
		 System.out.println(lcm);
	}
}