代码拉取完成,页面将自动刷新
# This method is called exhaustive numeration!
# I am checking every possible value
# that can be root of given x systematically
# Kinda brute forcing
def cubeRoot():
x = int(input("Enter an integer: "))
for ans in range(0, abs(x) + 1):
if ans ** 3 == abs(x):
break
if ans ** 3 != abs(x):
print(x, 'is not a perfect cube!')
else:
if x < 0:
ans = -ans
print('Cube root of ' + str(x) + ' is ' + str(ans))
cubeRoot()
cont = str(input("Would you like to continue: "))
while cont == "yes":
cubeRoot()
cont = str(input("Would you like to continue: "))
if cont == "no":
exit()
else:
print("Enter a correct answer(yes or no)")
cont = str(input("Would you like to continue: "))
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。