求最大公约数

两种方法

//gcd:辗转相除法 

#include <cstdio>
#include <iostream>
using namespace std;

int m, n;

int gcd(int m, int n)
{
    if (n == 0)
        return m;
    else
        return gcd(n, m % n);
}

int main()
{
    cin >> m >> n;

    cout << gcd(m, n) << endl;

    return 0;
}

//gcd:辗转相除法 

#include <iostream>
#include <cstdio>
using namespace std;

int x, y;

int gcd(int x, int y){
    return y == 0 ? x : gcd(y, x % y);
}

int main(){
    cin >> x >> y;

    cout << gcd(x, y) << endl;

    return 0;
}

//gcd:二进制算法

#include <cstdio>
#include <iostream>
using namespace std;

int x, y;

inline int gcd(int x, int y){
    int i, j;
    if (x == 0) return y;
    if (y == 0) return x;
    for (i = 0; 0 == (x & 1); i++) x = x >> 1;
    for (j = 0; 0 == (y & 1); j++) y = y >> 1;
    if (j < i) i = j;
    while (1 == 1){
        if (x < y) x = x ^ y, y = x ^ y, x = x ^ y;
        if (0 == (x -= y)) return y << i;
        while (0 == (x & 1)) x = x >> 1;
    }
}

int main(){
    cin >> x >> y;

    cout << gcd(x, y) << endl;

    return 0;
}