26 li1.append(li1[j-1]+res)
27 j+=1
28 i=0
29 30 while i<len(li1):
31 ans = min(ans,li1[i]+li2[len(li2)-1]-li2[i])
32 i+=1
9 dp[i][j] = 1 + min(dp[i+1] [j], dp[i][j+1], dp[i+1][j+1]) if dp[i][j] == 1 else 0
10 ans = max(ans, dp[i][j])
11 return ans
12 13n = int(input())
14grid = [[0] * n for _ in range(n)]
15for r in range(n):
10 return 1
11 else:
12 return 0
13 14def check():
15 for i in range(1000,900,-1):
16 for j in range(i,900,-1):
24 break
25 else:
26 n = int(input())
27 28print("MUITO OBRIGADO")
29print("Alcool:", end = ' ')
30print(a)
7 return a*b*c
8
9print(calculate())
10
Blank lines should not contain any tabs or spaces.