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



Sample input:
33


Sample output:
2 -1

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *


class Scanner():
    @staticmethod
    def int():
        return int(sys.stdin.readline().rstrip())

    @staticmethod
    def string():
        return sys.stdin.readline().rstrip()

    @staticmethod
    def map_int():
        return [int(x) for x in Scanner.string().split()]

    @staticmethod
    def string_list(n):
        return [Scanner.string() for i in range(n)]

    @staticmethod
    def int_list_list(n):
        return [Scanner.map_int() for i in range(n)]

    @staticmethod
    def int_cols_list(n):
        return [Scanner.int() for i in range(n)]


class Math():
    @staticmethod
    def gcd(a, b):
        if b == 0:
            return a
        return Math.gcd(b, a % b)

    @staticmethod
    def lcm(a, b):
        return (a * b) // Math.gcd(a, b)

    @staticmethod
    def divisor(n):
        res = []
        i = 1
        for i in range(1, int(n ** 0.5) + 1):
            if n % i == 0:
                res.append(i)
                if i != n // i:
                    res.append(n // i)
        return res

    @staticmethod
    def round_up(a, b):
        return -(-a // b)

    @staticmethod
    def is_prime(n):
        if n < 2:
            return False
        if n == 2:
            return True
        if n % 2 == 0:
            return False
        d = int(n ** 0.5) + 1
        for i in range(3, d + 1, 2):
            if n % i == 0:
                return False
        return True


def pop_count(x):
    x = x - ((x >> 1) & 0x5555555555555555)
    x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
    x = x + (x >> 8)
    x = x + (x >> 16)
    x = x + (x >> 32)
    return x & 0x0000007f


MOD = int(1e09) + 7
INF = int(1e15)


def solve():
    X = Scanner.int()
    L = [(0, 0) for _ in range(70)]
    for i in range(0, 70):
        L[i] = (i, i ** 5)
    for l1 in L:
        for l2 in L:
            a, b = l1[1], l2[1]
            c, d = l1[0], l2[0]
            if a < b:
                continue
            if a - b == X:
                print(c, d)
                return
            elif a + b == X:
                print(c, -d)
                return


def main():
    # sys.stdin = open("sample.txt")
    solve()


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math
x = int(input())
i = 1
print(i)
while True:
  t = math.pow(i, 5)-x
  if t >= 0:
    b = math.pow(t, 1/5)
    if b.is_integer():
      break
  else:
    b = math.pow(-t, 1/5)
    if b.is_integer():
      break
  i += 1

Submission status: Wrong Answer

Solution code:
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors

x = int(input())
for i in make_divisors(x):
    for j in range(-10, 10, 1):
        if (j - (j - i)) * (j ** 4 + (j ** 3) * (j - i) + (j ** 2) * ((j - i) ** 2) + j * ((j - i) ** 3) + (j - i) ** 4) == x:
            print(j, j - i) 
            exit()

Submission status: Wrong Answer

Solution code:
X = int(input())
k = list(range(0,70))
k5 = []
for i in k:
    k5.append(i**5)
for j in k5:
    if X + j in k5:
        print(k[k5.index(X+j)],k[k5.index(j)])
        exit()
    elif X - j in k5:
        print(k[k5.index(X-j)],-k[k5.index(j)])
        exit()

Submission status: Wrong Answer

Solution code:
X = int(input())
A=[]

for i in range(-80, 80):
    A.append(i**5)
t=False

for i in range(len(A)):
    for j in range(len(A)):
        if A[i]-A[j]==X:
            print(i-80,j-80)
            t=True
            break
    if t:
        break

Submission status: Wrong Answer

Solution code:
x=int(input())
n=int(x**(1/5))
a=0
b=0
for i in range(n+1):
    for j in range(n+1):
        if i**5 + j**5 == x:
            a=i
            b=j
            print(i,-1*j)
            exit(0)

Submission status: Wrong Answer

Solution code:
x = int(input())
for a in range(-120,121):
  for b in range(-120, 121):
    if a**5 - b**5 == x:
      print(a, b)
      break
      break

Submission status: Wrong Answer

Solution code:
x=int(input())
i=0
while True:
    b=(i**5-x)
    if(b<0):
        b*=-1
        b=b**(1/5)
        b*=-1
    else:
        b=b**(1/5)
    if(b==int(b)):
        print(i,int(b))
        break
    
    i+=1

Submission status: Wrong Answer

Solution code:
import math

X = int(input())

max = 64

a = []
b = []
bm = []
for i in range(max):
    a.append(i ** 5)
    b.append(a[i])
    bm.append(-1 * b[i])

atarget = 0
btarget = 0
for i in range(max):
    for j in range(max):
        if (a[i] == X + b[j]):
            btarget = j
            atarget = i
        if (a[i] == X + bm[j]):
            btarget = j * -1
            atarget = i


print(atarget, btarget)

Submission status: Wrong Answer

Solution code:
x = int(input())


for a in range(-1, 20000):
    # ubとlbは余裕を持って大きく（小さく）取っておく
    ub = 1000**5
    lb = -1000**5
    while lb + 1 < ub:
        target = (ub+lb)//2
        if (a**5 - x > target**5):
            lb = target
        else:
            ub = target
    if a**5 - target**5-x == 0:
        print(a, target)

Submission status: Wrong Answer

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

x = ii()
l = [0]
i = 0
num = 0
while num < 10**10:
    i += 1
    num = i**5
    l.append(num)
#print(l[:10])
l = set(l)
for item in l:
    if item > x:
        if item - x in l:
            print(int(item**0.2),int((item-x)**0.2))
            exit()
    else:
        if x - item in l:
            print(int(item**0.2),int((x-item)**0.2)*(-1))
            exit()

'''
    if x - item in l:#Aがitemでx-itemは-B**5
        print(int(item**0.2),int(abs(item-x)**0.2)*(-1))
        exit()
    elif item - x in l:#Aがitemでx-itemはB**5
#        print(item,item-x)
        print(int(item**0.2),int(abs(item-x)**0.2)*(-1))
        exit()
'''

Submission status: Wrong Answer

Solution code:
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint

def myinput():
    return map(int,input().split())

def mylistinput(n):
    return [ list(myinput()) for _ in range(n) ]

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

x = int(input())

for b in range(-10**6,10**6):
    m = x + (b**5)
    if m<0:
        pass
    else:
        a = pow(m,1/5)
        if a.is_integer():
            a = int(a)
            print(a,b)
            exit()

Submission status: Wrong Answer

Solution code:

x = int(input())
for i in range(-10,10):
    for j in range(-10,10):
        if i**5 - j**5 - x == 0:
            print(i,j)

Submission status: Wrong Answer

Solution code:
x = int(raw_input())

for a in range(-63,64):
  for b in range(-63,64):
    if pow(a,5) - pow(b,5) == x:
      print "%d %d" % (a,b)
      exit(0)

Submission status: Wrong Answer

Solution code:
import itertools

x = int(input())

num = []

for i in range(101):
    num.append(i ** 5)

for a5, b5 in itertools.permutations(num, 2):
    if a5 - b5 == x:
        print(num.index(a5), num.index(b5))
        break
    elif a5 + b5 == x:
        print(num.index(a5), num.index(b5) * (-1))
        break

Submission status: Wrong Answer

Solution code:
x=int(input())
al=list(map(lambda x:-x, list(range(1,100))))
ar=list(range(100))
a=al+ar
b=a.copy()

for ai in a:
    for bi in b:
        if ai**5 - bi**5 == x:
            print("{0} {1}".format(ai,bi))
            exit()

Submission status: Wrong Answer

Solution code:
m=int(input())
flag=True
for i in range(100000):
    n=(m+i**5)**0.2
    if n==int(n):
        print(int(n),i)
        break
    if flag:
        n=(m-i**5)**0.2
        if type(n)==complex:
            flag=False
        elif n==int(n):
            print(int(n),-i)
            break

Submission status: Wrong Answer

Solution code:
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

X = int(readline().rstrip())

lim = int(X ** 0.2) + 1

for A in range(0, lim):
    for B in range(0, lim):
        v = (A ** 5) + (B ** 5)
        if v == X:  
            print(A, -B)
            exit()
        v = (A ** 5) - (B ** 5)
        if v == X:  
            print(A, B)
            exit()

Submission status: Wrong Answer

Solution code:
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    X = int(input())
    import math
    for i in range(-100,100,2):
        for j in range(-100,100,1):
            if i == j:
                continue
            if X % (i - j) == 0:
                print(i,j)
                exit()
if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
X = int(input())
if X == 0:
    print(0,0)
    exit()
for i in range(0,10000):
    for j in range(0,10000):
        if i!=j and X % abs(i-j) == 0:
            if i**5 - j**5 ==X:
                print(i,j)
                exit()
            if i**5 + j**5 ==X:
                print(i,-j)
                exit()
            if - i**5 - j**5 ==X:
                print(-i,-j)
                exit()

Submission status: Wrong Answer

Solution code:
X = int(input())
a = 0
b = 0

if X == 1:
  print( 0,-1)
  exit()
PN = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551,2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417,5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429, 8431, 8443,8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973]

for pn in PN:
    if X % pn == 0:
        for i in range(1,pn):
            a = i
            b = i-pn
            if a**5 - b**5 == X:
                print(a,b)
                exit()
            elif b**5 - a**5 == X:
                print(-a,-b)    
                exit()

Submission status: Wrong Answer

Solution code:
x=int(input())
for i in range(64):
    for j in range(64):
        if i**5+j**5==x:
            print(i,-j)
            exit()
        if i**5-j**5==x:
            print(i,j)
            exit()

Submission status: Wrong Answer

Solution code:
import math

x = int(input())
for a in range(1000000000):
    b = ((a**5) - x)**0.2
    if isinstance(b, float) and b.is_integer():
        print(a, int(b))
        break
    b = (x - (a**5))**0.2
    if isinstance(b, float) and b.is_integer():
        print(a * -1, int(b))
        break

Submission status: Wrong Answer

Solution code:
X=int(input())
ansa=0
ansb=0
for a in range(100):
    b5 = a**5 - X
    sig = False
    if b5 < 0:
        sig = True
        b5 = abs(b5)
    b1 = pow(b5,1/5)
    if b1 == int(b1):
        ansa=a
        ansb=int(b1)
        if sig:
            ansb *= -1
        break
if ansa >0 or ansb>0:
    print(ansa,ansb)
    exit()

for b in range(-50000,50000):
    b5 = b**5
    a5 = b5+X
    sig = False
    if a5 < 0:
        sig = True
        a5 = abs(a5)
    a1 = pow(a5,1/5)
    if a1 == int(a1):
        ansa=a
        ansb=int(b1)
        if sig:
            ansb *= -1
        break
print(ansa,ansb)

Submission status: Wrong Answer

Solution code:
from collections import defaultdict

import sys
sys.setrecursionlimit(10**6)
ii = lambda: int(input())
mis = lambda: map(int,input().split())
lmis = lambda: list(mis())
INF = float('inf')

def main():
    x=ii()
    for i in range(100):
        for j in range(-100,100):
            if i**5-j**5==x:
                print(i,-j)
                exit()


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math
x = int(input())
i = 1
print(i)
while True:
  t = math.pow(i, 5)-x
  if t >= 0:
    b = math.pow(t, 1/5)
    if b.is_integer():
      print(str(i) + ' ' + str(int(b)))
      break
  else:
    b = math.pow(-t, 1/5)
    if b.is_integer():
      print(str(i) + ' ' + str(int(-b)))
      break
  i += 1

Submission status: Wrong Answer

Solution code:
import sys
import os
import math
import bisect
import collections
import itertools

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def f(a, b):
    return pow(a, 5) - pow(b, 5)


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    X = ii()
    for a in range(101):
        for b in range(101):
            if X == f(a, -b):
                print(a, -b)
                exit()
            if X == f(a, b):
                print(a, b)
                exit()


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())
l = [x*x*x*x*x for x in range(0, 121)]
for i in range(121):
	for j in range(i+1, 121):
		if l[j] == l[i] + x:
			print(i, end=" ")
			print(j)
			break
		if l[i] + l[j] == x:
			print(j, end=" ")
			print(-i)
			break

Submission status: Wrong Answer

Solution code:
X = int(input())
flag = 0
A = 0
B = 0
for a in range(20):
    for b in range(20):
        if (a-10)**5 - (b-10)**5 == X:
            flag = 1
            A = a-10
            B = b-10
            break
        else:
            pass
    if flag == 1:
        break

print(A,B)

Submission status: Wrong Answer

Solution code:
import sys
input=sys.stdin.readline
X = int(input().rstrip('\n'))
a = 0
check = 0
while X>a**5:
  b1 = X-a**5
  b = b1**0.2
  if b.is_integer():
    print(a,int(b)*(-1))
    check += 1
    break
  else:
    a +=1
while check < 1:
  b1 = a**5-X
  b = b1**0.2
  if b.is_integer():
    print(a,int(b))
    break
  else:
    a +=1

Submission status: Wrong Answer

Solution code:
import collections
X = int(input())

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

c = collections.Counter(prime_factorize(X))
cl = list(c.keys())
cl.append(1)
for insu in cl:
    for i in range(-100000, 100000):
        if i**5 - (i-insu)**5 == X:
            print(i, (i-insu))
            break

Submission status: Wrong Answer

Solution code:
import math

x = int(input())
template = lambda a, b: "{} {}".format(a, -b) if x >= 0 else "{} {}".format(-a, b)
abs_x = abs(x)
max_a = math.floor(math.pow(abs_x, 1 / 5))
for a in range(max_a + 1):
    for b in range(a + 1):
        if a ** 5 + b ** 5 == abs_x:
            break
