NYOJ 46 sum of all integer numbers
来源:互联网 发布:留学cv 知乎 编辑:程序博客网 时间:2024/05/23 01:02
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
大意是:输入一个N,(可正可负),输出1-N的和
需要注意的是:如果N是负数就输出N-1的和
#include<stdio.h>#include<stdlib.h> int main(){ int n; while(scanf("%d", &n) != EOF){ if(n < 1) printf("%d\n", (1+n)*(abs(n)+2)/2);//负数情况,项数得加上2 else printf("%d\n", (1+n)*n/2); }}
阅读全文
0 0
- NYOJ 46 sum of all integer numbers
- NYOJ 436 sum of all integer numbers
- NYOJ 436 sum of all integer numbers
- NYOJ-sum of all integer numbers
- NYOJ 436 sum of all integer numbers(坑人,递归)
- NYOJ - 436 - sum of all integer numbers(注意a<0)
- 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
- NYOJ436 sum of all integer numbers
- ny 436 sum of all integer numbers
- ACM-sum of all integer numbers
- 436 sum of all integer numbers
- 南阳acm 436 sum of all integer numbers
- sum of all integer numbers(坑题,水题)
- 【模线性方程 && 扩展欧几里德】POJ
- Spring框架中调用HanLP分词的方法
- VTK7.1.1+VS2013+QT5.6.1安装教程
- 源码安装PHP7和ApachePHP支持
- 2. 观察者模式
- NYOJ 46 sum of all integer numbers
- mysql数据库增删查改操作命令
- Spring 基于注解的配置(一)(@Conmponent ,@Repository,@Service,以及对访问资源的限定)
- Codeforces Round #438 (Div. 1 + Div. 2 combined) D. Huge Strings
- 操作系统磁盘调度算法
- 设计模式笔记
- js基础
- cf_438_B
- Andrew-Coursera-DL课程-笔记part1-2(Shallow neural networks)