Description
已知两个正整数 a,b a , b 的和 s s 与最大公约数,求 a,b a , b
Input
两个整数 s,g(1≤s,g≤109) s , g ( 1 ≤ s , g ≤ 10 9 )
Output
如果有满足条件的 a,b a , b 则输出任意一组,否则输出 −1 − 1
Sample Input
6 2
Sample Output
4 2
Solution
a=c⋅g,b=d⋅g,(c,d)=1,s=a+b=(c+d)⋅g a = c ⋅ g , b = d ⋅ g , ( c , d ) = 1 , s = a + b = ( c + d ) ⋅ g ,故若 g|s g | s 且 s>g s > g 则 a=g,b=s−g a = g , b = s − g 显然符合条件,否则无解
Code
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<ctime>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF=0x3f3f3f3f,maxn=100001;
int main()
{
int s,g;
while(~scanf("%d%d",&s,&g))
if(s%g!=0||s==g)printf("-1\n");
else printf("%d %d\n",g,s-g);
return 0;
}