#include<iostream>
using namespace std;
int gcd(int m,int n);
int sct(int m,int n);
int main()
{
    int m,n;
    cin>>m>>n;
    cout<<"最大公约数= "<<gcd(m,n)<<endl;
    cout<<"最小公倍数= "<<sct(m,n)<<endl;
    return 0;
}
int gcd(int m,int n)
{
    int i,max;
    max=m>n?m:n;
    for(i=max;i>0;i--)
        {
            if(m%i==0&&n%i==0)
            {
                return i;
            }
        }
}
int sct(int m,int n)
{
    return m*n/gcd(m,n);
}

Embed on website

To embed this project on your website, copy the following code and paste it into your website's HTML: