project euler Problem 18 & 36
来源:互联网 发布:淘宝抢购脚本 编辑:程序博客网 时间:2024/05/01 23:15
import timetStart = 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 += 1print str(values[len(values)-1][0])print "Run Time = " + str(time.time() - tStart)
- project euler Problem 18 & 36
- Project Euler Problem 36
- Project Euler problem 36
- project euler Problem 36
- Project Euler - Problem 18
- Project Euler problem 18
- Project Euler – Problem 18
- Project Euler:Problem 36 Double-base palindromes
- project euler problem 18 动态规划
- Euler Project Problem 6
- project euler problem 11
- Project Euler Problem 81
- Project Euler Problem 60
- Project Euler Problem 59
- Project Euler Problem 58
- Project Euler Problem 57
- Project Euler Problem 16
- Project Euler Problem 30
- Android Fragments的使用
- rpm.bin 与 .bin文件的区别
- C#调用CMD对话框并执行命令
- Android里的媒体库
- 说说Android桌面(Launcher应用)背后的故事(一)——揭开她神秘的面纱
- project euler Problem 18 & 36
- opengl 无法处理的异常
- Android教程之MediaStore
- 说说Android桌面(Launcher应用)背后的故事(二)——应用程序的添加
- linux七天系列之二
- 位(bit)、字节(Byte)、字(word)之间的关系
- 说说Android桌面(Launcher应用)背后的故事(三)——CellLayout的秘密
- 敏捷实践:如何让团队迭代交付周期缩短一半
- PHP sOAP 实例