UVA 10161 Ant on a Chessboard

UVA 10161 Ant on a Chessboard

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <math.h>
using namespace std;
int main() {
double a;
long long int x, y;
while(scanf("%lf", &a)) {
if(a == 0)
break;
long long int m  =(int)sqrt(a);
long long int s = (int)a - m * m;
if(m % 2 == 0) {
x = m;
y = 1;
if(s <= m + 1 && s > 0) {
x = x + 1;
y = y + s - 1;
}
else if(s > m + 1) {
x = x + 1 - s + m + 1;
y = y + m;
}
}
else {
x = 1;
y = m;
if(s <= m + 1 && s > 0) {
y = y + 1;
x = x + s - 1;
}
else if(s > m + 1) {
y = y + 1  - s + m + 1;
x = x + m;
}
}
printf("%lld %lld\n", x, y);
}
return 0;
}