Excel and PowerPoint development
Microsoft Most Valuable Professional (MVP) award each year since 2000
Julie's Market
Get 2-35% Ca$hback for Your Everyday Online Purchases!
Total Web Solution
Enhance your Web Presence! Get your customized FREE demo.
You are on the Home/Other Tutorials/Project Euler/Problem 67 page
Google
Web This Site
TM Retro Slicer
Use slicers in Excel 2003 and 2007
TM Chart Leader Lines
Easily create leader lines connecting your data labels and their associated data points
TM Tornado
Single factor sensitivity analysis to help evaluate risk and uncertainty

Project Euler - Problem 67

More about Project Euler.

Problem description

By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.

3
7 5
2 4 6
8 5 9 3

That is, 3 + 7 + 4 + 9 = 23.

Find the maximum total from top to bottom in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows.

NOTE: This is a much more difficult version of Problem 18. It is not possible to try every route to solve this problem, as there are 2^(99) altogether! If you could check one trillion (10^(12)) routes every second it would take over twenty billion years to check them all. There is an efficient algorithm to solve it. ;o)

Solution

See Euler 18.