c++求 两数 GCD

#include <iostream>

using namespace std;

int GCD(int num1, int num2)
{
	int mod=0;
	if ((mod = (num1%num2)) !=0)
	{
		return GCD(num2, mod);
	}
	else
	{
		return num2;
	}
}

int main()
{
	int num1, num2;
	cout << "enter two integers: ";
	cin >> num1 >> num2;

	cout << "number entered: " << num1 << " and " << num2 << endl;

	cout <<"GCD: " <<  GCD(num1, num2) << endl;

	system ("pause");
	return 0;
}