最大公约数和最小公倍数问题题解

#include <bits/stdc++.h>
using namespace std;
int shu(int a,int b){
    int d = b;
    while(a % b != 0){
        d = a % b;
        a = b;
        b = d;
    }
    return d;
}
int main(){
    int x,y;
    cin >> x >> y;
    int k = 0;
    for(int i = x;i <= y;i ++){
        for(int j = x;j <= y;j ++){
            if(i * j == x * y && shu(i, j) == x && i * j / shu(i, j) == y) k ++;
        }
    }
    cout << k << endl;
    return 0;
}