project euler Problem 18 & 36
2014-06-13 00:00
267 查看
import time tStart = time.time() f = open("triangle.txt", "r").readlines() values = [] for line in f: temp = [] for token in line.replace("\n", "").split(' '): temp.append(token) values.append(temp) values.reverse() for i in range(0, len(values) - 1): j = 0 for k in values[i+1]: values[i+1][j] = max([int(k) + int(values[i][j]), int(k) + int(values[i][j+1])]) j += 1 print str(values[len(values)-1][0]) print "Run Time = " + str(time.time() - tStart)
相关文章推荐
- project euler Problem 18 & 36
- Maximum path sum I [Project Euler.Problem 18]
- Project Euler Problem 18 Maximum path sum I
- http://projecteuler.net/problem=18 [Answer:1074]
- Project Euler Problem 36
- http://projecteuler.net/problem=36 [Answer:872187]
- Project Euler problem 36
- Project Euler problem 18
- project euler Problem 36
- Project Euler Problem 36 Double-base palindromes
- project euler Problem 36
- project euler problem 18 动态规划
- http://projecteuler.net/problem=15 [Answer:137846528820]
- Project Euler Problem 3: Largest prime factor
- Project Euler Problem 48: Self powers
- Project Euler Problem 13 Large sum
- Project Euler Problem 58
- projecteuler Problem 29
- Project Euler -> problem 9
- Project Euler Problem 40