Problem:
Score : 400 points

Problem Statement

Give a pair of integers (A, B) such that A^5-B^5 = X.
It is guaranteed that there exists such a pair for the given integer X.

Constraints

1 \leq X \leq 10^9

X is an integer.

There exists a pair of integers (A, B) satisfying the condition in Problem Statement.

Input

Input is given from Standard Input in the following format:

X

Output

Print A and B, with space in between.
If there are multiple pairs of integers (A, B) satisfying the condition, you may print any of them.

A B

Sample Input 1

33

Sample Output 1

2 -1

For A=2 and B=-1, A^5-B^5 = 33.

Sample Input 2

1

Sample Output 2

0 -1

Solution in C# (.NET Core 3.1.201) (judge verdict: Wrong Answer)


using System;
using System.Collections.Generic;
using System.Linq;

class Program
{

    public static void Main( )
    {
        // どこまで調べるか
        int N = 100;

        int X = int.Parse( Console.ReadLine( ) );
        var power5s = new Dictionary<int, long>( );
        power5s[ 0 ] = 0;
        for ( int i = 1; i <= N; i++ )
        {
            long power5 = i * i * i * i * i;
            power5s[ i ] = power5;
            power5s[ -i ] = -power5;
        }

        for ( int i = -N; i <= N; i++ )
        {
            long a = power5s[ i ];
            int left = -N - 1;
            int right = N + 1;
            while ( right - left > 1 )
            {
                int mid = ( left + right ) / 2;
                long value = power5s[ mid ];
                if ( value >= a - X ) right = mid;
                else left = mid;
            }


            if ( left == -N - 1 | right == N + 1 )
            {
                continue;
            }

            long b = power5s[ right ];
            if ( a - b == X )
            {
                Console.WriteLine( $"{i} {right}" );
                break;
            }
        }
    }
}