백준/다이나믹 프로그래밍

# 1003 피보나치 함수

bright_code 2020. 9. 11. 11:44
728x90
반응형
t = int(input())

n = [] 
for i in range(t):
  n.append(int(input()))


def fibo(n):
  if ( n == 0 ) : 
    return [1, 0]
  if ( n == 1 ) :
    return [0, 1]
  
  zero = [0] * (n+1) 
  one  = [0] * (n+1)

  zero[0] = 1 ; zero[1] = 0
  one[0] = 0 ; one[1] = 1

  for i in range(2,n+1):
    zero[i]=zero[i-1]+zero[i-2]
    one[i]=one[i-1]+one[i-2]

  return [zero[n],one[n]]

for i in n : 
  a = fibo(i)
  for i in a:
    print(i,end=' ')
  print()
728x90
반응형