杭电1019-Least Common Multiple
2015-03-10 18:16
411 查看
#include<stdio.h>
int gcd(int a,int b);
int main()
{
int n,m,a,b,i,sum;//sum是最小公倍数
scanf("%d",&n);
while(n--)
{
scanf("%d",&m);
sum=1;//sum=1
for(i=1;i<=m;i++)
{
scanf("%d",&b);
sum=sum/gcd(sum,b)*b;
}
printf("%d\n",sum);
}
return 0;
}
int gcd(int a,int b)
{
int temp;
while(a%b)
{
temp=b;
b=a%b;
a=temp;
}
return b;
}
int gcd(int a,int b);
int main()
{
int n,m,a,b,i,sum;//sum是最小公倍数
scanf("%d",&n);
while(n--)
{
scanf("%d",&m);
sum=1;//sum=1
for(i=1;i<=m;i++)
{
scanf("%d",&b);
sum=sum/gcd(sum,b)*b;
}
printf("%d\n",sum);
}
return 0;
}
int gcd(int a,int b)
{
int temp;
while(a%b)
{
temp=b;
b=a%b;
a=temp;
}
return b;
}
相关文章推荐
- 杭电 HDU 1019 Least Common Multiple
- 杭电 1019 Least Common Multiple(最小公倍数)
- 杭电acm 1019 Least Common Multiple
- 杭电1019 Least Common Multiple【求最小公倍数】
- 杭电ACM OJ 1019 Least Common Multiple 质因子最快速求最大公因数和最小公倍数
- 杭电ACM HDU 1019 Least Common Multiple
- 杭电Hd 1019 Least Common Multiple
- 杭电1019 Least Common Multiple(已解决)
- 杭电acm 1019 Least Common Multiple
- 杭电 1019 Least Common Multiple
- HDU 1019 Least Common Multiple 数学题
- HDU1019_Least Common Multiple_GCD
- hdu 1019 least common multiple
- hdu 1019 Least Common Multiple【gcd】
- 【HDOJ】1019 -> Least Common Multiple
- HDU—— 1019 Least Common Multiple
- hdu 1019 Least Common Multiple
- hdoj 1019 Least Common Multiple
- HDU oj Least Common Multiple 1019
- hdu 1019 Least Common Multiple_水题