UVA 11889 - Benefit（数论）

题目链接：11889 - Benefit

题意：LCM（A,B） = C，给定A和C，求一个最小满足的b。

思路：原式 = a * b / gcd(a, b) = c; -> c / b = a / gcd(a, b);

所以b肯定是c的因子，然后枚举b去判断即可

代码：

#include <stdio.h>
#include <string.h>
#include <math.h>
#define INF 0x3f3f3f3f
#define min(a,b) ((a)<(b)?(a):(b))
int t;
long long a, c, ans;

long long gcd(long long a, long long b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}

bool judge() {
	if (c % a) return false;
	ans = INF;
	for (long long b = 1; b <= sqrt(c); b++) {
		if (c % b) continue;
		int bb = c / b;
		if (a * b == c * gcd(a,b)) {
			ans = min(ans, b);
			return true;
		}
		if (a * bb == c * gcd(a,bb))
			ans = min(ans, bb);
	}
	return ans != INF;
}

int main() {
	scanf("%d", &t);
	while (t--) {
		scanf("%lld%lld", &a, &c);
		if (!judge()) printf("NO SOLUTION\n");
		else printf("%lld\n", ans);
	}
	return 0;
}