hdu1019

最新推荐文章于 2021-03-30 20:21:45 发布

东曦哥哥

最新推荐文章于 2021-03-30 20:21:45 发布

阅读量430

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/qq_41515833/article/details/88319177

版权

数论专栏收录该内容

34 篇文章 0 订阅

订阅专栏

Least Common Multiple

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

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

题目大意：求n个数的最小公倍数

考点：两个数x和y，设x，y的最大公约数为p，最小公倍数为q，则：x*y=p*q。

求最大公约数p，就用辗转相除法就行。

ac代码：

#include<iostream>
using namespace std;
int arr[11];
int t,n;
int gcd(int a,int b){//两个方法任选一个
	if(b==0)
		return a;
	else
		return gcd(b,a%b);
}
int getGcd(int a,int b){
	int c;
	while(b){
		c=a;
		a=b;
		b=c%b;
	}
	return a;
}
int main(){
	while(cin>>t){
		while(t--){
			cin>>n;
	        for(int i=1;i<=n;i++){
	        	cin>>arr[i];
	        	if(i!=1){
		    	arr[i]=arr[i-1]/getGcd(arr[i-1],arr[i])*arr[i];
	     	    }
 	        } 
	         cout<<arr[n]<<endl;
		}
	}

}