def solution(n): tmp=[1,1] while n>1: tmp.append((tmp[-2]+tmp[-1])%1000000007) n-=1 return tmp[-1] def solution(n): answer = 0 #pibonicci DP tmp=[1,1] while n>1: #print(tmp) tmp.append(tmp[-2]+tmp[-1]) n-=1 #print(tmp) answer=tmp[-1]%1000000007 return answer def solution(n): answer = 0 #pibonicci DP tmp=[1,1] for i in range(n): try: print(i,tmp[i]) pass except: tmp.append(tmp[i-2]+tmp[i-1]) answ..
