#include<bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
	if (b == 0)
		return a;
	return gcd(b, a % b);
}//求最大公约数

int main()
{
	long long m,x,y,i,p=0;
	cin>>m>>x>>y;
	if(m!=1)//判断输出要求
	{
		i=gcd(x,y);
		cout<<i;
	}
	else
	{
		i=gcd(x,y);
		i=(x*y)/i;//求最小公倍数
		cout<<i;
	}
    return 0;
}

参考代码(C++):

#include <bits/stdc++.h>
using namespace std;

long long gcd(long long a, long long b) {
    while (b != 0) {
        long long tmp = a;
        a = b;
        b = tmp % b;
    }
    return a;
}

int main() {

    long long m, x, y;
    cin >> m >> x >> y;
    if (m == 0) {
        cout << gcd(x, y) << "\n";
    } else {
        cout << x * y / gcd(x, y) << "\n";
    }

    return 0;
}