백준 - 2609 c++

www.acmicpc.net/problem/2609

2609번: 최대공약수와 최소공배수

 

#include <iostream>
using namespace std;
int gcd(int n,int m) {
    int a;
    while (m != 0) {
        a = n % m;
        n = m;
        m = a;
    }
    return n;
}
int main() {
    int n, m;
    cin >> n >> m;
    cout << gcd(n, m) << "\n" << n * m / gcd(n, m);
    
    return 0;