#include<iostream>
using namespace std;
int main()
{
    int m=0,n=0;
    cout<<endl
        <<"请输入两个数(整型,从小到大):";
    cin>>n>>m;
    while(n>m)
    {
        cout<<endl
            <<"输入格式错误,请重新输入.:";
        cin>>n>>m;
    }
    int m1=m;
    int n1=n;
    int i=m%n;
    while(i!=0)
    {
        m=n;
        n=i;
        i=m%n;
    }
    cout<<endl
        <<n1<<"与"<<m1<<"的最大公约数是:"<<n<<endl;
    cout<<n1<<"与"<<m1<<"的最小公倍数是:"<<m1*n1/n<<endl;
return 0;

评论