Submission #305674

---

Source Code Expand

#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <iterator>
#include <bitset>

using namespace std;

typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

int q;

ll abs_sum(ll n) {
	ll l = -1, r = ten(9);
	while (r - l != 1) {
		ll md = (l + r) / 2;
		ll val = md * (md + 1) * 2 + 1;
		if (n <= val) r = md;
		else l = md;
	}
	return r;
}

int main(){
	cin >> q;
	FOR(i, q) {
		ll n; cin >> n;
		ll abs_xy = abs_sum(n);
		n -= 1 + abs_xy * (abs_xy - 1) * 2;
		n--;
		ll x = (n + 1) / 2 - abs_xy;
		ll y = abs_xy - abs(x);
		if (n % 2 == 1) y = -y;
		cout << x << " " << y << endl;
	}

}

Submission Info

Judge Result