Description: Have m´ n (m & lt; = 100, n & lt; (= 100) a gold coin is arranged in an m row of n-column gold COINS on the table. Each gold
Coin or face up or back. I'm going to use the Numbers to represent the gold coin, so 0 means the coin heads up, and 1 means the back side.
The rules of the coin array game are:
(1) each of the COINS can be turned over and placed in the original position;
(2) the position of the two gold COINS can be exchanged each time.
Programming tasks:
Given the initial state and target state of the array of gold COINS, the programming calculation is to calculate the gold coin array from the initial shape by the rule of gold coin
The minimum number of transformations required to change the state to the target state.
To Search:
File list (Check if you may need any files):
Download