杭电 1019 简单数学题

 就是一道简单数学题,求多个数的最小公倍数。。。题目:

Least Common Multiple

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


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
 

ac代码:
#include <iostream>
#include <cstdio>
using namespace std;
__int64 max(__int64 a,__int64 b){
  return a>b?a:b;
}
__int64 min(__int64 a,__int64 b){
  return a<b?a:b;
}
__int64 gcd(__int64 x,__int64 y){
  __int64 mmax=max(x,y);
  __int64 mmin=min(x,y);
  __int64 r;
  while(mmin!=0){
    r=mmax%mmin;
	mmax=mmin;
	mmin=r;
  }
  return mmax;
}
int main(){
 //freopen("1.txt","r",stdin);
  int numcase;
  scanf("%d",&numcase);
  while(numcase--){
    __int64 n,x,y=1,z=1;
	scanf("%I64d",&n);
	while(n--){
	  scanf("%I64d",&x);
	  int gg=gcd(x,z);
	  y=x*z/gg;
	  z=y;
	}
	printf("%I64d\n",y);
  }
  return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值