TUT我好菜啊

博弈论基础知识: 巴什博奕+威佐夫博奕+尼姆博弈(及Staircase);(一)巴什博奕(Bash Game):只有一堆n个物品,两个人轮流从这堆物品中取物,规定每次至少取一个,最多取m个.最后取光者得胜.若(m+1) | n，则先手必败，否则先手必胜。显然,如果n=m+1,那么由于一次最多只能取m个,所以,无论先取者拿走多少个,后取者都能够一次拿走剩余的物品,后者取胜.因此我

取石子游戏Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 39330 Accepted: 13189Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子

Public SaleTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6798    Accepted Submission(s): 4011Problem Description虽然不想，但是现实总归是现实

Matches GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9535 Accepted: 5529DescriptionHere is a simple game. In this game, there are several piles

Being a Good Boy in Spring FestivalTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6447    Accepted Submission(s): 3893Problem Descr

Revenge of NimTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 557    Accepted Submission(s): 288Problem DescriptionNim is a math