文件名称:stone_game_dp
介绍说明－－下载内容均来自于网络，请自行研究使用
现有4堆石子,两个人轮流取石子,他们有n种可能的取法,取法表示从第1堆取A1个石子,从第2堆中取B1个,第3堆取C1个,第4堆取D1个.如果取的时候某一堆的石子数比所要取的石子数要少,则这种取法是不可行的.取到最后没有可行取法的人就算输了.
现给出4堆石子的石子数目以及n种取法,请问如果两个人都采用最优取法,先取的人是赢还是输.-Four existing heap of stones, two people take turns stones, they have emulated n possible, take the A1 emulated said a stone from a pile of rubble taken from the second B1, 3rd stacker C1, 4th heap Take a D1 and if it' s a pile of stones take a few less than the number of stones to take it, then this is not feasible emulated Take to the last man, even if there is no feasible emulated lost. heap of stones now gives 4 n kinds of stones as well as the number of emulated, what if two people are using the optimal emulated, first take the people win or lose.
现给出4堆石子的石子数目以及n种取法,请问如果两个人都采用最优取法,先取的人是赢还是输.-Four existing heap of stones, two people take turns stones, they have emulated n possible, take the A1 emulated said a stone from a pile of rubble taken from the second B1, 3rd stacker C1, 4th heap Take a D1 and if it' s a pile of stones take a few less than the number of stones to take it, then this is not feasible emulated Take to the last man, even if there is no feasible emulated lost. heap of stones now gives 4 n kinds of stones as well as the number of emulated, what if two people are using the optimal emulated, first take the people win or lose.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
stone_game_dp.c