int gcd( int a, int b ){
if( a == 0 ) return b;
if( b == 0 ) return a;
if( a%2 == 0 && b%2 == 0 ) return 2*gcd( a/2, b/2 );
else if( a%2 == 0 ) return gcd( a/2, b );
else if( b%2 == 0 ) return gcd( a, b/2 );
else return gcd( abs(a-b), min(a,b) );
}
二进制GCD
最新推荐文章于 2020-09-22 20:22:39 发布