hdoj 2028 Lowest Common Multiple Plus
2017-10-18 16:59
411 查看
题目传送门:http://acm.split.hdu.edu.cn/showproblem.php?pid=2028 题目很简单,一般人8分钟内都能敲出来。当时自己提交后发现返回了wrong answer,有点蒙。想想32位整数在int啊,然后一想,又犯了数据溢出的错误(fact()函数中),改用long long #include <stdio.h> int fact(long long a,long long b) { long long s=a*b; long long c; while(a%b) { c=a%b; a=b; b=c; } return s/b; } int main() { long long n,i; while(scanf("%I64d",&n)!=EOF) { long long arr ; for(i=0;i<n;i++) { scanf("%I64d",&arr[i]); } for(i=0;i<n-1;i++) { arr[i+1]=fact(arr[i],arr[i+1]); } printf("%I64d\n",arr[n-1]); } return 0; }
相关文章推荐
- hdoj2028 Lowest Common Multiple Plus
- HDOJ2028 ( Lowest Common Multiple Plus ) 【水题,lcm】
- HDOJ2028_Lowest Common Multiple Plus
- 【hdoj2028】Lowest Common Multiple Plus
- hdoj 2028 Lowest Common Multiple Plus【GCD】
- HDOJ_杭电2028_Lowest Common Multiple Plus 多个数字的最小公倍数
- [热身题][hdoj_2028]Lowest Common Multiple Plus
- hdoj-2028-Lowest common multiple plus
- hdoj 2028 Lowest Common Multiple Plus C++
- HDOJ 2028 Lowest Common Multiple Plus (求n个数的最小公倍数)
- 【基础训练】HDOJ2028 Lowest Common Multiple Plus
- HDOJ 2028 Lowest Common Multiple Plus
- hdoj-2028-Lowest common multiple plus
- hdoj 2028 Lowest Common Multiple Plus (最小公倍数,最大公约数)
- Num 38 : HDOJ : 2028 Lowest Common Multiple Plus [ 多个数的最小公倍数 ]
- hdoj 2028 Lowest Common Multiple Plus
- hdoj-2028-Lowest Common Multiple Plus
- HDOJ_2028(Lowest Common Multiple Plus)
- HDOJ 2028 Lowest Common Multiple Plus
- HDOJ 2028 Lowest Common Multiple Plus