HDOJ 1019 多个数的最小公倍数

#include <iostream>int gcd(int a,int b){while(a!=b)if(a>b) a-=b;else    b-=a;return a;}int n,m;int main(){scanf("%d",&n);while(n--){int a,LCM;scanf("%d",&m);scanf("%d",&LCM);while (--m){scanf("%d",&a);LCM=a/gcd(a,LCM)*LCM;}printf("%d\n",LCM);}//system("pause");return 0;}

gcd函数没用除法、取余等费时的计算，值得收藏