var x = 0; var y = 0; window.onload = function() { var width = (window.innerWidth > 0) ? window.innerWidth : screen.width; document.body.width = width; myFunction("max"); }; // a custom random function. function rnd(num) { return Math.floor(Math.random()*(num + 1)); } // count backwards up the pyramid function backward_arr(arr, mm) { var x = 0; var y = 0; for (x = arr.length - 2; x >= 0; x--) { for (y = 0; y < arr[x].length; y++) { if (mm=="max") { arr[x][y]+= Math.max(arr[x + 1][y], arr[x + 1][y + 1]); } else { arr[x][y]+= Math.min(arr[x + 1][y], arr[x + 1][y + 1]); } } } } // count forward down the pyramid function forward_arr(arr, mm) { arr[1][0]+= arr[0][0]; arr[1][1]+= arr[0][0]; for (x = 2; x < arr.length; x++) { for (y = 1; y < arr[x].length - 1; y++) { if (y==1) { arr[x][y - 1]+= arr[x - 1][y - 1]; } if (y==arr[x].length - 2) { arr[x][y + 1]+= arr[x - 1][y]; } if (mm=="max") { arr[x][y]+= Math.max(arr[x - 1][y - 1], arr[x - 1][y]); } else { arr[x][y]+= Math.min(arr[x - 1][y - 1], arr[x - 1][y]); } } } } // path of the pyramid down with main value at top function patharrdown(arr, mm){ var k = 1; var j = 1; var parr = new Array(arr.length); parr[0] = 0; for (x = 1; x < arr.length; x++) { for (y = (k - 1); y < k; y++) { if (mm=="max") { j+= (arr[x][y] > arr[x][y + 1]) ? 0:1; } else { j+= (arr[x][y] < arr[x][y + 1]) ? 0:1; } } parr[x] = (j - 1); k = j; } return parr; } // path of the pyramid up with main value and bottom function patharrup(arr, mm){ var j = 0; var num = 0; var numm = 0; var parr = new Array(arr.length); parr[0] = 0; numm = arr[arr.length - 1][0]; for (y = 0; y < arr[arr.length - 1].length - 1; y++) { if (mm=="max") { num = Math.max(arr[arr.length - 1][y], arr[arr.length - 1][y + 1]); if (num > numm) { numm = num; j = (arr[arr.length - 1][y] > arr[arr.length - 1][y + 1]) ? y:(y + 1); } } else { num = Math.min(arr[arr.length - 1][y], arr[arr.length - 1][y + 1]); if (num < numm) { numm = num; j = (arr[arr.length - 1][y] < arr[arr.length - 1][y + 1]) ? y:(y + 1); } } } parr[arr.length - 1] = j; for (x = arr.length - 2; x > 0; x--) { if (j!==0) { if (mm=="max") { j = (arr[x][j] > arr[x][j - 1]) ? j: j - 1; } else { j = (arr[x][j] < arr[x][j - 1]) ? j: j - 1; } } parr[x] = j; } return parr; } function myFunction(maxmin) { var optxt = ""; var sel = document.getElementById("gsize"); var gsize = Number(sel.options[sel.selectedIndex].text); var moveup = document.getElementById("moveup"); var movedown = document.getElementById("movedown"); var num = 0; var num1 = ""; var num2 = ""; var num3 = ""; var txt1 = ""; var txt2 = ""; var txt3 = ""; var txt4 = ""; moveup.style.fontSize = (document.body.width / 2.5) / (gsize * 2) + "pt"; movedown.style.fontSize = (document.body.width / 2.5) / (gsize * 2) + "pt"; moveup.innerHTML = "Move Up
Original Pyramid"; movedown.innerHTML = "Move Down
Origianal Pyramid"; maxmin = (document.getElementById("max").checked===true) ? "max":"min"; // create 3 arrays with same values maxmin = (maxmin=="?") ? old:maxmin; if (gsize < 5) { gsize = 5; } else if (gsize > 12) { gsize = 12; } var arr1 = new Array(gsize); var arr2 = new Array(gsize); var arr3 = new Array(gsize); for(x = 0; x < arr1.length; x++){ arr1[x] = new Array(x + 1); arr2[x] = new Array(x + 1); arr3[x] = new Array(x + 1); for(y = 0; y < arr1[x].length; y++){ num = rnd(9); arr1[x][y] = num; arr2[x][y] = num; arr3[x][y] = num; } } // run functions for max or min value and for path forward_arr(arr3, maxmin); backward_arr(arr2, maxmin); var parr1 = patharrdown(arr2, maxmin); var parr2 = patharrup(arr3, maxmin); // Print arrays on screen with path colored for (x = 0; x < arr1.length; x++) { for (y = 0; y < arr1[x].length; y++) { num1 = ((arr1[x][y] < 10) ? "0":"") + arr1[x][y]; num2 = ((arr2[x][y] < 10) ? "0":"") + arr2[x][y]; num3 = ((arr3[x][y] < 10) ? "0":"") + arr3[x][y]; if (y==parr2[x]){ txt1 += "" + num1 + ""; txt2 += "" + num2 + ""; } else { txt1 += "" + num1 + ""; txt2 += "" + num2 + ""; } if (y==parr1[x]){ txt3 += "" + num1 + ""; txt4 += "" + num3 + ""; } else { txt3 += "" + num1 + ""; txt4 += "" + num3 + ""; } txt1 += "" + ((y < arr1[x].length - 1) ? ",":"") + ""; txt2 += "" + ((y < arr1[x].length - 1) ? ",":"") + ""; txt3 += "" + ((y < arr1[x].length - 1) ? ",":"") + ""; txt4 += "" + ((y < arr1[x].length - 1) ? ",":"") + ""; } txt1 += "
"; txt2 += "
"; txt3 += "
"; txt4 += "
"; } optxt = (maxmin=="max") ? "Max":"Min"; moveup.innerHTML+= "
" + txt1 + "
" + optxt + " Up
" + txt2 + "
"; movedown.innerHTML+= "
" + txt3 + "
" + optxt + " Down
" + txt4 + "
"; }

Golden Challenge