zoukankan      html  css  js  c++  java
  • Least Common Multiple HDU1019

    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. 

    InputInput 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. 
    OutputFor 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
    两个两个求最小公倍数,用到辗转相除注意a先除最大公约在*b这样可以避免使用longlong。
     1 #include <iostream>
     2 using namespace std;
     3 #include<string.h>
     4 #include<set>
     5 #include<stdio.h>
     6 #include<math.h>
     7 #include<queue>
     8 #include<map>
     9 #include<algorithm>
    10 #include<cstdio>
    11 #include<cmath>
    12 #include<cstring>
    13 #include <cstdio>
    14 #include <cstdlib>
    15 #include<cstring>
    16 int qqq(int a,int b)
    17 {
    18     if(a%b==0)
    19         return b;
    20     return qqq(b,a%b);
    21 }
    22 int www(int a,int b)
    23 {
    24     return a/qqq(a,b)*b;
    25 }
    26 int main()
    27 {
    28     int t;
    29     cin>>t;
    30     while(t--)
    31     {
    32         int n;
    33         cin>>n;
    34         int a,b;
    35         a=1;
    36         while(n--)
    37         {
    38             cin>>b;
    39             if(b>a)
    40                 swap(a,b);
    41             a=www(a,b);
    42         }
    43         cout<<a<<endl;
    44     }
    45     return 0;
    46 }
    View Code
  • 相关阅读:
    383. Ransom Note
    598. Range Addition II
    453. Minimum Moves to Equal Array Elements
    492. Construct the Rectangle
    171. Excel Sheet Column Number
    697. Degree of an Array
    665. Nondecreasing Array
    视频网站使用H265编码能提高视频清晰度吗?
    现阶段的语音视频通话SDK需要解决哪些问题?
    企业远程高清会议平台视频会议系统在手机端使用的必备要求有哪些?
  • 原文地址:https://www.cnblogs.com/dulute/p/7288961.html
Copyright © 2011-2022 走看看