提出 #63814918

---

ソースコード 拡げる

#include <iostream>
#include <cmath>

using namespace std;

// Function to check if a number is a perfect cube and find its integer cube root
bool isPerfectCube(long long n, long long &y) {
    if (n <= 0) return false;
    y = round(cbrt(n)); // Get the cube root
    return y * y * y == n;
}

void findXY(long long N) {
    long long max_x = cbrt(abs(N)) + 1e6; // Ensuring we check sufficiently large values

    for (long long x = 1; x <= max_x; ++x) {
        long long y3 = x * x * x - N;
        long long y;
        if (y3 > 0 && isPerfectCube(y3, y)) {
            cout << x << " " << y << endl;
            return;
        }
    }

    cout << -1 << endl;
}

int main() {
    long long N;
    cin >> N;
    findXY(N);
    return 0;
}

提出情報

ジャッジ結果