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

金币阵列游戏的规则是：

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

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

本题要求对于给定的金币阵列初始状态和目标状态，编程计算按金币游戏规则，将金币阵列从初始状态变换到目标状态所需的最少变换次数。 -There are m* n (1 ≤ m, n ≤ 100) a line of gold coins on the table n a m out of line arrays. A gold coin each or up or back up the positive. Expressed by the number of gold coins, and gold coins that a positive upward 0, 1, said the back up. Gold Coin is the array of the rules of the game: 1. Each coin will turn over his office on the original position　2. 2 each can choose to exchange this gold coin of the two locations. The title of the requirements for a given initial state array of gold and objectives, and programming calculated in accordance with the rules of the game of gold coins, gold coins array will transform from the initial state to target state transform at least the required number.