欧几里得算法求最大公约数

maxCommonDiv.c

#include <stdio.h>

long int CommonDiv(long int num1, long int num2) { // 寻找两数最大公约数
    long int dividend; // 被除数
    long int divisor; // 除数
    long int remainder; // 余数
    if (num1 > num2) {
        dividend = num1;
        divisor = num2;
    } else {
        dividend = num2;
        divisor = num1;
    }
    do {
        remainder = dividend % divisor;
        dividend = divisor;
        divisor = remainder ? remainder : divisor;
    } while (remainder != 0);
    return divisor;
}

int main() {
    printf("%d", CommonDiv(245, 100));
    return 0;
}