最少需要数字个数

 

描述

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.

样例输入

3
12
0

样例输出

2
7

 
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <stack>
#include <string.h>
#include <math.h>

using namespace std;

int main()
{
    int t,sum,i;
	//freopen("E://Input.txt","r",stdin);
	scanf("%d",&t);
    while (t!=0)
	{
		sum=0;
        for (i=1;;i++)
        {
			sum+=i;
			if (sum==t||(sum>t&&(sum-t)%2==0))
			{
			   printf("%d/n",i);
			   break;
			}
        }
	    scanf("%d",&t);
	}
    return 0;
}