A game is played with three piles of stones and two players. At her turn, a player removes one or more stones from the piles. However, if she takes stones from more than one pile, she must remove the same number of stones from each of the selected piles.
In other words, the player chooses some N>0 and removes:
• N stones from any single pile; or • N stones from each of any two piles (2N total); or • N stones from each of the three piles (3N total).
Find Σ(xi+yi+zi) where (xi,yi,zi) ranges over the losing configurations with xi ≤ yi ≤ zi ≤ 1000.
The answer to the question is available in the PDF file https://www.assignmentexpert.com/https://www.assignmentexpert.com/homework-answers/programming-answer-62642.pdf
Comments
Dear Sai Krishna, please send us the task with all requirements and our experts will surely assist you.
Can I get the explanation for the above program?
Leave a comment