斐波那契数列，递归函数

斐波那契数列

F(1) = 1,F(2) = 1, F(3) = F(1) + F(2)… Fn = F(n-2) + F(n-1)

求斐波那契数列第N项，根据网上查来的公式

按照公式计算，打印出第N项数字

    n = int(input('>>>'))
    a = (1 + 5**0.5)/2
    b = (1 - 5**0.5)/2
    c = (5**0.5)/5
    m = (a**n -b**n)*c
    print(int(m))

简便算法

    n = int(input('>>>'))
    a = 1
    b = 1
    for i in range(n-2):
        a, b = b, a + b
    else: