Description: Rules of the game: the total M of the card (which is a multiple of N), divided into any number ranging from N into the heap, and then move through the following rules so that an equal number of cards per pile: 1. To the i-heap brand mobile card, only from the i+1 or i-1 heap heap made 2. The first pile of cards can only be obtained from the second reactor licensing 3. s N reactor license only from the first N-1 reactor license achieved. Algorithm requires: Solving the minimum number of moves when sharing
To Search:
File list (Check if you may need any files):
均分纸牌\Debug\test.obj
........\.....\vc60.idb
........\.....\vc60.pdb
........\.....\均分纸牌.exe
........\.....\均分纸牌.ilk
........\.....\均分纸牌.pch
........\.....\均分纸牌.pdb
........\test.cpp
........\均分纸牌.dsp
........\均分纸牌.dsw
........\均分纸牌.ncb
........\均分纸牌.opt
........\均分纸牌.plg
........\Debug
均分纸牌