http://noi.openjudge.cn/ch0203/1760/
"""
2.3 基本算法之递归变递推 1188 菲波那契数列(2)--3分
http://ybt.ssoier.cn:8088/problem_show.php?pid=1188
1760:菲波那契数列(2)
http://noi.openjudge.cn/ch0203/1760/
"""
def fib_loop_for(n):
a, b = 0, 1
for _ in range(n):
a, b = b, a + b
return a%1000
def fib_loop_while(n):
a, b = 1, 1
while n > 0:
a, b = b, a + b
n -= 1
return a%1000
n=int(input())
for i in range(n):
x=int(input())
print(fib_loop_for(x))
"""
2.3 基本算法之递归变递推 1188 菲波那契数列(2)--AC
http://ybt.ssoier.cn:8088/problem_show.php?pid=1188
1760:菲波那契数列(2)
http://noi.openjudge.cn/ch0203/1760/
Python:列表中,增加元素、删除元素、切片、其它
https://www.cnblogs.com/volcao/p/8630378.html
斐波那契数列的5种python实现写法
https://www.cnblogs.com/panlq/p/9307203.html
"""
a=[]
a.append(1)
a.append(1)
#print(a[0])
#print(a[1])
i=2
while i<=1000000:
a.append(0)
i+=1
i=2
while i<=1000000:
a.append(0)
a[i]=(a[i-1]+a[i-2])%1000
i+=1
n=int(input())
k=0
while k<n:
x=int(input())
print(a[x-1])
k+=1
参考:
Python:列表中,增加元素、删除元素、切片、其它
https://www.cnblogs.com/volcao/p/8630378.html
斐波那契数列的5种python实现写法
https://www.cnblogs.com/panlq/p/9307203.html