最大公约数递归函数.txt

来自「c primer 部分习题答案」· 文本 代码 · 共 25 行

#include <stdio.h>
int div(int x, int y, int i);
int main(void)
{
	int x ,y ,i ,divisor;
	printf("Enter two numbers to get their biggest divisor:");
	scanf("%d%d" ,&x ,&y);

	i = ( x > y ) ? y : x;
	i++;

	divisor = div(x ,y ,i);
	printf("The two numbers' biggest divisor is %d\n", divisor);
	return 0;
}
int div(int x, int y, int i)
{
	i--;
	if(x % i == 0 && y % i == 0)
		return i;
	else
	{
		i = div(x, y, i);
		return i;
	}