猫史档案馆


1大因 2小倍

用户:FSDVSVSFSDVSVS查看:0 回复:0 评论:0 创建时间:2020-05-04T14:30:44


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

long long gcd(long long x, long long y)
{
    while (min(x,y) != 0)
    {
        if (x > y) x %= y;
        else y %= x;
    }
    return max(x,y);
}

int main()
{
    long long a, b;
    cin >> a >> b;
    cout << gcd(a, b) << endl;
    return 0;
}
# include <iostream>
# include <algorithm>
using namespace std;

long long gcd(long long x, long long y)
{
    while (min(x,y) != 0)
    {
        if (x > y) 
            x %= y;
        else 
            y %= x;
    }
    return max(x, y);
}

int main()
{
    long long a, b;
    cin >> a >> b;
    long long lcm = a  / gcd(a,b) * b;
    cout << lcm << endl;
    return 0;
}


回复

上一页1 页 / 共 0下一页