UVa 11889 Benefit （数论）

UVa 11889 Benefit （数论）2014-04-26 csdn博客 synapse711889 - Benefit

Time limit: 5.000 seconds

http://uva.onlinejudge.org/index.php？ option=com_onlinejudge&Itemid=8&category=467&page=show_problem&problem=29 89

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

100000）, the number of tests. Each test that comes in a separate line contains two integers A and C （ 1

A, C

10⁷）.

Output

Print the lowest integer B such that LCM（A, B） = C in a single line. If no such integer exists, print "NO SOLUTION" instead. （Quotes for clarity）

Sample Input

32 632 17607 16

Sample Output

355NO SOLUTION

思路：

我们可以用A和C的唯一素因子分解来求出尽可能小的B的唯一素因子分解，进而求出B，但是这种方法的复杂度是O（C）。

有没有更快的方法？

方法2：

由于

AB/gcd（A,B）=C，

记C/A为B"，则

B=B"gcd（A,B），

设

B=kB"，

则有

gcd（A,kB"）=k，