四种方法求最大公约数#include<;iostream>;#include<;cmath>;using namespace std;//辗转相除法int gcd(int a,int b){if(a%b==0)return b;else;return gcd(b,a%b);}//穷举法int divisor (int a, int b) //自定义函数求两数的最大公约数{int temp;//定义整型变量temp=(a>;b)?b:a;//采种条件运算表达式求出两个数中的最小值while(temp>;0){if(a%temp==0&&b%temp==0)//只要找到一个数能同时被a,b所整除，则中止循环break;temp--;//如不满足if条件则变量自减，直到能被a,b所整除}return (temp);//返回满足条件的数到主调函数处}//更相减损法int gcd2(int m,int n){int i=0,temp,x;while(m%2==0&&n%2==0)//判断m和n能被多少个2整除{m/=2;n/=2;i+=1;} if(m<;n)//m保存大的值{temp=m;m=n;n=temp;} while(x){x=m-n;m=(n>;x)?n:x;n=(n<;x)?n:x;if(n==(m-n))break;}if(i==0)return n;elsereturn (int) pow(2,i)*n;}//Stein算法int Stein( unsigned int x, unsigned int y )/* return the greatest common divisor of x and y */{int factor = 0;int temp;if ( x <; y ){temp = x;x = y;y = temp;}if ( 0 == y ){return 0;}while ( x != y ){if ( x & 0x1 ){/* when x is odd */if ( y & 0x1 ){/* when x and y are both odd */y = ( x - y ) >;>; 1;x -= y;}else{/* when x is odd and y is even */y >;>;= 1;}}else{/* when x is even */if ( y & 0x1 ){/* when x is even and y is odd */x >;>;= 1;if ( x <; y ){temp = x;x = y;y = temp;}}else{/* when x and y are both even */x >;>;= 1;y >;>;= 1;++factor;}}}return ( x <;<; factor );}int main(){省略 return 0;}