HDU-1019 LCM

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
解题思路：
lcm(a,b)=a*b/gcd(a,b)
代码：

#include<bits/stdc++.h>
using namespace std;
inline int read(){
    int x=0,f=0;char ch=getchar();
   	while(ch>'9'||ch<'0')f|=ch=='-',ch=getchar();
    while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
    return f?-x:x;
}
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}
int main(){
	int cnt=read();
	while(cnt--){
		int n=read(),t=read(),p;
		long long ans=t;
		for(int i=1;i<n;++i){
			p=read();
			ans*=p;
			t=gcd(t,p);
			ans/=t;
			t=ans;
		}
		printf("%lld\n",ans);
	}
	return 0;
}