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
  
  

 

 

Source

East Central North America 2003, Practice

 

 

Recommend

JGShining

答案：

#include <stdio.h>

int main()
{
 int n, m, i;
 long v[100], max, r;

 scanf("%d", &n);
 while (n--)
 {
  scanf("%d", &m);
  max = 0;
  for (i = 0; i < m; ++i)
  {
   scanf("%d", &v[i]);
   if (max < v[i])
    max = v[i];
  }
  r = 0;
  while (true)
  {
   r += max;
   for (i = 0; i < m; ++i)
   {
    if (v[i] == max)
     continue;
    if (r%v[i] != 0)
     break;
   }
   if (i == m)
    break;
  }
  
  printf("%d/n", r);
 }
 
 return 0;
}