print(template(a, b))

Submission status: Wrong Answer

Solution code:
import sys
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    return divisors
x=int(input())
li=make_divisors(x)
li.pop(0)
if x!=1:
     for i in li:
        for A in range(-2*x,x):
            for B in range(-2*x,x):
                if A**4+(A**3)*B+(A**2)*(B**2)+A*(B**3)+B**4==i:
                    print(A,B)
                    sys.exit()
else:
    print(0,-1)

Submission status: Wrong Answer

Solution code:
x = int(input())

lower_limit, upper_limit = -10**2, 10**2

for a in range(lower_limit, upper_limit):
    for b in range(lower_limit, upper_limit):
        d = a ** 5 - x
        if d == b ** 5:
            print("{} {}".format(a, b))
            exit(0)

Submission status: Wrong Answer

Solution code:
X = int(input())

for i in range(-101, 101):
  for j in range(-101, 101):
    if i **5 - j**5 ==X:
      print(str(i)+' ' +str(j))
      exit()

Submission status: Wrong Answer

Solution code:
x=int(input())
D=[1]
for i in range(2,int(x**0.5)+1):
    if x%i==0:
        D.append(i)
for d in D:
    for i in range(-100,100):
        if i**5-(i-d)**5==x:
            print(i,i-d)
            exit()

