算法笔记-问题 A: Least Common Multiple

问题 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.

样例输入 Copy

2
2 3 5
3 4 6 12

样例输出 Copy

15
12

代码：

#include <bits/stdc++.h>

using namespace std;

int gcb(int a, int b){
    if(a < b) swap(a, b);
    if(b==0) return a;
    else return gcb(b, a%b);
}

int main() {
    int n;
    while(scanf("%d", &n)!=EOF){
        for(int i=0; i<n; i++){
            vector<int> nums;
            int m;
            scanf("%d", &m);
            for(int j=0; j<m; j++){
                int a;
                scanf("%d", &a);
                nums.push_back(a);
            }
            int ans = nums[0];
            for(int k=1; k<m; ++k){
                int temp = gcb(ans, nums[k]);
                ans = ans / temp * nums[k];
            }
            printf("%d\n", ans);
        }
    }
    return 0;
}