C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 2609번:최대공약수와 최소공배수 답

#include <iostream>
using namespace std;
//최대공약수
int GCM(long long N, long long M) {
    int cnt = 0;
    for (int i = 2; i <= 10000; i++)
    {
        if (N%i == 0 && M%i == 0)
        {
            cnt = i;
        }
    }
    if (cnt == 0)
    {
        return 1;
    }
    return cnt;
}
//최소공배수
int LCM(long long N, long long M) {
    long long cnt = 0;
    
    for (long long i = 1; i <= 100000000; i++)
    {
        if (i >= M && i >= N && i % N == 0 && i % M == 0)
        {
            cnt = i;
            break;
        }
    }
    return cnt;
}
int main() {
    long long N, M;
    cin >> N >> M;
    cout << GCM(N, M) << '\n' << LCM(N, M);
}