最大公因数的欧几里得算法,当时,循环的第一次迭代将它们互换
package programme;
public class GratestCommonFactor {
public static void main(String[] args) {
System.out.println(gcf(1590,1989));
}
public static long gcf(long m , long n){
while(n != 0){
long rem = m % n ;
m = n ;
n = rem ;
}
return m ;
}
}