Zzuli:1062 greatest common divisor

Title Description

Enter two not greater than 10 Of 9 A positive integer to the power , Output its greatest common divisor .

Input

Enter two positive integers m and n, Space between data .

Output

Output an integer , Express m and n Maximum common divisor of .

The sample input  Copy

4 6

Sample output  Copy

2

Tips

Please refer to Euclid's theorem and the method of getting along with others .

#include <stdio.h>
int main()
{
	int m,n,r;
	scanf("%d%d",&m,&n);
	while(m%n!=0)
	{
		r=m%n;
		m=n;
		n=r;
	}
	printf("%d",n);
	return 0;
}