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

UVA 10025-The ? 1 ? 2 ? … ? n = k problem

#include <stdio.h>
#include <math.h>
#include <iostream>
using namespace std;
int main() {
long long int n;
long long int a;
long long int i;
cin >> n;
while(n--) {
cin >> a;
if (a < 0)
a = -a;
if(a == 0)
i = 3;
else {
i = (sqrt(1+8*a)-1) / 2;
for(long long int l = (i * (1 + i)/2 - a) ; l < 0 || l % 2 != 0;) {
i++;
l = l + i;
}
}
printf("%lld\n", i);
if(n)
printf("\n");

}
return 0;
}