题目：求一个×××数组的所有元素的最小公倍数，在不溢出的情况下

longlongLCM(intnum1,intnum2){longlongmul=num1*num2;while(num1%num2){inttemp=num1%num2;num1=num2;num2=temp;}returnmul/num2;}longlongleastCommonMultiple(intarr[],intsize){longlongret=1;for(inti=0;i<size;++i){ret=LCM(ret,arr[i]);}returnret;}intmain(){intarr[]={3,9,18};cout<<leastCommonMultiple(arr,3)<<endl;system("pause");return0;}