/* Challenge: 'The Golden Mountain' At one international Olympiad in Informatics, the following task was given. Let's solve it! 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 The figure shows an example of a triangle of numbers. Write a program that calculates the largest sum of numbers through which the path starts, starting at the top and ending somewhere on the bottom. Each step can go diagonally down to the right or diagonally to the left. In the example - this is the path 7➡3➡8➡7➡5, given a max amount of 30. */ let randInt = (d) => Math.floor(Math.random()*d); let max = 0, maxObj = undefined; let numArray = [[randInt(10)], [randInt(10), randInt(10)], [randInt(10), randInt(10), randInt(10)], [randInt(10), randInt(10), randInt(10), randInt(10)], [randInt(10), randInt(10), randInt(10), randInt(10), randInt(10)]]; function NumSet(a, b, c, d, e) { this.a = a; this.b = b; this.c = c; this.d = d; this.e = e; //this.total = 0; this.sum = () => this.a + this.b + this.c + this.d + this.e; //return this.total } let sumSet = []; for(let i = 0; i < 1; i++) { for(let j = i; j <= i+1; j++) { for(let k = j; k <= j+1; k++) { for(let l = k; l <= k+1; l++) { for(let m = l; m <= l+1; m++) { let y = new NumSet(numArray[0][i], numArray[1][j], numArray[2][k], numArray[3][l], numArray[4][m]); if(y.sum() > max) { sumSet.push(y.sum()); max = y.sum(); maxObj = y; } } } } } } document.write("

");
document.write(`     
     ${numArray[0]}
    ${numArray[1]}
   ${numArray[2]}
  ${numArray[3]}
 ${numArray[4]}`);
document.write("

"); document.write("

Maximum Sum: ", Math.max.apply(Math, sumSet), "<\h3>

Path: "); document.write(`${maxObj.a} → ${maxObj.b} → ${maxObj.c} → ${maxObj.d} → ${maxObj.e}`); document.write("<\h4>");

Golden Mountain @rudolph flash