Lowest Common Multiple Plus
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 50348 Accepted Submission(s): 20830
Problem Description
求n个数的最小公倍数。
Input
输入包含多个测试实例,每个测试实例的开始是一个正整数n,然后是n个正整数。
Output
为每组测试数据输出它们的最小公倍数,每个测试实例的输出占一行。你可以假设最后的输出是一个32位的整数。
Sample Input
2 4 6 3 2 5 7
Sample Output
12 70
Author
lcy
AC代码:
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<iomanip>
#include<algorithm>
typedef long long LL;
using namespace std;
int gcd(int a,int b)
{
if(!b) return a;
return gcd(b,a%b);
}
int lcm(int a,int b)
{
return a/gcd(a,b)*b;
}
int main()
{
int n,Lcm;
int a[1000];
while(cin>>n){
memset(a,0,1000*sizeof(int)); //memset(a,0,sizeof(a));
for(int i=0;i<n;++i)
cin>>a[i];
Lcm = a[0];
for(int i=1;i<n;++i){
Lcm=lcm(Lcm,a[i]);
}
cout << Lcm << endl;
}
return 0;
}