Line（扩展欧几里德算法）

最新推荐文章于 2022-02-10 12:18:38 发布

原创

最新推荐文章于 2022-02-10 12:18:38 发布 · 415 阅读

标签

#数论

收录于

给定直线方程Ax + By + C = 0，需要找到坐标在 - 5·10^18到5·10^18之间的整数点，或者表明这样的点不存在。输入包含三个整数A、B和C，输出符合条件的点的坐标或-1。

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

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b)
{
    if(b==0) return a;
    return gcd(b,a%b);
}
void extgcd(ll a,ll b,ll& d,ll& x,ll& y)//扩展欧几里得算法
{
    if(!b)
    {
        d=a;x=1;y=0;
    }
    else
    {
        extgcd(b,a%b,d,y,x);
        y-=x*(a/b);
    }
}
int main()
{
    ll a,b,c;
    cin>>a>>b&