ou.cpp

来自「欧几里德算法又称辗转相除法」· C++ 代码 · 共 27 行

void swap(int & a, int & b){
    int c = a;
    a = b;
    b = c;
} 

int gcd(int a,int b){
    if(0 == a ){
        return b;
    } 

    if( 0 == b){
        return a;
    } 

    if(a > b){
        swap(a,b);
    } 

    int c;
    for(c = a % b ; c > 0 ; c = a % b){
        a = b;
        b = c;
    } 

    return b;
}