olymmath

BALTIC-WAY 2003 Problem 8

  • Answer

There are 2003 pieces of candy on a table. Two players alternately make moves. A move consists of eating one candy or half of the candies on the table (the "lesser half" if there is an odd number of candies); at least one candy must be eaten at each move. The loser is the one who eats the last candy. Which player - the first or the second - has a winning strategy?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

The second

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator baltic-way/2003/p8 · Tag 8NYP6FTDCK · Edit this page on GitHub · Keys: j next, k previous