백준 알고리즘/수학
백준 1003번 파이썬
paysmile
2018. 9. 24. 22:14
def fibonacci(n):
count_0=[1,0,1]
count_1=[0,1,1]
if n==0 or n==1:
print(count_0[n],count_1[n])
else:
for i in range(3,n+1):
count_0.append(count_0[i-1]+count_0[i-2])
count_1.append(count_1[i-1]+count_1[i-2])
print(count_0[n],count_1[n])
for i in range(int(input())):
fibonacci(int(input()))