[백준]2609-최대공약수와 최소공배수(설명X)

#include <iostream>
using namespace std;
 
int main()
{
    int arg1, arg2, measure = 1;
    cin >> arg1 >> arg2;
    for (size_t i = arg1 < arg2 ? arg1 : arg2; i > 1; i--)
    {
        if (arg1 % i == 0 && arg2 % i == 0) {
            measure = i;
            break;
        }
    }
    cout << measure << endl;
    for (size_t i = arg1 > arg2 ? arg1 : arg2; i <= arg1 * arg2; i++) {
        if (i % arg1 == 0 && i % arg2 == 0) {
            cout << i << endl;
            break;
        }
    }
    return 0;
}