HDU 2028 Lowest Common Multiple Plus

Lowest Common Multiple Plus
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 52196    Accepted Submission(s): 21658


Problem Description
求n个数的最小公倍数。


Input
输入包含多个测试实例，每个测试实例的开始是一个正整数n，然后是n个正整数。


Output
为每组测试数据输出它们的最小公倍数，每个测试实例的输出占一行。你可以假设最后的输出是一个32位的整数。


Sample Input

2 4 6
3 2 5 7



Sample Output

12
70

#include<iostream>
#include<stdlib.h>
#include<stdio.h>
#include<string>
#include<vector>
#include<deque>
#include<queue>
#include<algorithm>
#include<set>
#include<map>
#include<stack>
#include<time.h>
#include<math.h>
#include<list>
#include<cstring>
#include<fstream>
#include<bitset>
//#include<memory.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define INF 1000000007

ll gcd(ll a,ll b){
    return b?gcd(b,a%b):a;
}

int main()
{
    //freopen("/home/lu/文档/r.txt","r",stdin);
    //freopen("/home/lu/文档/w.txt","w",stdout);
    int n;
    while(~scanf("%d",&n)){
        ll ans=1,tmp;
        while(n--){
            scanf("%lld",&tmp);
            ans=ans*tmp/gcd(ans,tmp);
        }
        printf("%ld\n",ans);
    }
    return 0;
}