辗转相除法求最大公约数方法
递归式:gcd(a,b) = gcd(b, a%b)
递归边界: gcd(a,0) == a
#include <iostream>
using namespace std;
//递归式gcd(a,b) = gcd(b, a%b),递归边界 gcd(a,0) == a
int gcd(int a, int b)
{
if(b == 0) return a;
else return gcd(b, a%b);
}
int main()
{
cout << gcd(5,10) << endl;
return 0;
}