最大公约数与最小公倍数

#include <iostream>
using namespace std;

/* Greatest common divisor */
unsigned long gcd(unsigned long a, unsigned long b)
{
    unsigned long r;
    if (a < b)
        swap(a, b);
    while ((r = a % b) != 0) {
        a = b;
        b = r;
    }

    return b;
}

/* Least common multiple */
unsigned long lcm(unsigned long a, unsigned long b)
{
    return a * b / gcd(a, b);
}

int main()
{
    cout << gcd(30, 25) << endl;
    cout << gcd(25, 30) << endl;
    cout << gcd(99, 36) << endl;

    cout << lcm(30, 25) << endl;
    cout << lcm(12, 30) << endl;

    return 0;
}