n个数 的gcd最大公约数 以及lcm最小公倍数

#include <iostream>
#include <cstring>
using namespace std;

/*
    gcd lsm
*/

int gcd(int a, int b) {
    return !b?a:gcd(b, (a % b));
}

int lcm(int a,int b) {
    return a * (b / gcd(a, b));
}

int main() {
    int a[4];
    int lcm1=1;
    for (int i = 0; i < 4; i++) {
        cin >> a[i];
    }
    //cin >> a >> b;
    for (int i = 0; i < 4;i++) {
         lcm1=lcm(lcm1, a[i]);
    }
    cout << lcm1;

    /*int a[3];
    int key;

    for (int i = 0; i < 3;i++) {
        cin >> a[i];
    }
    if(a[0]>a[1])
        key = gcd(a[0], a[1]);
    else
    {
        key = gcd(a[1], a[0]);
    }
    cout << key << endl;
    for (int i = 2; i < 3;i++) {
        if (key > a[i])
            key = gcd(key, a[i]);
        else
            key = gcd(a[i],key);
        cout << key << endl;
    }*/
    //cout <<key<<endl;
    return 0;
}