杭电ACM1001Sum Problem(1~n的和)
来源:互联网 发布:android 数据库缓存 编辑:程序博客网 时间:2024/06/05 07:54
Sum Problem
Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 334319 Accepted Submission(s): 84056
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
注:此题为:杭电ACM1001Sum Problem(1~n的和)
说明:累加,注意输出格式
已AC源代码:
#include<stdio.h>int main(){int n;while(scanf("%d",&n)!=EOF){int i,sum=0;for(i=1;i<=n;i++){sum+=i;}printf("%d\n",sum);}return 0;}
0 0
- 杭电ACM1001Sum Problem(1~n的和)
- 杭电acm1032 The 3n + 1 problem
- 杭电ACM HDU 1032 The 3n + 1 problem
- 杭电 acm 1032 The 3n + 1 problem
- 杭电 HDU 1032 The 3n + 1 problem
- 杭电1032 The 3n + 1 problem
- 杭电1032:The 3n + 1 problem
- 杭电 Problem 1024 N! 【大数相乘】
- 杭电OJ题1033 The 3n + 1 problem解题报告
- 杭电OJ——1032 The 3n + 1 problem
- HDOJ, 杭电1032, The 3n+1 problem. POJ, 北大OJ,1207....数学题。。又一发
- The 3n + 1 problem(杭电1032)(暴力求解)
- 杭电OJ(HDOJ)1032题:The 3n + 1 problem(穷举,水题)
- 杭电1032——The 3n + 1 problem(简单题)
- 杭电acm1001 Snm Problem的解法
- 杭电ACM OJ 1032 The 3n + 1 problem 数据很弱,但是也需要思考一个方向
- 杭电Problem-2717
- 杭电2841 容斥定理求1到n之间和x互质的数的总数
- https://leetcode.com/problems/longest-palindromic-substring/
- Bitmap有效的压缩方式
- construct2游戏的加载过程
- 并查集小结
- Facebook北京大学2015年宣讲会小记【Facebook Technical Talk】
- 杭电ACM1001Sum Problem(1~n的和)
- 1!+2!+3!+...+10!
- 消息队列实现即时通讯
- C++中关于构造函数调用次序的一道经典例题及对虚函数构造顺序的理解
- gsmake -- golang版gradle
- 黑马程序员--反射
- 派生类和基类的函数调用
- 编程学习路线
- 打印菱形