olymmath

OMCC 2022 Problem 1

  • Day 1

There is a pile with 2022 rocks. Ana y Beto play by turns to the following game, starting with Ana: in each turn, if there are nn rocks in the pile, the player can remove S(n)S(n) rocks or n−S(n)n-S(n) rocks, where S(n)S(n) is the sum of the the digits of nn . The person who removes the last rock wins. Determine which of the two players has a winning strategy and describe it.

Dataset text AI-MO AoPS. Quoted with source.

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

Similar problems

These problems have the most words in common with this statement.

Locator centro/2022/p1 · Tag JSM9HTJYAW · Edit this page on GitHub · Keys: j next, k previous