[백준][수학]최대공약수와 최소공배수

#include <iostream>
using namespace std;

int gcd(int x, int y)
{
	if (y == 0)
		return x;
	else
		return gcd(y, x % y);
}

int lcm(int x, int y)
{
	return (x * y) / gcd(x, y);
}

int main(void)
{
	int x, y;
	cin >> x >> y;

	cout << gcd(x, y) << '\n';
	cout << lcm(x, y) << '\n';
	return 0;
}