【题目描述】
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.
【输入】
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.
【输出】
If the required point exists, output its coordinates, otherwise output -1.
【样例输入】
2 5 3
【样例输出】
6 -3
题目链接:https://codeforces.com/contest/7/problem/C
代码如下:
#include <bits/stdc++.h>
using namespace std;
int exgcd(int a,int b,int &x1,int &y1)
{
if(!b)
{
x1=1,y1=0;
return a;
}
int x2,y2;
int d=exgcd(b,a%b,x2,y2);
x1=y2,y1=x2-(a/b)*y2;
return d;
}
int main()
{
int a,b,c,x,y;
cin>>a>>b>>c;
int t=exgcd(a,b,x,y);
if(c%t==0)
cout<<-1ll*x*c/t<<" "<<-1ll*y*c/t<<endl;
else
cout<<-1<<endl;
return 0;
}