022.欧几里得算法

#include<iostream>
using  namespace std;

int gcd(int m, int n)
{
	int r;
	h:
	r = m - floor(m / n) * n;
	if (r == 0)
	{
		return n;
	}
	else
	{
		m = n;
		n = r;
		goto h;
	}
}


int main()
{
	int x, y;
	cin >> x >> y;
	int result=gcd(x, y);
	cout << "the result is:" << result << endl;
	return 0;
}