function MPS(pyramid){ /** runs from bottom to top for each row, take the max value between two adjacent columns, and add it to the column above (only to the column of the value with the lower index to preserve the path legality) each row converges to a sum of the best paths below it until pyramid[0][0] is the best possible solution (best path of all) */ for(var i=pyramid.length-1;i>0;i--){ for(var j=0;j

") draw_pyramid(pyramid) document.write("

") return pyramid[0][0]; } function build_row(nums){ return nums.shift().split(' ').map(Number) } function prepare(data){ var pyramid=[]; var nums=data.split('\n'); while(nums.length > 1){ pyramid.push(build_row(nums)); } return pyramid; } function run(data){ var pyramid=prepare(data); // solution 7273 draw_pyramid(pyramid); var res=MPS(pyramid); console.log(res); document.write("
"+res+"
"); } function pad_row(row){ return row.map(function(num){ return num<10? "0"+num:num; }); } function draw_pyramid(pyramid){ var pyr_string=""; for(var i=0;i'; } document.write(pyr_string); } console.log(MPS([ [75], [95, 64], [17, 47, 82], ])); console.log(MPS([ [75], [95, 64], [17, 47, 82], [18, 35, 87, 10], [20, 4, 82, 47, 65], [19, 1, 23, 75, 3, 34], [88, 2, 77, 73, 7, 63, 67], [99, 65, 4, 28, 6, 16, 70, 92], [41, 41, 26, 56, 83, 40, 80, 70, 33], [41, 48, 72, 33, 47, 32, 37, 16, 94, 29], [53, 71, 44, 65, 25, 43, 91, 52, 97, 51, 14], [70, 11, 33, 28, 77, 73, 17, 78, 39, 68, 17, 57], [91, 71, 52, 38, 17, 14, 91, 43, 58, 50, 27, 29, 48], [63, 66, 4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31], [4, 62, 98, 27, 23, 9, 70, 98, 73, 93, 38, 53, 60, 4, 23] ])); window.onload=function(){ var cors_anywhere="https://cors-anywhere.herokuapp.com/"; var url="https://projecteuler.net/project/resources/p067_triangle.txt"; axios.get(cors_anywhere+url).then(function(res){ run(res.data); }); }