（UVA） The ? 1 ? 2 ? ... ? n = k problem

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

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

int main()
{
    int T;
    scanf("%d",&T);
    long long int n;
    while(T--)
    {
        long long int sum = 0;
        scanf("%lld",&n);
        if(n<0)
        {
            n = -n;
        }
        int ii  = 0;
        for(int i=1;;i++)
        {
            sum += i;
            if(sum >= n)
            {
                ii = i;
                break;
            }
        }
        if((sum - n)%2 == 0)
        {
            if(T>0)
            {
                printf("%d\n\n",ii);
            }
            else
            {
                printf("%d\n",ii);
            }
            continue;
        }
        for(int j=ii+1;;j++)
        {
            sum += j;
            if((sum-n)%2 == 0)
            {
                if(T>0)
                {
                    printf("%d\n\n",j);
                }
                else
                {
                    printf("%d\n",j);
                }
                break;
            }
        }
    }
    return 0;
}