#include<stdio.h>
int gcd(int a, int b)
{
if (a < b)
{
int x = a;
a = b;
b = x;
}
if (a%b == 0)
return b;
return gcd(b, a%b);
}
int main()
{
int T, a, b, n;
scanf("%d", &T);
while (T--)
{
scanf("%d", &n);
scanf("%d", &a);
for (; n > 1; n--)
{
scanf("%d", &b);
a = a/gcd(a, b) *b; //注意这里写成 a*b/gcd(a, b) 就会WA
}
printf("%d\n", a);
}
}
hdu 1019 Least Common Multiple
最新推荐文章于 2018-12-21 22:26:59 发布