[C++]辗转相除法——输入2个正整数m和n，求其最大公约数和最小公倍数

#include<iostream>
using namespace std;

//输入2个正整数m和n，求其最大公约数和最小公倍数
int main(){
	
	int m, n;
	cout << "请输入真正数m和n" << endl;
	cin >> m >> n;
	if (m < n)
	{
		int t;
		t = m;
		m = n;
		n = t;
	}
	int k1 = m;
	int k2 = n;
	int b;
	while (n != 0)
	{
		
		b = m%n;
		m = n;
		n = b;
	}
	cout << "最大公约数为：" << m << endl;
     cout << "最小公倍数为：" << (k1*k2) / m << endl;


	system("pause");
	return EXIT_SUCCESS;
}