Least Common Multiple
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42968 Accepted Submission(s): 16146
2 3 5 7 15 6 4 10296 936 1287 792 1
105 10296
#include<iostream>
#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<algorithm>
using namespace std;
#define N 100000
long long gcd(long long m,long long n)
{
if(m<n) return gcd(n,m);
if(n==0) return m;
return gcd(m%n,n);
}
int main()
{
int t;
cin>>t;
while(t--)
{
int m;
long long a=1,b;
cin>>m;
for(int i=0;i<m;i++)
{
cin>>b;
a=a*b/gcd(a,b);
}
cout<<a<<endl;
}
return 0;
}
注:
这里没必要建立数组,直接在接收数据的时候求出a和b的最小公倍数即可
在一开始,记a=1,求其最小公倍数