辗转相除法求两个数的最大公约数(递归)

/*用辗转相除法求最大公约数*/

#include<stdio.h>

int gcd(int _a,int _b);

int main()
{
    int a;
    int b;
    int common;
    printf("Please input two number:");
    scanf("%d%d",&a,&b);

    common = gcd(a,b);

    printf("The great common divisor of %d and %d is %d\n",a,b,common);

}

int gcd(int _a,int _b)
{
    return _b == 0 ? _a : gcd(_b,_a % _b);
}