알고리즘16 :: BOJ_13241_최소공배수

#include<bits/stdc++.h>
using namespace std;
const int MAX = 1000000;
int prime[MAX];
int pn;
bool check[MAX+1];
int gcd(int a, int b){
    if(b==0)
        return a;
    if(b==1)
        return 1;
    gcd(b, a%b);
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    long long int a,b;
    cin>>a>>b;
    
    int _gcd = gcd(a,b);
    
    cout<<(a*b)/_gcd<<endl;
    
}