1、求最大公约数
int Euclidean_nonRecursion_greatest_common_(int m, int n) { while (n != 0) { int r = m % n; m = n; n = r; } return m; }
1、求最大公约数
int Euclidean_nonRecursion_greatest_common_(int m, int n) { while (n != 0) { int r = m % n; m = n; n = r; } return m; }