题解 | #最大公约数#
最大公约数
https://www.nowcoder.com/practice/20216f2c84bc438eb5ef05e382536fd3
#include<stdio.h>
int yueshu(int m, int n) {
if (m > n) { //将两者中大者放前，求余
int t = m;
m = n;
n = t;
}
while ((n % m) != 0) { // 辗转相除
int r = n % m;
n = m;
m = r;
}
return m;
}
int main() {
int m, n;
while ( scanf("%d %d", &n, &m) != EOF) {
int p = yueshu(m, n);
printf("%d", p);
}
return 0;
}
