A Simple Math Problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
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
题意:给你a和b,找到一对x和y使得x+y==a,lcm(x,y)==b。
题解:
假设gcd(x,y)=l
则
i*l+j*l==a
i*j*l==b
因为i和j此时互质
所以 i+j 和 i*j 也互质
所以gcd(a,b)==l==gcd(x,y)
联立
i+j=a/l
i*j=b/l
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
int main(){
ll a,b;
while(scanf("%lld%lld",&a,&b)!=EOF){
ll x=a;
ll l=__gcd(a,b);
a/=l;
b/=l;
if(a*a-4*b<0){//韦达定理无解情况
printf("No Solution\n");
}
else{
ll ans=(a+sqrt(a*a-4*b))/2;
ans*=l;
ll cnt=x-ans;
if(cnt*ans/__gcd(cnt,ans)==b*l){
printf("%lld %lld\n",cnt,ans);
}
else{
printf("No Solution\n");
}
}
}
return 0;
}