python函数复用和递归&汉诺塔&斐波那契数列&数列取反

#digui

#rvs not res

v='asdfg'
def fact(n):
    if n==0:
        return 1
    else:
        return n*fact(n-1)
def main():
    print(fact(5))
    print(res(v))
def res(v):
    if v == "":
        return v
    else:
        return res(v[1::1])+v[0]
main()
 

斐波那契数列

#fibonacq
def fibo(n):
    if n == 1 or n == 2:
        return 1
    else:
        return fibo(n-1)+fibo(n-2)
def main():
    print(fibo(eval(input())))
main()

 

汉诺塔

#hannouta
count = 0
def hannouta(n,src,dist,mid):
    global count
    if n==1:
        print("{},{}->{}".format(1,src,dist))
        count += 1
    else :
        hannouta(n-1,src,mid,dist)
        print("{},{}->{}".format(n,src,dist))
        count += 1
        hannouta(n-1,mid,dist,src)
def main():
    hannouta(3,'A','B','C')
    print(count)
main()