HDU 1019(最小公倍数)

#include <cstdio>
#include <cstring>

int gcd(int a, int b)
{
if (a < b) a^=b^=a^=b;
while (b^=a^=b^=a%=b);
return a;
}

int main()
{
int n, t, a, b;
scanf("%d", &n);
while (n--)
{
scanf("%d", &t);
if (t == 1)
{
scanf("%d", &a);
printf("%d\n", a);
continue;
}
t -= 2;
scanf("%d%d", &a, &b);
a = a/gcd(a, b)*b;
while (t--)
{
scanf("%d", &b);
a = a/gcd(a, b)*b;
}
printf("%d\n", a);
}
}