Submission #305819

---

Source Code Expand

#include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define each(it,n) for(__typeof((n).begin()) it=(n).begin();it!=(n).end();++it)

using namespace std;

typedef long long ll;

ll f(ll x) {
    return 4LL * (x * x - x * (x - 1) / 2);  
}

void solve() {
    ll n;
    cin >> n;
    if (n == 1) {
        cout << "0 0" << endl;
        return;
    }
    n -= 2;
    
    ll low = 0, hi = 1500000000;

    while (low + 1 < hi) {
        ll mid = (low + hi) / 2;
        if (f(mid) <= n) {
            low = mid;
        } else {
            hi = mid;
        }
    }

    ll a = hi;
    n -= f(hi - 1);

    ll x = (n + 1) / 2 - a;
    ll y = (n % 2 ? -1LL : 1LL) * (a - abs(x));
    cout << x << " " << y << endl;
}

int main() {
    int q;
    cin >> q;
    rep(i, q) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result