Description: 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.
To Search:
- [divi] - A maximum of about a few issues: positiv
- [1] - The biggest gap issue acmer and oier ess
File list (Check if you may need any files):
AC.doc
Download