杭电1019 Least Common Multiple

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

这道题很奇怪。。明明题目上说是32位的，但必须得定义为long long型的才给过，不懂为什么…

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
#define ll long long
ll gcd(ll a,ll b)
{
	if(b==0) return a;
	else return gcd(b,a%b);
}
int main()
{
	ll t,n,a[50],ans,i;
	scanf("%lld",&t);
	while(t--)
	{
		scanf("%lld",&n);
		for(i=0;i<n;i++)
		scanf("%lld",&a[i]);
		if(n==1)
		{
			printf("%lld\n",a[0]);
		}
		else
		{
			sort(a,a+n);
		    for(i=0;i<n-1;i++)
		    {
			    ans=gcd(a[i],a[i+1]);
			    a[i+1]=a[i]*a[i+1]/ans;
		    }
		    printf("%lld\n",a[n-1]);
		}		
	}
}