博弈
AI蜗牛之家
北航烟酒僧~ 百度、腾讯自然语言处理算法工程师~
展开
-
HDU 1850 Being a Good Boy in Spring Festival(Nim博弈)
/*终于弄懂了,其实就是在最基本的Nim博弈中增加了方案的规划想想看,在最后求出sum,也就是最后的异或结果之后,如果在和某一堆中的值异或的话其实就相当于是把这一堆从原来的所有堆中去掉了,这样的话就可以将所有的情况分开来看了这样sum^a[i]也就是没有加当前这一堆的sum,要想让对手成为必败态,就要在自己处理之后让sum变成零这样相异或的结果(sum^a[i])就应该是在当前堆中原创 2014-11-01 09:44:05 · 1012 阅读 · 0 评论 -
博弈整理(取物)
http://hi.baidu.com/bleat312/item/980956f4b738f849922af271?qq-pf-to=pcqq.c2c(一)巴什博奕(Bash Game):只有一堆n个物品,两个人轮流从这堆物品中取物,规定每次至少取一个,最多取m个。最后取光者得胜。显然,如果n=m+1,那么由于一次最多只能取m个,所以,无论先取者拿走多少个,后取者都能够一原创 2016-05-26 16:44:21 · 952 阅读 · 0 评论 -
第七届 山东省ACM Triple Nim(找规律 待整理)
Triple NimTime Limit: 2000MS Memory Limit: 65536KBSubmit StatisticProblem DescriptionAlice and Bob are always playing all kinds of Nim games and Alice always goes first. Here is the rule of原创 2017-04-15 10:33:05 · 909 阅读 · 0 评论 -
Game of Taking Stones(威佐夫博奕 待整理)
Game of Taking StonesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 477 Accepted Submission(s): 184Problem DescriptionTwo pe原创 2017-05-03 21:49:07 · 1156 阅读 · 0 评论 -
The 2016 ACM-ICPC Asia Dalian Regional Contest(汇总)
题解链接 ProblemRank (05:00:00)0 CommentsSettingFavoriteClone Stat#OriginTitlehere222 / 700AHDU 5971Wrestling Match原创 2017-05-04 10:45:57 · 2064 阅读 · 0 评论 -
ZOJ 3964 Yet Another Game of Stones(Nim博弈 待整理)
Yet Another Game of StonesTime Limit: 1 Second Memory Limit: 65536 KBAlice and Bob are playing yet another game of stones. The rules of this game are as follow:The game starts with n原创 2017-04-25 16:55:55 · 1061 阅读 · 0 评论