[OpenJudge-NOI]最大公约数与最小公倍数

代码

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;

ll Gcd(ll a,ll b) {
if(b==0) return a;
return Gcd(b,a%b);
}

ll gcd,lcm,minn=10000000,a,b;

int main() {
cin>>gcd>>lcm;
ll i,j;
if(lcm%gcd!=0){
cout<<"0"<<endl;
return 0;
}
for(i=1;i<=100000;i++) {
j=gcd*lcm/i;
a=gcd*i;
if(gcd*lcm%a==0){
b=gcd*lcm/a;
if(Gcd(a,b)==gcd){
if(minn>=a+b) {
minn=a+b;
}
}
}

}
cout<<minn<<endl;
}