最大公约数与最小公倍数C++实现

最大公约数为辗转相除法求得, 最小公倍数为两数之积与最大公约数的比值

#include<iostream>
using namespace std;
int gcd(int, int);
int mcm(int, int);
int main()
{
    int a, b;
    cout << "enter a and b: " << endl;
    cin >> a >> b;
    cout << "gcd : " << gcd(a, b) << endl;
    cout << "mcm : " << mcm(a, b) << endl;

    system("pause");
    return 0;
}
int gcd(int a, int b)
{
    while (a%b != 0) 
    {
        int tmp = a;
        a = b;
        b = tmp % a;
    }
    return b;
}
int mcm(int a, int b)
{
    return a * b / mcm(a, b);
}