recursion

count = 0
def hanoi(n, x, y, z):                         #圆盘数量, 起始柱子,中间柱子,目标柱子,
global count
if n == 1:
print("{}:{}->{}".format(1, x, z))
count += 1
else:
hanoi(n-1, x,z,y)                      #把(n-1)个圆盘从x移到y上，需借助z: x->z->y
print("{}:{}->{}".format(n,x,z))       #把最下面的n直接从x->z
count += 1
hanoi(n-1,y,x,z)                       #(n-1)个圆盘从y移到z上，需借助x：y->x->z
num = eval(input("请输入汉诺塔问题的圆盘数目："))
hanoi(num, 'A', 'B', 'C')
print("搬运次数：",count)