codeforces 7c line(扩展欧几里得)

C. Line

 

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.

Sample test(s)

input

2 5 3

output

6 -3

#include<cstdio>
#include<cstring>
using namespace std;

void exgcd(int a,int b,int& d,long long& x,long long& y)
{
    if(!b)d=a,x=1,y=0;
    else
    {
        exgcd(b,a%b,d,y,x);
        y-=x*(a/b);
    }
}

int main()
{
    int a,b,c;
    while(scanf("%d%d%d",&a,&b,&c)!=EOF)
    {
        int d;long long x,y;
        exgcd(a,b,d,x,y);
        if(c%d!=0)
            puts("-1");
        else
        {
            x*=c/d;
            y*=c/d;
            printf("%lld %lld
",-x,-y);
        }
    }
    return 0;
}