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 <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

#define INDEX 100

int main(void) {
  long long int x;
  scanf("%lld", &x);
  
  long long int num[INDEX];
  for (int i = 0; i < INDEX; i++) {
    num[i] = (long long int ) i * (long long int ) i * (long long int ) i * (long long int ) i * (long long int ) i; 
  }

  int flag = 0;
  for (int i = 0; i < INDEX; i++) {
    for (int j = 0; j < INDEX; j++) {
      if ((num[i] - num[j]) == x) {
        printf("%d %d\n", i, j);
        flag = 1;
        break;
      } else if ((num[i] + num[j]) == x) {
        printf("%d %d\n", i, (-1) * j);
        flag = 1;
        break;
      }
    }
    if (flag) break;
  }

  return 0;
}