#include<iostream>
using namespace std;
//z辗转相除法,求最大公约数
int gcd(int m,int n)
{
if(m%n==0)
return n;
return gcd(n,m%n);
}
//主函数入口
void main()
{
int number1;
int number2;
cout<<"请输入number1和number2: "<<endl;
cin>>number1>>number2;
cout<<"\t\\最大公约数为: "<<gcd(number1,number2)<<endl;
cout<<"\t\\最小公倍数为: "<<number1*number2/gcd(number1,number2)<<endl;
}