olymmath

RIOPLATENSE 2016 Problem 1

    Ana and Beto play against each other. Initially, Ana chooses a non-negative integer NN and announces it to Beto. Next Beto writes a succession of 20162016 numbers, 10081008 of them equal to 11 and 10081008 of them equal to −1-1 . Once this is done, Ana must split the succession into several blocks of consecutive terms (each term belonging to exactly one block), and calculate the sum of the numbers of each block. Finally, add the squares of the calculated numbers. If this sum is equal to NN , Ana wins. If not, Beto wins. Determine all values of NN for which Ana can ensure victory, no matter how Beto plays.

    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 rioplatense/2016/p1 · Tag W4RQVAC9PC · Edit this page on GitHub · Keys: j next, k previous