HDU1019

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
  
  
  
  


  
  
  
  


  
  
  
  

   
   

    
    
//	HDU1019 基础题
//	Least Common Multiple
//	2017.05.25 by wyj

#include
      
      
       
       
using namespace std;

int main()
{
	int LCM(int a, int b);
	int N;
	cin >> N;
	while (N--)
	{
		int m;
		int n[10000];
		int i, j;
		cin >> m;
		for (i = 0;i < m;i++)
			cin >> n[i];
		for (i = 1;i < m;i++)
			n[i] = LCM(n[i - 1], n[i]);
		cout << n[m - 1] << endl;
	}

	return 0;
}

//求两个数的最小公倍数
int LCM(int a, int b)
{
	int r, m = a, n = b;
	if (m < n)
	{
		int t = m;
		m = n;
		n = t;
	}
	while (m%n != 0)
	{
		r = m%n;
		m = n;
		n = r;
	}
	return a / n * b;		//先除后乘，避免数据溢出
}