金币阵列问题

有m * n(m ≤ 100,n ≤ 100)个金币在桌面上排成一个m行n 列的金币阵列。每一枚金币或正面朝上或背面朝上。用数字表示金币状态，0表示金币正面朝上，1 表示背面朝上。金币阵列游戏的规则是：



（1）每次可将任一行金币翻过来放在原来的位置上；

（2）每次可任选2 列，交换这2 列金币的位置。



给定金币阵列的初始状态和目标状态，编程计算按金币游戏规则，将金币阵列从初始状态变换到目标状态所需的最少变换次数。

-Gold array problem m* n (m ≤ 100, n ≤ 100) gold coins on the table arranged in a m-n array of gold coins. Each gold coin or face up or back up. Gold status with the digits, 0 gold side up, 1 back up. Gold arrays rules of the game are: (1) gold coins each time to turn over any line on the original location　(2) choice of two each time, switching the location of these two gold coins. Gold array given initial state and target state, programming calculation rules of the game by gold, the gold transform the array to the target from the initial state the minimum required to change the number of states.