HDU：1019 Least Common Multiple

Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 50498    Accepted Submission(s): 19183
题目链接

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
  
  
  
  


  
  
  
  

   
   解题思路：
  
  
  
  

   
   题目意思就是给出一组数，求这组数的最小公倍数，只要理解了题意，题目就变得非常简单，从一组数中最大的入手，考虑最大数的（1,2,3...倍）是不是最小公倍数就可以了。
  
  
  
  


  
  
  
  

   
   
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <set>

using namespace std;

int n,m,a[100000],mmax;
int Ans(int temp)
{
    for(int i = 0; i < m; i++)
        if(temp%a[i]!=0)
            return Ans(temp+mmax);
    return temp;
}
int main()
{
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&m);
        scanf("%d",&mmax);
        a[0]=mmax;
        for(int i = 1; i < m; i++)
        {
            scanf("%d",&a[i]);
            if(a[i]>mmax)
                mmax = a[i];
        }
        int ans = Ans(mmax);
        printf("%d\n",ans);
    }
    return 0;
}