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

#include<iostream>
#include<math.h>
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
int k;
cin>>k;
if(k==0){
cout<<3<<endl<<endl;
continue;
}
if(k<0)
k=-k;
int l=(int)sqrt((double)(2*k));
for(int i=l;;i++){
if((i+1)*i>=2*k&&((i+1)*i/2-k)%2==0){
cout<<i<<endl;
break;
}
}
if(n>0)
cout<<endl;
}
}