Euclid求最大公约数

Euclid求最大公约数算法

#include <stdio.h>
int gcd(int x,int y){
    while(x!=y){
        if(x>y)
            x=x-y;
        else
            y=y-x;
    }
    return x;
}
int main(int argc, const char *argv[])
{
    if(3!=argc){
        printf("Usage:<a,out> num1 num2\n");
        return -1;
    }
    printf("%d\n",gcd(atoi(argv[1]),atoi(argv[2])));
    return 0;
}