GCD & LCM

int gcd(int a, int b) {//最大公因数
    while (b != 0) {
        int temp = a % b;
        a = b;
        b = temp;
    }
    return a;
}

int lcm=a*b/gcd(a,b);//最小公倍数