zoj 1797 Least Common Multiple

zoj 1797 Least Common Multiple,第1张

zoj 1797 Least Common Multiple
#include <stdio.h>#include <stdlib.h>#include <iostream>#include <memory.h>#define MAX 10001using namespace std;long long int gcd(long long int x,long long int y){return y == 0? x : gcd(y,x%y);}int main(void){int num[MAX];int ncases,n;scanf("%d",&ncases);while( ncases -- ){scanf("%d",&n);for(int i=0; i<n; i++)scanf("%d",&num[i]);if( n == 1 ){printf("%dn",num[0]);continue;}int temp = gcd(num[0],num[1]);if(temp == 0 ){printf("%dn",temp);continue;}temp = num[0]/temp*num[1];for(int i=2; i<n; i++){int x = gcd(temp,num[i]);if( x == 0 ){temp = 0;break;}temp = temp/x*num[i];}printf("%dn",temp);}    return 0;}

欢迎分享,转载请注明来源:内存溢出

原文地址:https://54852.com/zaji/4895089.html

(0)
打赏 微信扫一扫微信扫一扫 支付宝扫一扫支付宝扫一扫
上一篇 2022-11-12
下一篇2022-11-12

发表评论

登录后才能评论

评论列表(0条)

    保存