UVA - 10161 Ant on a Chessboard

#include<iostream>
#include<cstdio>
#include<string.h>
#include<stdlib.h>
#include<cmath>
using namespace std;
int main() {
long long  N;
while(scanf("%lld", &N) != EOF && N) {
int x = 0, y = 0;
long long n = floor(sqrt(N) + 0.5);
if (n % 2 == 0) {
x = n;
y = 1;
if (N < n * n)
y = y + n * n - N;
else if (N > n * n) {
x++;
y = N - n * n;
}
}
else {
y = n;
x = 1;
if (N < n * n)
x = x + n * n - N;
else if (N > n * n) {
y++;
x = N - n * n;
}
}
printf("%d %d\n", x, y);
}
return 0;
}