提出 #63799556

---

ソースコード 拡げる

#define _CRT_SECURE_NO_WARNINGS

#include<iostream>
#include<fstream>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<array>
#include<unordered_set>
#include<unordered_map>
#include<cstring>
#include<string>
#include<memory>
#include<iomanip>
#include<cassert>
#include<cmath>
#include<random>
#include<algorithm>
#include<chrono>

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#define int long long
#define ld long double
#define endl '\n'

using namespace std;

void solve() {
	int n; cin >> n;

	for (int delta = 1; delta <= 2'000'000; delta++) {
		// x, y = x + delta
		if (n % delta != 0) continue;
		int ost = n / delta;

		int l = 1, r = sqrt(ost) + 256;
		while (r - l > 1) {
			int mid = (r + l) / 2;

			int x = mid, y = x + delta;
			int val = x * x + x * y + y * y;

			if (val > ost) r = mid;
			else l = mid;
		}

		int x = l, y = x + delta;
		int val = x * x + x * y + y * y;
		if (val == ost) {
			cout << y << " " << x << endl;
			return;
		}
	}
	cout << -1 << endl;
}

signed main() {
	// freopen("input.txt", "r", stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);

	// int q; cin >> q; while (q--)
	solve();
}

提出情報

ジャッジ結果