辗转相除实现求公因数

python 

def gcd(a,b):
    if a<b:
        a,b=b,a
    if a%b==0:
        return b
    return gcd(b,a%b)
print(gcd(6731,2809))

def gcd2(a,b):
        if a<b:
          a,b=b,a
        while b!=0:
            c=a%b
            a=b
            b=c
        return a
print(gcd2(6731,2809))

c++

#include<iostream>
using namespace std;
class GCD
{
    private:
    int a,b;   
    public:
        GCD(int A,int B)
        {
            a=A;
            b=B;
        }
    int gcd()
       { 
        while(b!=0)
        {int c;
        c=a%b;
        a=b;
        b=c;}
return a;}
};
int main()
{
    GCD a1(6731,2809);
    cout<<a1.gcd()<<endl;
    return 0;
}