Problem 42938. Project Euler: Problem 18, Maximum path sum I

Created by Riam Su

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>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.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[       3*\n     7*  4\n   2   4*  6\n 8   5   9*  3]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>3 + 7 + 4 + 9 = 23</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Find the maximum total from top to bottom of a given triangle.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

194 Solutions
80 Solvers

Last Solution submitted on Mar 22, 2023

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Dyuman Joshi on 21 Mar 2022

I am having trouble understanding the concept, for e.g - tril(magic(10)), what I understand is 92+98+81+87+93+76+89+97+78+84=875, which is incorrect acc to the test suite

Solution Comments

Solution 946894

1 Comment

1 Comment

Peng Liu on 31 Aug 2016

This solution together with the solution of James' (or mine) exhibits a nice duality between the "top-down" and "bottom-up" approaches.

Solution 946821

2 Comments

2 Comments

Jan Orwat on 30 Aug 2016

Nice! When you go from the bottom, solution automatically goes to a(1).

James on 31 Aug 2016

Thanks. I coded that solution up LONG before movmax became a thing...

Problem Recent Solvers80

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 42938. Project Euler: Problem 18, Maximum path sum I

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers80

Suggested Problems

More from this Author2

Problem Tags

Community Treasure Hunt

Problem 42938. Project Euler: Problem 18, Maximum path sum I

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers80

Suggested Problems

More from this Author2

Problem Tags

Community Treasure Hunt

Players