c语言 辗转相除法求两个数的最大公约数

#include <stdio.h> 
int main()
{
	int m,n;
	int gcd;//最大公约数
	scanf_s("%d%d", &m, &n);
	if (m > n)
	{
		gcd = n;
	}
	else
	{
		gcd = m;
	}
	while (gcd > 1 && (m % gcd != 0 || n % gcd != 0))
	{
		gcd--;
	}
	printf("%d", gcd);
	return 0;
}

这是普通的算法
效率比较低， 实际上解决上述算法有更好的数学模型，
欧几里德算法

#include <stdio.h> 
#include <stdlib.h> 
int main()
{
	int m, n;
	int r;

	printf("input m,n:\n");
	scanf("%d%d", &m, &n);

	r = m % n;
	if (r == 0)
	{
		printf("%d and %d  gcd is %d", m, n, n);
	}
	else
	{
		while (m % r != 0 || n % r != 0)
		{
			m = n;
			n = r;
			r = m % n;
		}
		printf("%d and %d  gcd is %d", m, n, r);
	}
	return 0;
}