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): 38998    Accepted Submission(s): 14729

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   |   We have carefully selected several similar problems for you:   1071  1170  1032  1022  1028 

 

数学题，可以说得上一个模板吧。

 

题意：求多个数的最小公倍数。

 

附上代码：

 1 #include <iostream>
 2 #include <cstdio>
 3 using namespace std;
 4 int add(int a,int b)
 5 {
 6     int c;
 7     while(b!=0)
 8     {
 9         c=a%b;
10         a=b;
11         b=c;
12     }
13     return a;
14 }
15 int main()
16 {
17     int n,m,i,t,s,k;
18     scanf("%d",&n);
19     while(n--)
20     {
21         scanf("%d",&m);
22         scanf("%d",&k);
23         for(i=1; i<m; i++)
24         {
25             scanf("%d",&s);
26             t=add(k,s);
27             k=k/t*s;
28         }
29         printf("%d\n",k);
30     }
31     return 0;
32 }

 

转载于:https://www.cnblogs.com/pshw/p/4797662.html