【数据结构与算法分析】2.2 两个整数的最大公因数（也可判断两数是否互素）

#include<stdio.h>
int gcf(unsigned int m,unsigned int n);
int main() {
int m,n;
while(scanf("%d%d",&m,&n)!=EOF){
if(m<n)
printf("%d\n",gcf(n,m));
else
printf("%d\n",gcf(m,n));
}
return 0;
}
int gcf(unsigned int m, unsigned int n) {
int result;
while(n>0){
result = m % n;
m = n;
n = result;
}
return m;
}