CodeForces 7C Line Exgcd（数论）

C. Line

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

传送门：http://codeforces.com/problemset/problem/7/C

题意&&思路：找出方程一组通解，扩展欧几里得算法就是解方程（欧几里得算法详解）

先附上扩展欧几里得算法模板：

ll gcd(ll a,ll b,ll& x,ll& y)
{
	if(!b)
	{
		x=1;
		y=0;
		return a;
	}	
		ll ans=gcd(b,a%b,x,y);
		int temp=x;
		x=y;
		y=temp-a/b*y;
		return ans;
}

既可以求出最大公约数，还可以顺带求解出使得：a*x + b*y = gcd (a,b) 的通解 x 和 y

算法的返回值为 gcd(a,b) 求出的 x，y 为负

代入此题时因为解为gcd(a,b)，因此最后要乘上c/gcd(a,b)

同时拓展一下：求乘法逆元时，等价于求 ax + by = 1 的解，即条件为 gcd(a,b)==1 ；

AC代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
#define INF 5*1e18
using namespace std;
ll gcd(ll a,ll b,ll& x,ll& y)
{
	if(!b)
	{
		x=1;
		y=0;
		return a;
	}	
		ll ans=gcd(b,a%b,x,y);
		int temp=x;
		x=y;
		y=temp-a/b*y;
		return ans;
}
int main()
{
	ll a,b,c,d,x,y;
	while(scanf("%lld%lld%lld",&a,&b,&c)!=EOF)
	{
		d=gcd(a,b,x,y);
		if(c%d!=0)
			printf("-1\n");
		else
			printf("%lld %lld\n",-x*(c/d),-y*(c/d));
	}
	return 0;
}