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++ (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;

vector<int> xFive;

void rowFiveGen(){
	int base = 0;
  	while(pow(base,5) <= 20000000000){
    	xFive.push_back(pow(base, 5));
        base++;
        //cout << pow(base, 5) << " ";
    }
}

int main(){
  rowFiveGen();
  int X;
  cin >> X;
  int xFiveSize = xFive.size();
  for(int i = 0; i < xFiveSize; i++){
  	for(int s= 0; s < xFiveSize; s++){
    	if(X == (xFive[i] - xFive[s])){
        	cout << i << " " << s;
          	return 0;
        }      	
        if(X == (xFive[i] + xFive[s])){
        	cout << i << " " << -s;
          	return 0;
        }
        if(X == (-xFive[i] - xFive[s])){
        	cout << -i << " " << s;
          	return 0;
        }      	
        if(X == (-xFive[i] + xFive[s])){
        	cout << -i << " " << -s;
          	return 0;
        }  
     }
  }
}