Pete puts 100 stones in a row: black one, white one, black one, white one, ..., black one, white one. In a single move either Pete chooses two black stones with only white stones between them, and repaints all these white stones in black, or Pete chooses two white stones with only black stones between them, and repaints all these black stones in white. Can Pete with a sequence of moves described above obtain a row of 50 black stones followed by 50 white stones? Egor Bakaev
Problem
Source: 46th International Tournament of Towns, Junior O-Level P2,(and also Senior O-Level P1), Fall 2024
Tags: combinatorics