Problem - 1001_Sum Problem
来源:互联网 发布:mac homebrew 是什么 编辑:程序博客网 时间:2024/06/07 01:49
Sum Problem
Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 297065 Accepted Submission(s): 74177
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
Recommend
We have carefully selected several similar problems for you: 1090 1091 1004 1092 1089
#include<stdio.h>int main(){ int n; while(scanf("%d",&n)!=EOF){ printf("%d\n\n",(int)((1+n)*0.5*n)); } return 0;}
0 0
- Problem - 1001_Sum Problem
- ACM之杭电——1001_Sum Problem
- Problem - 1001: Sum Problem
- Problem - 1001 Sum Problem
- problem
- Problem
- problem
- Problem
- Problem
- Problem
- Problem
- Problem
- Problem
- problem
- Problem
- Problem
- Problem
- Problem
- velociy 插件安装
- NYOJ 86 找球号
- qemu 内核启动输出结果保存
- 黑马程序员———数组
- Windows进程间通信的各种方法
- Problem - 1001_Sum Problem
- c#中DataGridView简介
- iOS学习之 plist文件的读写
- 对MYSQL IFNULL函数的使用进行了详细的叙述
- Eclipse 安装 html插件
- 津门谈创新 天大论构建
- java.lang.IllegalStateException: Immutable bitmap passed to Canvas constructor
- 1013. Battle Over Cities (25)
- js和jquery获取父级元素、子级元素、兄弟元素的方法