https://blog.youkuaiyun.com/hbethzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/hbeth/article/details/106423928https://blog.youkuaiyun.com/hbeth/article/details/106423928hbethFri, 29 May 2020 13:47:02 +0800https://blog.youkuaiyun.com/hbeth/article/details/106256165https://blog.youkuaiyun.com/hbeth/article/details/106256165hbethThu, 21 May 2020 14:04:32 +0800https://blog.youkuaiyun.com/hbeth/article/details/105988336https://blog.youkuaiyun.com/hbeth/article/details/105988336hbethFri, 08 May 2020 11:27:45 +0800https://blog.youkuaiyun.com/hbeth/article/details/105832371https://blog.youkuaiyun.com/hbeth/article/details/105832371hbethWed, 29 Apr 2020 10:09:38 +0800https://blog.youkuaiyun.com/hbeth/article/details/84027600https://blog.youkuaiyun.com/hbeth/article/details/84027600hbethTue, 13 Nov 2018 14:11:04 +0800https://blog.youkuaiyun.com/hbeth/article/details/80172324https://blog.youkuaiyun.com/hbeth/article/details/80172324hbethWed, 02 May 2018 21:33:56 +0800https://blog.youkuaiyun.com/hbeth/article/details/80151391https://blog.youkuaiyun.com/hbeth/article/details/80151391hbethMon, 30 Apr 2018 19:30:03 +0800https://blog.youkuaiyun.com/hbeth/article/details/77247628https://blog.youkuaiyun.com/hbeth/article/details/77247628hbethWed, 16 Aug 2017 14:44:13 +0800=1  (n>m) 先手必胜    (n 只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个，最后取光者得胜。 显然，如果n=m+1，1那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次拿走剩余的物品，后者取胜。 必胜法则：每个回合时m+1个，如果n=（m+1)*r+s，（r为任]]>https://blog.youkuaiyun.com/hbeth/article/details/56836470https://blog.youkuaiyun.com/hbeth/article/details/56836470hbethFri, 24 Feb 2017 11:57:39 +0800