欧几里得算法求最贵族约数(九度刷题)
欧几里得算法求最大公约数(九度刷题)
#include<stdio.h> #include<math.h> #include<string.h> int gcd(int m,int n) { int r,t;//m =big,n=small; if(m<n){ t=m; m=n; n=t; } while(n>0){ r = m%n; m = n; n = r; } return m; } int main() { int a,b; while (scanf("%d %d",&a,&b)!=EOF) { printf("%d\n",gcd(a,b)); } return 0; }