Peter.Liao

利用遞迴求GCD(最大公因數)與LCM(最小公倍數)

        private static int GCD(int a,int b)
        {
            if (a % b == 0) return b;
            else
                return GCD(b, a % b);
        }
        private static int LCM(int a, int b)
        {
            return (a * b) / GCD(a, b);
        }