小菜第一篇。ax+by=c求解

#include <iostream>
#define  LL long long
using namespace std;
LL gcd(LL a,LL b)
{
    return b?gcd(b,a%b):a;
}
void extend_Euclid(LL a, LL b, LL &x, LL &y)
{
    if(b == 0)
    {
        x = 1;
        y = 0;
        return;
    }
    extend_Euclid(b, a%b, x, y);
    LL tmp = x;
    x = y;
    y = tmp - (a / b) * y;
}
int main()
{
    LL a,b,c;
    while(cin>>a>>b>>c)
    {
        LL g=gcd(a,b);
        LL d=c%gcd(a,b);
        if(d!=0)
        {
            cout<<"cuo wu"<<endl;
            continue;
        }
        LL x,y;
        c/=gcd(a,b);
        extend_Euclid(a,b,x,y);
        cout<<x*c<<" "<<y*c<<endl;
    }
    return 0;
}