Python-Project Euler 67

def max(a,b):

    if a>b:

        return a

    else:

        return b

    

    

a=[[0 for i in range(110)] for j in range(110)]

dp=[[0 for i in range(110)] for j in range(110)]

file=open('e:\\triangle.txt')

s=file.read()

f=s.split('\n')

for i in range(len(f)):

    a[i]=f[i].split(' ')

for i in range(0,len(f)-1):

    for j in range(0,i+1):

        a[i][j]=int(a[i][j])

for i in range(0,len(f)-1):

    dp[len(f)-2][i]=a[len(f)-2][i]

for i in range(len(f)-3,-1,-1):

    for j in range(0,i+1):

        dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+a[i][j]

print(dp[0][0])