最大公约数和欧几里得算法求一组正整数解

最大公约数：

/*************************************************************************
        > File Name: gcd.c
        > Author:
        > Mail:
        > Created Time: Tue 27 Oct 2020 03:19:54 PM CST
 ************************************************************************/

#include<stdio.h>

int gcd(int a, int b) {
    return (b ? gcd(b, a % b) : a);
}

int main() {
    int a, b;
    while (scanf("%d%d", &a, &b) != EOF) {
        printf("%d\n", gcd(a, b));
    }
    return 0;
}

欧几里得算法：
/*************************************************************************
        > File Name: ex_gcd.c
        > Author:
        > Mail:
        > Created Time: Tue 27 Oct 2020 03:37:58 PM CST
 ************************************************************************/

#include<stdio.h>

int ex_gcd(int a, int b, int *x, int *y) {
    if (!b) {
        *x = 1, *y = 0;
        return a;
    }

    int xx, yy, ret = ex_gcd(b, a % b, &xx, &yy);
    *x = yy;
    *y = xx - a / b * yy;
    printf("\033[32ma = %d b = %d *x = %d *y = %d\033[0m\n", a, b, *x, *y);
    return ret;
}

int main() {
    int a, b, x, y;
    while (scanf("%d%d", &a, &b)) {
        printf("gcd(%d, %d) = %d\n", a, b, ex_gcd(a, b, &x, &y));
        printf("%d * %d + %d * %d = %d\n", a, x, b, y, a *x + b * y);
    }
    return 0;
}