求任意三个数的最小公倍数

#include <iostream>#include <vector>using namespace std;int maxNum(int x, int y, int z){    if (x>y && x>z)        return x;    else if(y>x && y>z)        return y;    else         return z;}int main(){    int x,y,z;    cin>>x>>y>>z;    int max_n = maxNum(x,y,z);    int flag = 1;    int res = 1;    for (int i=2;i<=max_n;++i)    {        flag = 1;        while (flag) //用while 是防止出现 1,4,8这种情况        {            flag = 0;            if (0 == x%i)            {                x /= i;                flag = 1;            }            if (0 == y%i)            {                y /= i;                flag = 1;            }            if (0 == z%i)            {                z /= i;                flag = 1;            }            if (flag)            {                res *= i;            }        }    }    cout<<"("<<x<<','<<y<<','<<z<<")的最小公倍数为："<<res<<endl;    return 0;}