欧几里德算法求两个整数的最大公因数(gcd):
public static long gcd(long m, long n) {
while( n != 0) {
long rem = m % n;
m = n;
n = rem;
}
return m;
}
欧几里德算法求两个整数的最大公因数(gcd):
public static long gcd(long m, long n) {
while( n != 0) {
long rem = m % n;
m = n;
n = rem;
}
return m;
}