辗转相除法

#include <iostream>
using namespace std;
//递归求最大公约数
int gcd(int m,int n){
    if(n==0) return m;
    return gcd(n,m%n);
}
int main(void) {
    int m = 16,n = 128;
    int min = gcd(m,n);
    cout << min << endl;
}

//不用递归得解法
int gcd2(int m,int n) {
    int t = 1;
    while(t !=0){
        t = m%n;
        m = n;
        n = t;
    }
    return m;
}