We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Recursion
  4. Stone Division, Revisited
  5. Discussions

Stone Division, Revisited

  • shantanup6172
     + 0 comments

    Answer in JavaScript:

    function stoneDivision(n, s) {
const m = {};

function stoneD(pile) {
    if(pile in m) return m[pile];
    let max = 0;
    for(let i of s) {
        if(pile % i === 0 && i !== pile) {
            max = Math.max(max, 1 + (pile / i) * stoneD(i));
        }
    }
    m[pile] = max;
    return max;     
}
return stoneD(n);
}