最小公倍数的递归求解, long long Work(int k) { if (k == 0) return workarr[0]; else return (Work(k-1)*workarr[k])/GCD(Work(k-1),workarr[k]); }