Lowest Common Multiple Plus
2013-07-24 10:06
148 查看
Lowest Common Multiple Plus
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25993 Accepted Submission(s): 10515
[align=left]Problem Description[/align]
求n个数的最小公倍数。
[align=left]Input[/align]
输入包含多个测试实例,每个测试实例的开始是一个正整数n,然后是n个正整数。
[align=left]Output[/align]
为每组测试数据输出它们的最小公倍数,每个测试实例的输出占一行。你可以假设最后的输出是一个32位的整数。
[align=left]Sample Input[/align]
2 4 6 3 2 5 7
[align=left]Sample Output[/align]
12 70
[align=left]Author[/align]
lcy
[align=left]Source[/align]
C语言程序设计练习(五)
[align=left]Recommend[/align]
lcy
该成long long就过了。
#include<iostream>
using namespace std;
long long gcd(int a,int b)
{
return (a%b==0? b:gcd(b,a%b));
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
long long a,s=1;
while(n--)
{
cin>>a;
s=(s*a)/(gcd(a,s));
}
cout<<s<<endl;
}
return 0;
}
相关文章推荐
- HDU 2028 Lowest Common Multiple Plus
- hdoj 2028 Lowest Common Multiple Plus (最小公倍数,最大公约数)
- HDU-(Lowest Common Multiple Plus)(包括gcd和lcm算法)
- 【杭电oj2028】Lowest Common Multiple Plus
- HDU 2028 Lowest Common Multiple Plus
- HDU 2028 Lowest Common Multiple Plus(求n个数的最小公倍数)
- 杭电ACM 2028 Lowest Common Multiple Plus
- hdu 2028 Lowest Common Multiple Plus(最小公倍数)
- Lowest Common Multiple Plus(最小公倍数)
- HDU - Lowest Common Multiple Plus
- Lowest Common Multiple Plus(数论)
- HDU2028 Lowest Common Multiple Plus
- 杭电 HDU ACM 2028 Lowest Common Multiple Plus
- 杭电 2028 Lowest Common Multiple Plus
- 杭电2028 Lowest Common Multiple Plus (辗转相除)最优?
- 杭电 2028 Lowest Common Multiple Plus
- Lowest Common Multiple Plus(杭电2028)
- Lowest Common Multiple Plus
- 杭电Hd 2028 Lowest Common Multiple Plus
- HDU2028 Lowest Common Multiple Plus【stein算法】【水题】