Submission status: Wrong Answer

Solution code:
import numpy as np
 
x = int(input())
power = ""
 
for a in range(-250, 250):
    for b in range(-250, 250):
        if np.power(a, 5)^-np.power(b, 5) == x:
            power = f"{a} {b}"
            break
    if not power == "":
        break
 
print(power)

Submission status: Wrong Answer

Solution code:

X = int(input())
lis = []
for i in range(-200, 201):
    lis.append(i**5)
flag = 0
for a, i in enumerate(lis):
    for b, j in enumerate(lis):
        if (i + j == X) or (j - i == X):
            flag = 1
            break
    if flag == 1:
        break
    
print(a-200, b-200)

Submission status: Wrong Answer

Solution code:
x = int(input())
a = 10
f = False
for i in range(-100, 101):
  for j in range(-100,101):
    if pow(i, 5) - pow(j,5) == x:
      print(i, j)
      f = True
      break
  if f:
    break

Submission status: Wrong Answer

Solution code:
X = int(input())
A=[]

for i in range(-65, 66):
    A.append(i**5)
t=False

for i in range(len(A)):
    for j in range(len(A)):
        if A[i]-A[j]==X:
            print(i-65,j-65)
            t=True
            break
    if t:
        break

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

import math

def main():
     x = int(input())
     # x は 正の整数
     # ans = a^5 - b^5 = x となる a, b

     b = 0
     while(True):
          b_x = pow(b, 5)
          a_x = x + b_x
          a = pow(a_x, 1 / 5)

          print('a:{}, b:{}'.format(a, b))

          if type(a) == float:
               if a.is_integer():
                    print(int(a), b)
                    break

          if b <= 0:
               b -= 1
               b = b * (-1)
          else:
               b = b * (-1)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
print("Hi")

Submission status: Wrong Answer

Solution code:
x=int(input())

for a in range(101):
  for b in range(-100,101):
    if a**5-b**5==x:
      print(a,b)
      exit()

