1528. Least Common Multiple

先从数论开始~

最大公约数和最小公倍数的问题。

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

23 5 7 156 4 10296 936 1287 792 1

Sample Output

10510296

#include<iostream>#include<stdio.h>using namespace std;int gcb(int a,int b){if(b==0)return a;return gcb(b,a%b);}int main(){int n,m,N,lcd,a,gcd;cin>>N;while(N--){cin>>m>>n;lcd=n;for(int i=1;i<m;i++){cin>>a;//gcd=gcb(a,lcd);//lcd=lcd*a;//cout<<lcd<<endl;lcd=lcd/gcb(lcd,a)*a;//cout<<lcd<<endl;}cout<<lcd<<endl;}return 0;}