tuymaada 2016/junior P1
Source:
July 22, 2016
combinatoricsCombinatorial games
Problem Statement
Tanya and Serezha have a heap of candies. They make moves in turn, Tanya moves first. At each move a player can eat either one candy or (if the number of candies is even at the moment) exactly half of all candies. The player that cannot move loses. Which of the players has a winning strategy?