hdoj 2028 Lowest Common Multiple Plus

                     Lowest Common Multiple Plus

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

Problem Description

求n个数的最小公倍数。

 

Input

输入包含多个测试实例，每个测试实例的开始是一个正整数n，然后是n个正整数。

 

Output

为每组测试数据输出它们的最小公倍数，每个测试实例的输出占一行。你可以假设最后的输出是一个32位的整数。

 

Sample Input

  
  

   
   2 4 6
3 2 5 7
  
  

 

Sample Output

  
  

   
   12
70
  
  

 

Author

lcy

 

AC  CODE:

#include<stdio.h>
#include<string.h>
int gcd(int a ,int b)
{
	return !b?a:gcd(b,a%b);
}
int main()
{
    int n,i,j,a[1000];
    while(~scanf("%d",&n))
    {
		memset(a,0,sizeof(a));
		scanf("%d",&a[0]);
		for(i=1;i<n;i++)
		 { scanf("%d",&a[i]);
			a[i]=a[i-1]*(a[i]/gcd(a[i-1],a[i]));
		 }
		 printf("%d\n",a[i-1]);    //此时i值为n 
	}
    return 0;
}