算法设计与分析入门学习练习之一公约数：穷举法和辗转相除法

//输出两个数的最大公约数（穷举法）
int MaximumCommonDivisor(int a,int b){
    int result;
    int t = 1;
    for (int i = 2; i <= a && i <= b;i++)
    {
        while (a % i == 0 && b % i == 0)
        {
            t = t*i;
            a = a / i;
            b = b / i;
            cout << t << endl;
        }
    }
    result = t;


    return result;
}
//辗转相除法:a-bx=c
int MaximumCommonDivisor1(int a, int b){

    int result;
    if (b==0)
    {
        cout << "error" << endl;
        return 0;
    }
    else
    {
        int c = a%b;
        while (c!=0)
        {
            a = b;
            b = c;
            c = a%b;
        }
    }
    result = b;
    return result;

}