最大公因数和最小公倍数

# include <iostream>
using namespace std;

  //辗转相除法
int gcd(int a, int b) {
    if (b == 0) return a;
    return gcd(b, a%b);
}

int lcm(int a, int b) {
    return a*b / gcd(a, b);
}

int main() {
    int a, b;
    while (cin >> a >> b) {
        cout << gcd(a, b) << endl;
        cout << lcm(a, b) << endl;
    }
    return 0;
}