A Simple Math Problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3 Accepted Submission(s): 3
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
以为12W个测试样例,所以考虑直接求,不能枚举
设 gcd(x,y) = c
所以 x = ic , y = jc
lcm(x,y) = c*i*j = b
ic + jc = a
因为 i j 互质,所以 gcd ( a,b ) = c
所以 i + j = a/c i*j = b/c
所以只需解出最小的i即可
int getAns( int a, int b ,int c ,int &ans1, int &ans2 ){
llt det = b*b-4*a*c;
if ( det < 0 ) return false;
int sq = sqrt( det );
if ( sq * sq != det ) return false;
ans1 = -b + sq;
ans2 = -b - sq;
if ( ans1 % 2 != 0 ) ans1 = INT_MAX;
else ans1 /= 2;
if ( ans2 % 2 != 0 ) ans2 = INT_MAX;
else ans2 /= 2;
return true;
}
int main(){
int x,y,c,a,b;
while( scanf("%d%d",&a,&b) != EOF) {
c = gcd(a,b);
a /= c , b /= c;
int ans1,ans2;
bool flag = getAns( 1 , -a, b , ans1,ans2);
if (flag == 0 ||(ans1 == INT_MAX && ans2 == INT_MAX))
puts("No Solution");
else {
int ans = min(ans1,ans2);
printf("%d %d\n",ans*c , (a-ans)*c);
}
}
return 0;
}