hdu1019 求解最小公倍数 java

http://acm.hdu.edu.cn/showproblem.php?pid=1019

Least Common Multiple

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

 

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

最小公倍数 lcm = a * b / gcd(a, b);

 

 

import java.util.Scanner;

public class Main {
	@SuppressWarnings("resource")
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		while (scanner.hasNext()) {
			int t = scanner.nextInt();
			for (int i = 0; i < t; i++) {
				int n = scanner.nextInt();
				long ans = 1;
				for (int j = 0; j < n; j++) {
					ans = lcm(scanner.nextLong(), ans);
				}
				System.out.println(ans);
			}
		}
	}

	private static long gcd(long ans, long nextInt) {
		// TODO Auto-generated method stub
		if (nextInt == 0) {
			return ans;
		}
		return gcd(nextInt, ans % nextInt);
	}
	public static long lcm(long ans, long nextInt) {
		return (ans * nextInt) / gcd(ans, nextInt);
	}
}