n = 10 dp = [0] * (n+1) dp[0], dp[1] = 0, 1 for i in range(2,n+1): dp[i] = dp[i-2] + dp[i-1] print(max(dp))
To embed this project on your website, copy the following code and paste it into your website's HTML: