1001 Sum Problem
来源:互联网 发布:自学电脑编程最快多久 编辑:程序博客网 时间:2024/06/13 23:03
Sum Problem
Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 341647 Accepted Submission(s): 86129
Problem Description
Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).
In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n.
In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n.
Input
The input will consist of a series of integers n, one integer per line.
Output
For each case, output SUM(n) in one line, followed by a blank line. You may assume the result will be in the range of 32-bit signed integer.
Sample Input
1100
Sample Output
15050
这个题是求自然数前n项的和,结果在int 范围内,有两种处理方法,一个是循环累加,一个是求和公式,下面我用的是求和公式.....
#include<stdio.h>int main() {int a,b;while(scanf("%d",&a)!=EOF){b=a*(a+1)/2;printf("%d\n",b);}return 0;}
提交上去,wrong answer!!
为什么,想来想去,才发现这个程序的漏洞,你想到了吗?输个五万(50000)上去试试就知道了......
就是说,数据结果不超过int 但是中间过程可能超过int ,这里有两种方法解决
1,用long long 型运算,2,用另外一种方法.......
这样的方法可以防溢出,不懂的话,好好想想为什么,想通了的确对自己有帮助,这是个很好的思想..嘿嘿
#include<stdio.h>int main() {int a,b;while(scanf("%d",&a)!=EOF){b=(a%2)?((a+1)/2*a):(a/2*(a+1));printf("%d\n\n",b);}return 0;}
0 0
- Problem - 1001: Sum Problem
- Problem - 1001 Sum Problem
- 【HDOJ】 <Problem - 1001> : Sum Problem
- 1001 Sum Problem.
- [HUD 1001]Sum Problem
- 1001 Sum Problem
- 1001 Sum Problem
- 1001:Sum Problem
- HDU 1001 Sum Problem
- HDU--1001--Sum Problem
- hdu 1001 Sum Problem
- hdu 1001 Sum Problem
- hdu 1001 Sum Problem
- HDOJ 1001 Sum Problem
- hdu 1001 sum problem
- HDU 1001 Sum Problem
- hdu 1001 Sum Problem
- 1001 Sum Problem
- codeforce 559 C Gerald and Giant Chess
- ArcGIS Runtime for Android开发教程V2.0(5)基础篇---图层
- Linux下crontab+php实现Mysql数据库定时备份
- 读书笔记MoreEffectiveC++(13)
- 打包jar
- 1001 Sum Problem
- ArcGIS Runtime for Android开发教程V2.0(6)基础篇---空间要素可视化
- Android Studio 开发利器【常用插件】
- 25 - 二叉树中和为某一值的路径
- Java面试题全集(中)
- 纯CSS实现未知高宽的图片在容器中水平和垂直居中
- Android命令行测试BT WiFi Sensor工作状态
- 机房收费系统之组合查询
- ArcGIS Runtime for Android开发教程V2.0(7)基础篇---空间要素可视化2