def f(n):
if n==1 or n==2:
return 1
else:
a=D[n-1]+D[n-2]
D[n]=a
return a
n=1
D={1:1,2:1}
while len(str(f(n)))<1000:
n=n+1
print f(n)
if n==1 or n==2:
return 1
else:
a=D[n-1]+D[n-2]
D[n]=a
return a
n=1
D={1:1,2:1}
while len(str(f(n)))<1000:
n=n+1
print f(n)
print n
=================
fibo = [1,1]
while len(str(fibo[-1]))<1000:
fibo.append(fibo[-1]+fibo[-2])
print len(fibo)
======================
认真思考一下自己为什么总是写出那种没有效率的愚蠢的代码啊啊啊啊啊