辗转相除法求最大公因数(C++实现）

#include
using namespace std;

unsigned GCD(unsigned a, unsigned b)
{
	if (a < b)
	{
		return GCD(b, a);
	}
	int c = a % b;
	while (c != 0)
	{
		a = b;
		b = c;
		c = a % b;
	}
	return b;
}

int main(void)
{
	unsigned a, b;
	cout << "请输入需要求最大公因数的两个正整数：";
	cin >> a >> b;
	cout << "通过辗转相除法解得两个数的最大公因数为：" << GCD(a, b) << endl;
	return 0;
}