View Code of Problem 59

#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<string>
#include<cmath>

using namespace std;


int main()
{
	int a, b;
	cin >> a >> b;

	int min_num = min(a, b);
	int max_num = max(a, b);

	int res_yue;
	for (int i = min_num; i >= 1; i--) {

		if (a % i == 0 && b % i == 0) {

			res_yue = i;
			break;
		}
	}

	int res_bei;
	for (int i = max_num; ; i++) {

		if (i % a == 0 && i % b == 0) {

			res_bei = i;
			break;
		}
	}

	cout << res_bei << " " << res_yue;
}