hdoj 5974 A Simple Math Problem（数学）

题目地址：点击打开链接

思路：测试组数12W，暴力不用考虑了。 

设gcd(x, y) = gcd, 

可得i*gcd + j*gcd = a, i*j*gcd = b;

 因为i, j互质, 所以i+j, i*j互质, 所以gcd(a, b) = gcd,从而求出gcd,  所以可以联立方程i+j = a/gcd, i+j = b/gcd 从而解出i, j，再乘上gcd

即为X, Y

题意有个坑，没说输出XY的大小关系，但一定要X<Y.

代码：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
int main(void)
{
    ll a, b;
    while(~scanf("%lld%lld", &a, &b))
    {
        ll gcd = __gcd(a, b);
        a /= gcd;
        b /= gcd;
        ll del = a*a-4*b;
        if(del < 0) puts("No Solution");
        else
        {
           ll sq = sqrt(del);
           if(sq*sq != del) puts("No Solution");
           else
           {
               ll X = a+sq;
               ll Y = a-sq;
               if(X > Y) swap(X, Y);
               if(X%2) puts("No Solution");
               else printf("%lld %lld\n", X/2*gcd, Y/2*gcd);
           }
        }
    }
    return 0;
}

A Simple Math Problem

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 578    Accepted Submission(s): 224

Problem Description

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
  
  

 

Source

2016ACM/ICPC亚洲区大连站-重现赛（感谢大连海事大学）