uva-10161水题数学

#include<iostream>
#include<cmath>
#define maxn 100000
using namespace std;
long long ans[maxn],n,k;
void init()
{
    for(long long i=0;i<maxn;i++)
    ans[i]=i*i;
}
long long a1,a2;
int main()
{
    init();
    while(cin>>n&&n)
    {
        k=pow(n,0.5)+1;
        a1=n-(k-1)*(k-1);
        a2=k*k-n+1;
        if(a1<k+1)
        {
            if(k%2){if((k-1)*(k-1)==n){a1++;k--;}cout<<k<<" "<<a1<<endl;}
            else {if((k-1)*(k-1)==n){a1++;k--;}cout<<a1<<" "<<k<<endl;}
        }
        else
        {
            if(k%2)cout<<a2<<" "<<k<<endl;
            else cout<<k<<" "<<a2<<endl;
        }
    }
}