The ? 1 ? 2 ? ... ? n = k problem uva 10025

 The ? 1 ? 2 ? ... ? n = k problem

The problem

Given the following formula, one can set operators '+' or '-' instead of each '?', in order to obtain a given k
? 1 ? 2 ? ... ? n = k

For example: to obtain k = 12 , the expression to be used will be:
- 1 + 2 + 3 + 4 + 5 + 6 - 7 = 12 
with n = 7

The Input

The first line is the number of test cases, followed by a blank line.

Each test case of the input contains integer k (0<=|k|<=1000000000).

Each test case will be separated by a single line.

The Output

For each test case, your program should print the minimal possible n (1<=n) to obtain k with the above formula.

Print a blank line between the outputs for two consecutive test cases.

Sample Input

2

12

-3646397

Sample Output

7

2701

题意：很容易理解；

解决方案：先求根，从根开始枚举，枚举到他的数列的和与原数的差是偶数的那个就是最小的，另外注意0的处理。

#include<iostream>
#include<cstdio>
#include<math.h>
using namespace std;
int main()
{
    long long t,k;
    cin>>t;
    while(t--)
    {
        scanf("%lld",&k);
       // cout<<k;
        if(k<0) k=fabs(k);
       // cout<<k;
        long long root_k=sqrt(k);
        //cout<<root_k;
        for(;;)
        {
            if(root_k!=0&&(root_k*(root_k+1)/2)>=k)
            {
               long long s=root_k*(root_k+1)/2;
                long long sub=(s-k);//cout<<root_k<<endl;
                if(sub%2==0&&(sub)/2<=s) {cout<<root_k<<endl;break;}
               // else root_k++;

            }
              root_k++;
        }
        if(t)
        cout<<endl;
    }
    return 0;
}