目录
问题 A: 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 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.
输出
For each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.
样例输入
2
2 3 5
3 4 6 12
样例输出
15
12
题解
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int gcd(int a, int b){//辗转相除法求最大公约数
if(b == 0){
return a;
}
else{
return gcd(b, a % b);
}
}
int main(){
int t;
while(scanf("%d", &t) != EOF){
while(t--){
int a[100010] = {0};
int n;
scanf("%d", &n);
int i;
for(i = 0; i < n; i++){
scanf("%d", &a[i]);
}
int temp = a[0];
for(i = 1; i < n; i++){
temp = temp / gcd(temp, a[i]) * a[i];
}
printf("%d\n", temp);
}
}
return 0;
}