uva 10161 - Ant on a Chessboard

#include<iostream>

using namespace std;

int main()
{
int n;
while(true)
{
cin>>n;
if(n==0) break;
int x,y,t;
x=y=0;
t=0;
for(int i=1;i<=n/2+1;++i)
{
if(t+2*i -1>=n)
{
if(i%2==0)
{
y+=i;
if(n-t>=i) {x+=i; y-=n-t-i;}
else x+=n-t;
break;
}
else
{
x+=i;
if(n-t>=i){  y+=i;x-=n-t-i;}
else        y+=n-t;
break;
}
}
t+=2*i-1;
}
cout<<x<<" "<<y<<endl;
}
return 0;
}