B - !সহজ ~কঠিন -- （n个数最小公倍数，gcd）

最新推荐文章于 2022-02-21 16:18:14 发布

几人憔悴几人泪

最新推荐文章于 2022-02-21 16:18:14 发布

阅读量385

点赞数

分类专栏：欧几里得文章标签：最小公倍数 gcd

本文链接：https://blog.csdn.net/qq_27717967/article/details/51399498

版权

欧几里得专栏收录该内容

1 篇文章 0 订阅

订阅专栏

B - !সহজ ~কঠিন

Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu

Submit Status

Description

Find the least common multiple (LCM) of given n integers.

Input

na₁a₂ ... a_n

n is given in the first line. Then, n integers are given in the second line.

Output

Print the least common multiple of the given integers in a line.

Constraints

2 ≤ n ≤ 10
1 ≤ a_i ≤ 1000
Product of given integers a_i(i = 1, 2, ... n) does not exceed 2³¹-1

Sample Input 1

3
3 4 6

Sample Output 1

Sample Input 2

4
1 2 3 5

Sample Output 2

#include <stdio.h>
int gcd(int a,int b){
	if(b==0)
		return a;
	return gcd(b,a%b);
}
int main(){
	int a[1005];
	int i,n,sum;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		scanf("%d",&a[i]);
	sum=1;
	for(i=1;i<=n;i++){
		sum=a[i]/gcd(sum,a[i])*sum;
	}
	printf("%d\n",sum);
	return 0;
}