HDU——1001
来源:互联网 发布:泡泡堂有mac版吗 编辑:程序博客网 时间:2024/05/17 22:28
** Sum Problem**
Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 469958 Accepted Submission(s): 118457
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.
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
1
100
Sample Output
1
5050
Author
DOOM III
Recommend
We have carefully selected several similar problems for you: 1002 1003 1091 1004 1092
分析:此题一般会想到一个循环,其实数学家高斯的方法 也可以等差数列求和的求出,这题有个地方需要注意
用等差数列求和需要使用longlong数据类型,应该是相乘时临时变量时int ,超出了int的表示范围,导致报错
考点:数学公式的灵活运用,ACM就是用编程语言代替人工计算解决数学问题吧
#include<bits/stdc++.h>using namespace std;int main(){ long long n; while(~scanf("%d",&n)) { cout<<(n+1)*n/2<<endl; cout<<endl; }}
- HDU——1001
- hdu校赛—1001
- HDU 2112——HDU Today
- HDU——2107 Founding of HDU
- HDU——2108 Shape of HDU
- hdu 2112 ——HDU Today
- HDU 2110——Crisis of HDU
- HDU—2122HDU Today(Dijsktra)
- hdu——4370
- hdu——2018
- hdu——1004
- hdu——2027
- HDU——1198
- hdu——War
- HDU——Queuing
- hdu——1004
- HDU—— 1028
- hdu——5166
- Linux计划任务详解
- 有趣的题目(进制转换)
- 监督学习和非监督学习的区别
- LeetCode之Maximum Subarray
- 学习笔记-01背包、完全背包、多重背包
- HDU——1001
- 搜索之城堡问题
- lnux定时运行命令
- BZOJ3242: [Noi2013]快餐店
- 仿-百度外卖下拉刷新 让你的应用酷起来
- 判断闰年
- android 客户端增量更新
- hdu 2192 (二进制)多重背包
- QT/c++ 简易俄罗斯方块