题解 | #最大公约数#

#include <bits/stdc++.h>
using namespace std;

int main() {
    int m = 0, n = 0, i = 1, maxgongyue = 1;
    while (cin >> m >> n) {
        while (i <= m && i <= n) {
            if (m % i == 0 && n % i == 0)maxgongyue = i;
            i++;
        }
        cout << maxgongyue;
    }
    return 0;
}