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.
#include<cstdio>
#define ll long long
using namespace std;
ll exgcd(ll a,ll b,ll &x,ll &y){
ll ret,tmp;
if(b==0){
x=1;
y=0;
return a;
}
ret=exgcd(b,a%b,x,y);
tmp=x;
x=y;
y=tmp-a/b*y;
return ret;
}
int main(){
ll a,b,c,d,x,y;
scanf("%I64d%I64d%I64d",&a,&b,&c);
d=exgcd(a,b,x,y);
if(c%d)printf("-1\n");
else printf("%I64d %I64d\n",-x*(c/d),-y*(c/d));
return 0;
}