尼姆博弈
努力前行吧
这个作者很懒,什么都没留下…
展开
-
Calendar Game(博弈)
Calendar Game Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2815 Accepted Submission(s): 1622 Problem Description Adam and Eve ent转载 2015-01-09 19:06:26 · 436 阅读 · 0 评论 -
尼姆博弈
尼姆博弈 有三堆各若干个物品,两个人轮流从某一堆取任意多的物品,规定每次至少取一个,多者不限,最后取光者得胜。 这种情况最有意思,它与二进制有密切关系,我们用(a,b,c)表示某种局势,首先(0,0,0)显然是奇异局势,无论谁面对奇异局势,都必然失败。第二种奇异局势是(0,n,n),只要与对手拿走一样多的物品,最后都将导致(0,0,0)。仔细分析一下,(1,2,3)也是奇异局势,无论对转载 2015-01-01 20:30:12 · 452 阅读 · 0 评论 -
取(m堆)石子游戏(尼姆博弈)
取(m堆)石子游戏 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1921 Accepted Submission(s): 1107 Problem Description m堆石子,两人轮流取.只能在1堆中取.取转载 2015-01-01 20:34:02 · 516 阅读 · 0 评论 -
Guessing Game
Problem F: Guessing Game Time Limit: 1 Sec Memory Limit: 128 MB Submit: 20 Solved: 6 [Submit][Status][Web Board] Description Stan and Ollie are playing a guessing game. Stan thinks of a转载 2015-06-17 12:17:49 · 368 阅读 · 0 评论