hdoj最小公倍数



/*Least Common Multiple

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 0   Accepted Submission(s) : 0

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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*/

<span style="font-size:18px;"># include<stdio.h>
int m,i,a[1000],n,k;
int gcd(int a,int b)
{
 if(b==0)
 return a;
 else return gcd(b,a%b);//判断最大公约数 
}
int main()
{
 scanf("%d",&n);
 while(n--)
 {
 scanf("%d",&m);
 for(i=0;i<m;i++)
 {
 scanf("%d",&a[i]);
    }
    if(m==1)//不要忘记 
    {
     printf("%d\n",a[0]);
     continue;
    }
    k=a[0]/gcd(a[0],a[1])*a[1];
    for(i=2;i<m;i++)
    {
     k=k/gcd(k,a[i])*a[i];
    }
    printf("%d\n",k);
 }
 return 0;
}
</span>