line

http://codeforces.com/problemset/problem/7/C

#include <iostream>
#include <cstdio>
using namespace std;
typedef long long LL;
void exgcd(LL a,LL b,LL &x,LL &y)
{
    if(b==0)
    {
        x=1;
        y=0;
        return;
    }
    exgcd(b,a%b,x,y);
    LL tmp=x;
    x=y;
    y=tmp-(a/b)*y;
}
LL gcd(LL m,LL n)
{
    if(n==0)
        return m;
    return gcd(n,m%n);
}
int main()
{
    LL x,y,m,n,l,a,b,c,d,x0,y0,flag;
    while(cin>>a>>b>>d)
    {
        d=-d;
        flag=0;
        c=gcd(a,b);
        if(d%c!=0)
            flag=1;
        if(flag)
            puts("-1");
        else
        {
          a/=c;
          b/=c;
          d/=c;
          exgcd(a,b,x0,y0);
          x0*=d;
          y0*=d;
          cout<<x0<<" "<<y0<<endl;
        }
    }
    return 0;
}