计算两个自然数的最大公约数-短除法、辗转相除法、欧几里得减法

#include <stdio.h>
#include <stdlib.h>
//短除法
int CommonFactor(int m, int n){
    int i, flag = 1;
    for(i = 2; i <= n && i <= m; i++){ //被除数m 除数n
        while(n % i == 0 && m % i == 0){
            n = n / i;
            m = m / i;
            flag *= i;
        }
    }
    return flag;

}
//辗转相除法
int CommonFactor1(int m, int n){
    int r = m % n;
    while(r != 0){
        m = n;
        n = r;
        r = m % n;
    }
    return n;
}
//欧几里得减法
int CommonFactor2(int m , int n)
{

    while(n != 0){
        if(m > n){
            m = m - n;
        }else{
            n = n - m;
        }
    }
    return m;
}

int main()
{
    int m, n;
    printf("输入m:");
    scanf("%d", &m);
    printf("输入n:");
    scanf("%d", &n);
    int res = CommonFac