UVa 10104 - Euclid Problem

//\\__ hr1212 __//\\

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef map<int,int> mi;

#define si(a) scanf("%lld",&a)
#define sii(a,b) scanf("%lld %lld",&a,&b)
#define siii(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define pi(a) printf("%d\n",a)
#define nl printf("\n");
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define f(i,a,b) for(i=a;i<b;i++)
#define rf(i,a,b) for(i=a;i>=b;i--)
#define clr(x,a) memset(x,a,sizeof(x))
#define MAX 1000100
#define MOD 1000000007

ll n,m,x,y,temp,z;

void gcd(ll a,ll b){
    if(b==0){
        x=1;y=0;
        z=a;
    }
    else{
        gcd(b,a%b);
        temp=y;
        y=x-(a/b)*y;
        x=temp;
    }
}

int main(){
    ll r,k,i,c=0,j,t,l;
    ll ans=0;string p;

    while(sii(n,m)!=EOF){
        gcd(n,m);
        printf("%lld %lld %lld\n",x,y,z);
    }

    return 0;
}