A line on the plane is described by an equation Ax + By + C = 0. You are to find any point on this line, whose coordinates are integer numbers from - 5·1018 to 5·1018 inclusive, or to find out that such points do not exist.
Input
The first line contains three integers A, B and C ( - 2·109 ≤ A, B, C ≤ 2·109) — corresponding coefficients of the line equation. It is guaranteed that A2 + B2 > 0.
Output
If the required point exists, output its coordinates, otherwise output -1.
Examples
Input
2 5 3
Output
6 -3
题意:
解二元一次方程,存在则输出该解,不存在则输出-1 。
将ax+by+c=0,
化为 ax+by = -c/gcd(a,b)*gcd(a,b) ,套拓展欧几里得就可以解出了
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
void gcd(long long a,long long b,long long& d,long long& x,long long& y)
{
if(!b)
{
d=a;
x=1;
y=0;
}
else
{
gcd(b,a%b,d,y,x);
y-=x*(a/b);
}
}
int main()
{
long long a,b,c,d,x,y;
while(~scanf("%lld%lld%lld",&a,&b,&c))
{
gcd(a,b,d,x,y);
if(c%d!=0)
printf("-1\n");
else
printf("%lld %lld\n",-x*(c/d),-y*(c/d));
}
return 0;
}