public int gcd(int m, int n){
int rem;
while(n > 0){
rem = m % n;
m = n;
n= rem;
}
return m
最大公因数-欧几里得算法
最新推荐文章于 2023-01-06 21:16:31 发布
public int gcd(int m, int n){
int rem;
while(n > 0){
rem = m % n;
m = n;
n= rem;
}
return m