如何求n个数的最小公倍数

question: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.

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
	long long t,p,a[1000],b[1000];
	cin>>t;
	while(t--)
	{
		cin>>p;
		b[0]=1;
		for(int i=0;i<p;i++)
		{
			cin>>a[i];
			if(a[i]==0)
				printf("0\n");
		}
		
		for(int i=0;i<p;i++)
			b[i+1]=b[i]*a[i]/__gcd(b[i],a[i]);
		printf("%lld\n",b[p]);
	}
	return 0;
}

注意：如果只输入一个数，其本身就是最小公倍数，最小公倍数可能超过int的范围。