# Answer to Question #62642 in C for naveena

Question #62642

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.

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.

Expert's answer

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

Assignment Expert23.10.17, 19:06Dear Sai Krishna,

please send us the task with all requirements and our experts will surely assist you.

Sai Krishna23.10.17, 18:12Can I get the explanation for the above program?

## Leave a comment