HDU 5974 A Simple Math Problem

A Simple Math Problem

Given two positive integers a and b,find suitable X and Y to meet the conditions: X+Y=a Least Common Multiple (X, Y) =b

Input
Input includes multiple sets of test data.Each test data occupies one line,including two positive integers a(1≤a≤2*10^4),b(1≤b≤10^9),and their meanings are shown in the description.Contains most of the 12W test cases.

Output
For each set of input data,output a line of two integers, representing X, Y. If you cannot find such X and Y, output one line of “No Solution”(without quotation).

Sample Input

6 8
798 10780

Sample Output

No Solution
308 490

---

题意：
已知 X+Y=a ， LCM(X,Y)=b ，求X、Y。

思路：

$x+y=a$
$xy/gcd(x,y)=b$

$x/gcd(x,y)+y/gcd(x,y)=a/gcd(x,y)$
$(xy/gcd(x,y))/gcd(x,y)=b/gcd(x,y)$

令 $i=x/gcd(x,y)$、$j=y/gcd(x,y)$ :
$i+j=a/gcd(x,y)$
$ij=b/gcd(x,y)$

$gcd(x,y)=gcd(x+y,xy)=gcd(a,b)$

$i+j=a/gcd(a,b)$
$ij=b/gcd(a,b)$

代码：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll a,b;
int main()
{
    while(~scanf("%lld %lld",&a,&b))
    {
        int k;
        k=__gcd(a,b);
        int zz=a*a-4*k*b;
        if(zz<0) printf("No Solution\n");
        else
        {
            int ans1=(int)(a-sqrt((double)zz))/2;
            int ans2=(int)(a+sqrt((double)zz))/2;
            if(ans1+ans2==a&&(ans1*ans2/__gcd(ans1,ans2))==b)
                printf("%d %d\n",ans1,ans2);
            else printf("No Solution\n");
        }
    }
    return 0;
}