南阳acm 436 sum of all integer numbers
来源:互联网 发布:对网络经济发展的看法 编辑:程序博客网 时间:2024/05/22 02:01
sum of all integer numbers
时间限制:1000 ms | 内存限制:65535 KB
难度:0
- 描述
- Your task is to find the sum of all integer numbers lying between 1 and N inclusive.
- 输入
- There are multiple test cases.
The input consists of a single integer N that is not greater than 10000 by it's absolute value. - 输出
- Write a single integer number that is the sum of all integer numbers lying between 1 and N inclusive.
- 样例输入
3
- 样例输出
6
#include<stdio.h>
int main(){
int n,i,t;
while(scanf("%d",&n)!=EOF)
{
if(n>0)
printf("%d\n",n*(n+1)/2);
else if(n==0)
printf("1\n");
else{
t = -n;
printf("%d\n",-(1+t)*t/2+1);
}
}
return 0;
}
- 南阳acm 436 sum of all integer numbers
- 南阳理工:sum of all integer numbers
- ACM-sum of all integer numbers
- NYOJ 436 sum of all integer numbers
- NYOJ 436 sum of all integer numbers
- ny 436 sum of all integer numbers
- 436 sum of all integer numbers
- sum of all integer numbers
- sum of all integer numbers
- sum of all integer numbers
- sum of all integer numbers
- sum of all integer numbers
- NYOJ 436 sum of all integer numbers(坑人,递归)
- NYOJ - 436 - sum of all integer numbers(注意a<0)
- NYOJ436 sum of all integer numbers
- NYOJ-sum of all integer numbers
- NYOJ 46 sum of all integer numbers
- sum of all integer numbers(坑题,水题)
- 安装软件
- NYOJ-60-谁获得了最高奖学金-2013年10月12日14:55:45
- Bellman_ford算法
- Ubuntu 设置root密码
- OC之【c语言结构体】
- 南阳acm 436 sum of all integer numbers
- 第一次Hacmp配置时的理解
- NYOJ-24-素数距离问题-2013年10月12日14:56:23
- 后缀数组学习笔记——罗穗骞倍增算法代码
- 不用strcpy函数实现字符串复制功能
- 南阳acm 593 Take it easy
- NYOJ-22-素数求和问题-2013年10月12日14:57:01
- 谦虚,学习,看世界
- 第三次配置HACMP