Euclids theorem ax+by = gcd(a,b)

/******************************************************************************

Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,
C#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.
Code, Compile, Run and Debug online from anywhere in world.

*******************************************************************************/
#include <iostream>

using namespace std;

//ax+ by = gcd(a,b)

// for a, b, find x,y, gcd(a,b)

// recursion x = y1 - floor(b/a)*x1
//            y= x1

int gcd(int a, int b, int& x, int& y){
    if(a == 0){
        x=0;
        y=1;
        return b;
    }

    int x1, y1;
    int d = gcd(b%a, a, x1,y1);
    x = y1 - (b/a)*x1;
    y = x1 ;
    return d;
}

int main()
{
    int a,b;
    cin >> a;
    cin >> b ;
    if (a > b){
        int tmp = a;
        a = b;
        b = tmp;
    }
    int x, y, gcd;

    cout << gcd(a,b,x,y) << ' '<< x << ' ' << y ;



}