Witam, nie rozumiem tego zadania, czy mogłabym prosić o przetłumaczenie? Będę ogromnie wdzięczna :)
George Soros arranges n2 gold coins in an n × n grid, each with their "heads" side up. He invites you to play a game: in each move, you pick one of the n rows or columns and flip over all of the gold pieces in that row or column. You are not allowed to rearrange the coins in any other way. If you can reach a configuration where there is exactly one gold coin with its "tails" side up, Soros will award you all n2 gold coins as your prize. He allows you an unlimited number of moves. For which values of n is it possible to win the game? Prove your answer.