编写函数求两个整数的最大公约数和最小公倍数

#include <iostream>
using namespace std;
int maxgy(int a,int b) {
	int r, t;
	if (a < b) {
		t = a;
		a = b;
		b = t;//a>b,采用辗转相除法；或更相减损术；
	}
	do {
		r = a % b;
		a = b;
		b = r;
	} while (r != 0);
	return a;
}
int mingb(int a, int b) {   //两个数的乘积等于这两个数的最大公约数与最小公倍数的积;
	int n = maxgy(a, b);
	return a * b / n;
}
int main() {
	int x, y;
	cout << "please enter two numbers x and y:" << endl;
	cin >> x >> y;
	cout << "最大公约数：" << maxgy(x, y) << endl;
	cout << "最小公倍数：" << mingb(x, y) << endl;

	return 0;
}