Least Common Multiple

Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 44196    Accepted Submission(s): 16584

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

题目意思:这个题很简单,就是给你一些数,求出它们的最小公倍数.

#include <iostream>
#include <cstring>
#include <cmath>
#include <stdio.h>
using namespace std;
typedef long long ll;
int getgcd(ll n,ll m)
{
    if(n<m) swap(n,m);
    if(m==0) return n;
    else
        return getgcd(m,n%m);
}
int fun(ll n,ll m)
{
    return n*m/getgcd(n,m);
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        ll n,a,b;
        cin>>n;
        cin>>a;
        for(ll i=1;i<n;i++)
        {
            cin>>b;
            a=fun(a,b);
        }
        cout<<a<<endl;
    }
    return 0;
}