题解 UVA11889 Benefit

$$Benefit$$

Time Limit: 5S		Memory Limit: 128MB
Total Submissions: 128		Accepted: 95

$Description$
Recently Yaghoub is playing a new trick to sell some more. When somebody gives him A Tomans, he who never has appropriate changes, asks for B Tomans such that lowest common multiple of A and B equals to C and he will pay back a round bill. Or otherwise take some snack instead of the remaining of his money. He believes that finding such a number is hard enough that dissuades students from paying that.
You should write a program that help poor students giving the appropriate amount of money to Yaghoub. Of course if there are several answers you go for students’ benefit which is the lowest of them.

$Input$
The first line begin with an integer $T(T\le 100000)$, the number of tests. Each test that comes in a separate line contains two integers $A$ and $C$ $(1\le A,C\le 107)$.

$Output$
Print the lowest integer $B$ such that $LCM(A,B)=C$ in a single line. If no such integer exists, print ‘$NOSOLUTION$’ instead.$(Quotesforclarity)$

$SampleInput$
3
2 6
32 1760
7 16

$SampleOutput$
3
55
NO SOLUTION

---

题目大意为：输入两个整数$A$和$C$，求最小的整数$B$使得$lcm(A,B)=C$。如果无解，输出“$NOSOLUTION$”。

$lcm(a,b)=\frac{ab}{gcd(a,b)}=c$

移项得$\frac{b}{gcd(a,b)}=\frac{c}{a}$

因为上式左边一定为整数，所以

当右边不为整数时，即$a$不整除$c$时，一定无解

当右边为整数时，即$a|c$时，

令$\frac{c}{a}=d$，函数$f(a,d)=“令\frac{x}{gcd(a,x)}=d成立的x的最小整数解”$

当$gcd(a,d)=1$时，显然$x=d$

当$gcd(a,d)>1$时，

不妨设$gcd(a,x)=k{}^{(\ast )}$，

将${}^{(\ast )}$式代入 $f(a,d)$，得 $x=d\cdot k$

将上式代入${}^{(\ast )}$式，得$gcd(a,d\cdot k)=k$

记$g=gcd(a,d)$，两边同时约去$g$，可得

$gcd(\frac{a}{g},\frac{d}{g}\cdot k)=\frac{k}{g}$

因为$\frac{a}{g}$，$\frac{d}{g}$已经互质，可以将$\frac{d}{g}$从上式中剔除，得到

$gcd(\frac{a}{g},k)=\frac{k}{g}$

移项得$\frac{k}{gcd(\frac{a}{g},k)}=g$

所以$f(a,d)=d\cdot k=d\cdot f(\frac{a}{g},g)$

递归求解即可

代码实现如下：

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

inline int read()
{
	int X=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
	while(ch>='0'&&ch<='9') {X=(X<<1)+(X<<3)+(ch^'0'); ch=getchar();}
	return X*f;
}

int gcd(int x,int y)
{
	return y==0?x:gcd(y,x%y);
}

int f(int a,int d)
{
	int g=gcd(a,d);
	if(g==1) return d;
	return d*f(a/g,g);
}

int main()
{
	freopen("input.txt","r",stdin);
	int n=read();
	for(int i=1;i<=n;++i)
	{
		int a=read(),c=read();
		if(c%a==0) printf("%d\n",f(a,c/a));
		else printf("NO SOLUTION\n");
	}
	return 0;
}