CodeForces 7 C. Line(扩展欧几里得)

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三个整数求方程Ax + By + C = 0的正整数解

思路：扩展欧几里得

AC代码：

#include<cstdio>
#include<iostream>
using namespace std;
typedef long long LL;
void extend_Eulid(LL a, LL b, LL &x, LL &y, LL &d)
{
    if (!b) {d = a, x = 1, y = 0;}
    else
    {
        extend_Eulid(b, a % b, y, x, d);
        y -= x * (a / b);
    }
}
int main()
{
    LL a,b,d,c,x,y;
    while(~scanf("%lld%lld%lld", &a,&b,&c))
    {
        extend_Eulid(a, b, x, y, d);
        if(c%d)
        printf("-1\n");
    else
    {
        int t;
        t=c/d;
        printf("%lld %lld\n",-(x*t),-(y*t));
    }
    }
}

直觉告诉我要多组输入，竟然懵准了，哈哈哈哈哈哈