Least Common Multiple（2019）

最新推荐文章于 2022-01-07 14:53:09 发布

下定决心做一件事

最新推荐文章于 2022-01-07 14:53:09 发布

阅读量508

点赞数

分类专栏： acm基础

本文链接：https://blog.csdn.net/dqsyguoguo/article/details/39013363

版权

acm基础专栏收录该内容

67 篇文章 1 订阅

订阅专栏

Least Common Multiple

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

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
  
  
  
  

  
  
  
  
   
   --------------------------------------------------
  
  
  
  

  
  
  
  

  
  
  
  
   
   F1:
  
  
  
  

  
  
  
  
   
   #include<stdio.h>
int main()
{
    int i,n,s[500],a,t;
     scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        a=0;
        for(i=1;i<=n;i++)
        {
            scanf("%d",&s[i]);
            if(a<s[i])  a=s[i];
        }
        
        int m;
        m = a;
        for(i=1;i<=n;i++)
          if(a%s[i]!=0)
          {
              a+=m;
              i=0;
          }


        printf("%d\n",a);
    }
    return 0;


}

  
  
  
  

  
  
  
  

  
  
  
  

  
  
  
  

  
  
  
  
   
   -----------------------------------
  
  
  
  

  
  
  
  

  
  
  
  

  
  
  
  

  
  
  
  
   
   F2:
  
  
  
  

  
  
  
  
   
   #include<iostream>
using namespace std;


int gcd(int a,int b) //欧几里德求最大公约数
    {
        if(b==0) return a;
        return gcd(b,a%b);
    }
int main()
{
    int t,n,m,i,a,b;
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        a=m;
    for(i=1;i<n;i++)
    {
        cin>>m;
        if(a<m)
        {
        b=a;a=m;m=b;
        }
        a=a/gcd(a,m)*m; //最小公倍数=两数之积/最大公约数
    }
    cout<<a<<endl;
    }
    return 0;
}