NYOJ 215 Sum
来源:互联网 发布:win10系统无法连接网络 编辑:程序博客网 时间:2024/04/28 23:50
Sum
时间限制:1000 ms | 内存限制:65535 KB
难度:2
- 描述
- Consider the natural numbers from 1 to N. By associating to each number a sign (+ or -) and calculating the value of this expression we obtain a sum S. The problem is to determine for a given sum S the minimum number N for which we can obtain S by associating signs for all numbers between 1 to N.
For a given S, find out the minimum value N in order to obtain S according to the conditions of the problem.- 输入
- The input consists N test cases.
The only line of every test cases contains a positive integer S (0< S <= 100000) which represents the sum to be obtained.
A zero terminate the input.
The number of test cases is less than 100000. - 输出
- The output will contain the minimum number N for which the sum S can be obtained.
- 样例输入
3120
- 样例输出
27
AC码:
#include<stdio.h>int main(){int n,i,t;while(scanf("%d",&n)&&n){i=1;t=1;while(t!=n){i++;t=i*(i+1)/2;if(t>n){if((t-n)%2==0)t=n;}}printf("%d\n",i);}return 0;}
0 0
- nyoj 215 sum
- NYOJ sum 215
- NYOJ 215 Sum
- NYOJ 215 Sum
- nyoj-215-Sum
- NYOJ-Sum
- NYOJ-640 Geometric sum
- Nyoj 998 sum
- NYOJ 640 Geometric Sum
- NYOJ 1003 MAX SUM
- nyoj-879-Consecutive sum II
- NYOJ The partial sum problem
- NYOJ 436 sum of all integer numbers
- NYOJ 927 The partial sum problem
- nyoj 927 The partial sum problem
- NYOJ 436 sum of all integer numbers
- NYOJ-927 The partial sum problem
- NYOJ-sum of all integer numbers
- 为什么我喜欢Lisp语言(clojure)
- Android 去掉 ImageButton 的白色边框
- 公有云 私有云
- C语言中的函数
- MeasureSpec 是什么?
- NYOJ 215 Sum
- 什么是产品上线?
- texturepacker 非常棒的工具,有福了
- 自定义ViewGroup 注意要点?
- 黑马程序员_7k面试题_银行业务调度系统
- 类和对象
- AutoHotkey实现win8新建文本文件快捷键
- 【读书笔记】代码大全28章:项目管理
- Ajax的4个基本原则