HDU 2028 看看输入的技巧

n个数的最小公倍数

#include <iostream>#include <cstdio>#include <cstring>#include <set>#include <queue>#include <algorithm>#include <functional>#include <string>#include <map>#include <cmath>#include <iomanip>using namespace std;const int maxn=1000;const int inf=0x3f3f3f3f;int gcd(int a,int b)//这里用了简单的递归{    if(b==0)return a;    return gcd(b,a%b);}int main(){    int n,a,b,c;    while(scanf("%d",&n)==1)    {        scanf("%d",&a);        for(int i=0;i<n-1;i++)        {            int t;            scanf("%d",&b);            c=gcd(a,b);            a=a/c*b;        }        printf("%d\n",a);    }}