Submission status: Wrong Answer

Solution code:
import sys

x = int(input())
def make_divisors(n):
  divisors = []
  for i in range(1, int(n ** 0.5) + 1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i:
        divisors.append(n // i)

  # divisors.sort()
  return divisors

for i in range(len(make_divisors(x))):
        for j in range(100):
            if j ** 5 - (j-make_divisors(x)[i]) ** 5 == x:
                print(j,j-make_divisors(x)[i])
                sys.exit()

Submission status: Wrong Answer

Solution code:
x = int(input())
for a in range(-120,121):
  for b in range(-120, 121):
    if a**5 - b**5 == x:
      print(a, b)
      break

Submission status: Wrong Answer

Solution code:
import math

x = int(input())
for a in range(1000000000):
    b = ((a**5) - x)**0.2
    if isinstance(b, float) and b.is_integer():
        print(a, int(b))
        break
    b = (x - (a**5))**0.2
    if isinstance(b, float) and b.is_integer():
        print(a, int(b) * -1)
        break

Submission status: Wrong Answer

Solution code:
x = int(input())
A =int(x**(1/5))
new = int(A-x)
if new<0:
    B = -(new**(1/5))


else:
    B = (new**(1/5))

print(A,B)

Submission status: Wrong Answer

Solution code:
x = int(input())

t = int(x**0.2)

for i in range(int(x**0.2)+1):
    for j in range(-int(x**0.2)-1,int(x**0.2)+1):
        d = i**5-j**5
        if(x == d):
            print(i,j)
            exit()

Submission status: Wrong Answer

Solution code:
from math import floor
from math import ceil
X = int(input())

X_5 = X ** (1/5)

for i in range(-int(ceil(X_5)), int(ceil(X_5)) + 1):
    if floor(X_5) ** 5 - i ** 5 == X:
        print(floor(X_5), i)
        exit()

    if ceil(X_5) ** 5 - i ** 5 == X:
        print(ceil(X_5), i)
        exit()

Submission status: Wrong Answer

Solution code:
d = {}
for i in range(-63,63):
	temp = i**5
	if temp not in d:
		d[temp] = i

posd = {}
for i in range(0,63):
	temp = i**5
	if temp not in posd:
		posd[temp] = i

x = int(input())
for i in posd:
	if i-x in d:
		print(posd[i],d[i-x])
		break

Submission status: Wrong Answer

Solution code:
# (x - y) (x^4 + x^3 y + x^2 y^2 + x y^3 + y^4)
import math


def check(x, y):
    # a - b == x
    # a = x
    # b = 0
    # (x ^ 4 + x ^ 3 y + x ^ 2 y ^ 2 + x y ^ 3 + y ^ 4) == y
    for i in range(x):
        a = x - i
        b = i
        if a ** 4 + a ** 3 * b + a ** 2 * b ** 2 + a * b ** 3 + b ** 4 == y:
            print(a, b)
            exit()


X = int(input())

# for i in range(1, math.ceil(X ** 0.5)):
#     if X % i == 0:
#         # i * X//i
#         check(i, X // i)

for b in range(-math.ceil(X ** 0.2) - 3, math.ceil(X ** 0.2) + 3):
    if b ** 5 + X < 0:
        continue
    a = (b ** 5 + X) ** 0.2
    if a == int(a):
        print(int(a), b)
        exit()

Submission status: Wrong Answer

Solution code:
x = int(input())


for a in range(-1, 20000):
    # ubとlbは余裕を持って大きく（小さく）取っておく
    ub = 1000**5
    lb = -1000**5
    while lb + 1 < ub:
        target = (ub+lb)//2
        if (a**5 - target**5 >= x):
            lb = target
        else:
            ub = target
    if a**5 - target**5-x == 0:
        print(a, target)

Submission status: Wrong Answer

Solution code:
X = int(input())

A = 0
B = 0
while True:
    a = A**5
    temp = a - X
    temp = abs(temp)
    B = temp**(1/5)
    if type(B) != complex:
        if B.is_integer():
            B = int(B)
            break
    A += 1

if A**5 - B**5 == X:
    print(A, B)
else:
    print(A, -B)

Submission status: Wrong Answer

Solution code:
x=int(input())
for i in range(0,64):
	if int(i**5)==x-1:
		print(i,'-1')
		exit()