Codeforces 7C.Line

1 题目描述（题目链接）

2 题解

  扩展欧几里得算法。

def ext_gcd(a, b):
    if not b:
        return 1, 0, a
    x, y, g = ext_gcd(b, a % b)
    x, y = y, x - a//b * y
    return x, y, g


if __name__ == "__main__":
    co = input().split()
    A, B, C = int(co[0]), int(co[1]), int(co[2])
    x, y, g = ext_gcd(A, B)
    if not C % g:
        print(-x*C//g, -y*C//g)
    else:
        print(-1)

#include <iostream>
using namespace std;
typedef long long ll;

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


int main(int argc, const char * argv[]) {
    // insert code here...
    ll a, b, c, ans, x, y;
    cin>>a>>b>>c;
    ans = ext_gcd(a, b, x, y);
    if (c%ans == 0)
        cout<<-x*c/ans<<" "<<-y*c/ans<<endl;
    else
        cout<<-1<<endl;
    return 0;
}