olymmath

RU-ALLRUSSIAN 2017 Problem 103

    There are 3 heaps with 100,101,102100,101,102 stones. Ilya and Kostya play next game. Every step they take one stone from some heap, but not from same, that was on previous step. They make his steps in turn, Ilya make first step. Player loses if can not make step. Who has winning strategy?

    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 ru-allrussian/2017/p103 · Tag SFG3D52R8F · Edit this page on GitHub · Keys: j next, k previous