/*
注意可以是负整数,而且在过程中会超过int,所以要用longlong
*/
#include <cstdio>
int main()
{
long long n;
while (scanf("%lld",&n)!=EOF)
(n<1)?printf("%d\n\n",(n+1)*(2-n)/2):printf("%d\n\n",n*(n+1)/2);
return 0;
}
相关文章
- HDU4704:Sum(欧拉降幂公式)
- 2016CCPC东北地区大学生程序设计竞赛 1001 HDU5922
- HDU 1024 Max Sum Plus Plus(DP的简单优化)
- hdu_3549_Flow Problem(最大流)
- 1001 A + B Problem
- HDU - 6437 Problem L.Videos 2018 Multi-University Training Contest 10 (最小费用最大流)
- The King’s Problem HDU - 3861(连通图 缩点 匹配)
- Flow Problem HDU - 3549
- Prime Ring Problem HDU - 1016 (dfs)
- D - Ugly Problem HDU - 5920