UVA11889 Benefit

最新推荐文章于 2019-08-19 17:12:23 发布

peach_yang

最新推荐文章于 2019-08-19 17:12:23 发布

阅读量418

点赞数

分类专栏：编程成长 UVA 文章标签：算法 ACM

本文链接：https://blog.csdn.net/peach_yang/article/details/51944954

版权

编程成长同时被 2 个专栏收录

59 篇文章 0 订阅

订阅专栏

UVA

31 篇文章 0 订阅

订阅专栏

Question：
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 ≤ 107
).
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
3
2 6
32 1760
7 16
Sample Output
3
55
NO SOLUTION
提目概述：给你两个数A,C要求你求出B使得A，B的最小公倍数为C
(http://acm.hust.edu.cn/vjudge/contest/121559#problem/A)`

#include <iostream>
#include <cstdio>
using namespace std;
int gdc(int a,int b)
{
    if(b==0)
        return a;
    else gdc(b,a%b);
}
int main()
{
    int a,b,c,n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d%d",&a,&c);
        if(c%a!=0)
        {
            printf("NO SOLUTION\n");
            continue;
        }
        b=c/a;
        while(gdc(a,b)!=1)   //如果a,b的公约数不为一，则使a/=gcd(a,b)，b*=gcd(a,b)，使b不断增大，直至gcd(a,b)=1;此时求得所求的b.
        {
            int temp=gdc(a,b);
            a/=temp;
            b*=temp;
        }
        printf("%d\n",b);
    }
    return 0;
}