lq2.4 Find the greatest common divisor

#include <stdio.h>

int gong(int x,int y);

int main()
{
    
    
	int x,y;
	scanf("%d",&x); 
	scanf("%d",&y);
	printf("%d",gong(x,y));
}

int gong(int x,int y)
{
    
    
	if(x<y)//交换x,y的值。 
	{
    
    
		x=x^y;
		y=x^y;
		x=x^y;
	} 
	if(x%y==0)
		return	y;
	return(y,x%y);
}

Guess you like

Origin blog.csdn.net/June159/article/details/108455139