Benefit UVA - 11889

Benefit

 UVA - 11889 

 题意： 给出a和c， 让求最小的b使得lcm(a, b) == c.

#include <bits/stdc++.h>
using namespace std;

int gcd(int a, int b){
    return b == 0 ? a : gcd(b, a % b);
}
int main(){
    int a, c;
    int t;
    scanf("%d", &t);
    while(t--){
        scanf("%d %d", &a, &c);
        if(c % a){
            puts("NO SOLUTION");
        }else{
            int b = c / a;
            int g = gcd(a, b);
            while(g != 1){
                b *= g;
                a /= g;
                g = gcd(a, b);
            }
            printf("%d\n", b);
        }
    }
}