uva 10161 - Ant on a Chessboard

#include<iostream>
#include<math.h>
using namespace std;
int main(){
int n;
while(cin>>n){
if(n==0)
break;
if(n==1){
cout<<"1 1"<<endl;
continue;
}
int nth=(int)sqrt((double)n);
nth=(n>nth*nth)?(nth+1):nth;
int flag=nth%2;
int temp=n-(nth-1)*(nth-1)-nth;
if(flag){

if(temp>=0)
cout<<nth-temp<<" "<<nth<<endl;
else
cout<<nth<<" "<<nth+temp<<endl;
}
else{
if(temp>=0)
cout<<nth<<" "<<nth-temp<<endl;
else
cout<<nth+temp<<" "<<nth<<endl;
}
}
}