백준 2609 c++ 최대공약수와 최소공배수

https://www.acmicpc.net/problem/2609

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

---

#include <iostream>
#include <vector>
using namespace std;

int gcd(int big, int small)
{
	while (big % small)
	{
		int tmp = big % small;
		big = small;
		small = tmp;
	}
	return small;
}

int lcm(int big,int small,int gcd_p)
{
	return big * small / gcd_p;
}

int main()
{
	int b, s;
	cin >> b >> s;
	int gcd_o = gcd(b, s);
	cout << gcd(b, s) <<'\n' << lcm(b, s, gcd_o);

}