题解 | #求最小公倍数#

using namespace std;
int main()
{
    int m ,n;    cin>>m>>n;
    int a1 = m; int b1 = n; //储存原始数据
    if (m<n){
        int tmp = m; m = n; n = tmp;
    }
    int rmdr = m % n;
    while(rmdr != 0){
        m = n; n = rmdr; rmdr = m % n;
    }
    int gysMax = n; //n是最大公约数
    cout << a1*b1/gysMax;//两数之积除以最大公约数得最小公倍数 
    return 0;
}