#include<iostream> |
using namespace std; |
int get_least_common_multiple( int a, int b){ //这个函数用于得到最小公倍数 |
int init_data1, init_data2; |
init_data1 = a; |
init_data2 = b; |
if (a < b){ |
int t; |
t = a; |
a = b; |
b = t; |
} |
int c; |
while ((c = a % b ) != 0){ //辗转相除法求最大公约数 |
a = b; |
b = c; |
} |
//long long int t1 = (init_data1 * init_data1); |
return init_data1 / b * init_data2; //注意防止溢出 |
//这是求最小公倍数的数学公式 |
} |
int main(){ |
int a, b; |
int n, m; |
cin>>n; |
for ( int i = 0; i < n; i++){ |
cin>>m; |
cin>>a; |
for ( int j = 0; j < m - 1; j++){ |
cin>>b; |
a = get_least_common_multiple(a, b); |
} |
cout<<a<<endl; |
} |
} |