Codeforces 7C Line【扩展的欧几里得】

Discription
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

题意
给定A，B，C三个数，，输出一个符合条件的解x，y

思路
扩展的欧几里得板子题

AC代码

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll ex_gcd(ll a,ll b,ll &x,ll &y)
{
    if(b==0)
    {
        x=1;y=0;
        return a;
    }
    ll r=ex_gcd(b,a%b,x,y);
    ll t=x;
    x=y;
    y=t-a/b*y;
    return r;
}

int main()
{
	ll a,b,c,x,y;
	cin>>a>>b>>c;
	ll t=ex_gcd(a,b,x,y);
	if(c%t==0)
		printf("%lld %lld\n", -x*c/t, -y*c/t);
	else
		printf("-1\n");
	return 0;
}