辗转相除求最大公约数最小公倍数 扩展欧几里得算法

最大公约数最小公倍数

#include<stdio.h>

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

int lcm(int a, int b) {
    return a / gcd(a,b) * b;
}
int main(){
    int a,b;
    while (~scanf("%d%d",&a, &b)) {
        printf("gcd(%d, %d) = %d\n", a, b, gcd(a,b));
        printf("lcm(%d,%d) = %d", a, b, lcm(a, b));
    }
    return 0;
}

扩展欧几里得算法

#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;
    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;
}

第二种写法：不需要借助xx,yy

#include<stdio.h>

int ex_gcd(int a, int b, int *x, int *y) {
    if (!b) {
        *x = 1, *y = 0;
        return a;
    }
    int ret = ex_gcd(b, a % b,y, x);
    
    *y -= a / b * (*x);
    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;
}