//其实用int就已经够用了，
#include<iostream>
#include<stdlib.h>
#include<math.h>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<string.h>
#include<stack>
#include<math.h>
#include<string>
#include<stdlib.h>
#include<list>
#include<vector>
using namespace std;
long long lcm(long long i,long long j)
{
if (i>j)
swap(i,j);
if (j%i==0)
return i;
return lcm(j%i,i);
}
int main()
{
long long i,j,k;
long long n;
int t;
cin>>t;
while (t--)
{
cin>>n;
cin>>j;
while(--n)
{
cin>>i;
j=(i*j)/lcm(i,j);
}
cout<<j<<endl;
}
}Least Common Multiple
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15719 Accepted Submission(s): 5851
Problem Description
The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105.
Input
Input will consist of multiple problem instances. The first line of the input will contain a single integer indicating the number of problem instances. Each instance will consist of a single line of the form m n1 n2 n3 ... nm where m is the number of integers in the set and n1 ... nm are the integers. All integers will be positive and lie within the range of a 32-bit integer.
Output
For each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.
Sample Input
2 3 5 7 15 6 4 10296 936 1287 792 1
Sample Output
105 10296
Source
East Central North America 2003, Practice
Recommend
JGShining
