题解 | #最大公约数#

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>

using namespace std;

int gcd(int a, int b)
{
    if(b == 0) return a;
    return gcd(b, a % b);
}

int gcd1(int a, int b)
{
    while(b != 0)
    {
        int t = a % b;
        a = b;
        b = t;
    }
    return a;
}

int gcd2(int a, int b)
{
    for(int i = min(a, b); i >= 1; i --)
    {
        if(a % i == 0 && b % i == 0) return i;
    }
    return 1;
}

int main()
{
    int a, b, res;
    while(cin >> a >> b)
    {
        res = gcd1(a, b);
        cout << res << endl;
    }
    
    return 0;
}