51nod 1012最小公倍数LCM

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 typedef long long ll;
 4 ll gcd(ll x,ll y){
 5     return y?gcd(y,x%y):x;
 6 }
 7 
 8 ll gbs(ll x,ll y){
 9     return x/gcd(x,y)*y;
10 }
11       
12 int main(){
13     ll a,b; 
14     scanf("%lld %lld",&a, &b);
15     ll ans=gbs(a,b); 
16     printf("%lld\n",ans);
17     return 0; 
18 }