Problem 1001
来源:互联网 发布:大数据分析系统源代码 编辑:程序博客网 时间:2024/06/07 10:42
Sum Problem
Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 184771 Accepted Submission(s): 43962
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
Author
DOOM III
因为n很大的时候n*(n+1)的值会溢出。可以判断奇偶然后先做除法。注意这句:You may assume the result will be in the range of 32-bit signed integer.要求是你的结果要在32位有符号整型范围内。假设n*(n+1)/2的结果刚好满足32位。但是在做除法前n*(n+1)的结果就超过了32位。来自:http://zhidao.baidu.com/question/502897991.html&from=emailmsg#submit
感谢 DN_海伦泰勒
#include <iostream>using namespace std;void main(){int n;while(cin>>n) {int i,sum=0;for(i=1;i<=n;i++) sum=sum+i;cout<<sum<<endl<<endl;}}
#include <iostream>using namespace std;void main(){int n;while(cin>>n) {cout<<n*(n+1)/2<<endl<<endl;}}
- Problem - 1001: Sum Problem
- Problem - 1001 Sum Problem
- Problem - 1001_Sum Problem
- Problem 1001
- Problem 1001
- problem-1001
- Problem 1001
- Problem-1001
- 【HDOJ】 <Problem - 1001> : Sum Problem
- 西安电子Problem 1001 A+B Problem
- ZOJ Problem Set - 1001||A + B Problem
- 1001 Problem B && 1008 Problem I
- 1001 A + B Problem
- 1001 Sum Problem.
- [HUD 1001]Sum Problem
- 1001 Sum Problem
- 1001 Sum Problem
- 1001:Sum Problem
- 怎样面对凌乱的代码:源码分析利器Source Insight
- 练习1.2.2
- 将integer的bit位翻转
- 如何用shell脚本实现自动telnet
- 二、再看看不是PyObject的PyXXXObject
- Problem 1001
- Proteus实例整理汇总
- 三、对象到底如何创建
- Gray Code
- 安装和设置IE8的默认搜索提供者
- 如何在csdn中插入代码
- photoshop 基础知识之 混合模式计算公式
- Photoshop图层混合模式的计算公式
- ps图层模式详解带计算公式