Project Euler Problem 81
2009-10-23 21:54
375 查看
很显然是一个动态规划的题目,也可以建模为一个有向图,然后用Dijkstra算法寻找最短路径。
具体的实现(C++)可以从右下依次向上做遍历,看到很多人用了递归,纵然不用考虑下标的转换,但效率很低,写的不好让人很不爽。。
Answer:427337
具体的实现(C++)可以从右下依次向上做遍历,看到很多人用了递归,纵然不用考虑下标的转换,但效率很低,写的不好让人很不爽。。
Answer:427337
相关文章推荐
- Project Euler Problem 81-90
- Project Euler Problem 30
- Project Euler Problem 12
- Project Euler Problem 19
- Project Euler Problem 25
- project euler Problem 39
- Project Euler -> problem 5
- Project Euler Problem 5: Smallest multiple
- Project Euler Problem 14 Longest Collatz sequence
- Project Euler Problem 15 Lattice paths
- Project Euler Problem 99 Largest exponential
- Project Euler Problem 23 Non-abundant sums
- project euler problem 10:Summation of primes
- Project Euler Problem 27 Quadratic primes
- Project Euler Problem 26 Reciprocal cycles
- Project Euler problem 26
- projecteuler problem 12
- Project Euler problem 5
- Project Euler problem 15
- Project Euler problem 21