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

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=29592#problem/E

// File Name: bo_jwolf5.cpp// Author: rudolf// Created Time: 2013年08月19日 星期一 10:13:00#include<vector>#include<list>#include<map>#include<set>#include<deque>#include<stack>#include<bitset>#include<algorithm>#include<functional>#include<numeric>#include<utility>#include<sstream>#include<iostream>#include<iomanip>#include<cstdio>#include<cmath>#include<cstdlib>#include<cstring>#include<ctime>using namespace std;int main(){long long n , Case , i , sum ;int temp ;while( cin >> Case ){while( Case-- ){cin >> n ;n = labs( n ) ;sum = 0 ;for( i = 1 ; ; ++i ){sum += i ;if( sum >= n ){if( ( sum - n ) % 2 == 0 )break ;}}printf( Case ? ( "%lld\n\n" ) : ( "%lld\n" ) , i ) ;}}return 0;}