HDOJ 1001 Sum Problem
2015-07-10 21:10
106 查看
Sum Problem
Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 339300 Accepted Submission(s): 85485
[align=left]Problem Description[/align]
Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).
In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n.
[align=left]Input[/align]
The input will consist of a series of integers n, one integer per line.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
1 100
[align=left]Sample Output[/align]
1 5050
[align=left]Author[/align]
DOOM III
[align=left]Recommend[/align]
We have carefully selected several similar problems for you: 1002 1090 1003 1091 1004
正确但超时码:
#include<stdio.h> int main(){ while(EOF){ int n,i,num=0; scanf("%d",&n); for(i=1;i<=n;i++) num+=i; printf("%d\n\n",num); } return 0; }用公式AC:
用整型还超时,必须得用double型,我也是服惹
#include<stdio.h> int main(){ double n; while(scanf("%lf",&n)!=EOF) printf("%.0lf\n\n",n*(n+1)/2); return 0; }
相关文章推荐
- lower_bound
- mingw编译boost库之thread工程相关错误
- nyoj--277车牌号
- mac下非常好用的命令行工具 iTerm2
- OSGEarth的测量分析
- 【Cocos2d-x】控制音量的滚动条
- C# FTP
- poj1737 组合dp
- java 动态代理实现原理
- Eclipse正常启动tomcat但无法访问主页
- Splitter
- 另一种场景下的js @提到好友
- Word Ladder II?
- java.io.Serializable浅析
- ZOJ 3838 Infusion Altar
- Apache 2.4虚拟主机配置
- Java字符串分割的三种方法
- Bash 快捷键
- 安卓Context.startService()详解
- nyoj 56 阶乘因式分解