ZOJ 1797 Least Common Multiple

关注

原创最新推荐文章于 2025-06-08 07:00:43 发布 360 阅读 AI 写同款· GEO 优化 ›

别再写前端了！用Gradio 3.x + HuggingFace Spaces，5分钟把你的Python算法变成网页应用本文介绍如何利用Gradio 3.x和HuggingFace Spaces快速将Python算法转化为网页应用，无需前端开发经验。通过5行代码和简单的Git命令，即可实现专业级Web界面部署，大幅提升算法展示效率。特别适合算法工程师和数据科学家快速分享模型成果。阅读详情

Least Common Multiple

Time Limit: 2 Seconds Memory Limit: 65536 KB

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

题意：求多个数的最大公倍数

思路：最大公约数和最大公倍数的关系，2个数的最大公倍数＝2个数相乘／最大公约数

代码：

#include <stdio.h>

long long gcd(long long a,long long b)
{
long long r;
while(b!=0)
{
r=a%b;
a=b;
b=r;
}
return a;
}

long long lcd(long long x,long long y,long long z)
{
return x*y/z;
}

int main()
{
long long N,i;
long long a,b,c,k;
scanf("%lld",&N);
while (N--) {
long long n;
scanf("%lld",&n);
if(n==0)
continue;
scanf("%lld",&a);
if(n==1)
{
printf("%lld\n",a);
continue;
}
scanf("%lld",&b);
k=lcd(a,b,gcd(a,b));
for(i=2;i<n;i++)
{
scanf("%lld",&c);
k=lcd(k,c,gcd(k,c));
}
printf("%lld\n",k);
}
return 0;
}