在c++中__gcd(),原理为欧几里得算法(辗转相除)
#include<iostream>
#include<algorithm>
#include<vector>
#include<fstream>
#include<cstdio>
using namespace std;
//__gcd(m,n)的原理:欧几里得算法(辗转相除)
int gcd(int m,int n){
int maxx=max(m,n),minn=min(m,n);
int r=maxx%minn;
while(r!=0){
maxx=minn;
minn=r;
r=maxx%minn;
}
return minn;
}
//递归算法:
int gcd1(int m,int n){
int maxx=max(m,n),minn=min(m,n);
int r=maxx%minn;
if(r==0){return minn;}
else{
gcd1(minn,r);
}
}
int gcd2(int m,int n){
while(n^=m^=n^=m%=n);//巧用位运算
return m;
}//太慢,牵扯到二进制转换
int main()
{
cout<<"最大公约数为:"<<gcd(25,35)<<endl;
cout<<"最大公约数为:"<<gcd1(25,35)<<endl;
cout<<"最大公约数为:"<<gcd2(25,35)<<endl;
cout<<"最大公约数为:"<<__gcd(25,35)<<endl;
return 0;
}