Least Common Multiple

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

 

意思: 输入一个T 然后输入T个n n后面有m个数 求m个数的最小公倍数

这里可以运用到欧几里德定理

也就是gcd(a,b)=gcd(b,a%b) 当b=0的时候 就得到了最大公约数a 最小公倍数就是a*b/最大公约数

#include<stdio.h>

int gcd(int a,int b)
{
	if(b==0)
		return a;
	return gcd(b,a%b);
}

int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		int n,a[999];
		scanf("%d",&n);
		int i;
		for(i=0;i<n;i++)
			scanf("%d",&a[i]);
		for(i=0;i<n-1;i++)
			a[i+1]=a[i]/gcd(a[i],a[i+1])*a[i+1];
		printf("%d\n",a[n-1]);
	}
}