博弈
nka_kun
ACMer
展开
-
HDU4764 Stone (巴什博奕)
Tang and Jiang are good friends. To decide whose treat it is for dinner, they are playing a game. Specifically, Tang and Jiang will alternatively write numbers (integers) on a white board. Tang writes first, then Jiang, then again Tang, etc... Moreover, as原创 2017-11-17 13:08:30 · 277 阅读 · 0 评论 -
HDU1970 John(经典尼姆博奕)
Little John is playing very funny game with his younger brother. There is one big box filled with M&Ms of different colors. At first John has to eat several M&Ms of the same color. Then his opponent has to make a turn. And so on. Please note that each play原创 2017-11-17 13:04:40 · 380 阅读 · 0 评论 -
博弈汇总
收录几篇比较棒的文章作参考. 文章1 文章2 文章3 题集1 题集2 简单总结: ①巴什博奕 只有一堆n个物品,两个人轮流从这堆物品中取物,规定每次至少取一个,最多取m个。最后取光者得胜。 显然,如果n=m+1,那么由于一次最多只能取m个,所以,无论先取者拿走多少个,后取者都能够一次拿走剩余的物品,后者取胜。因此我们发现了如何取胜的法则:如果n=(m+1)r+s,(r为任意自...原创 2017-11-15 20:55:25 · 303 阅读 · 0 评论 -
POJ 2348 Euclid's Game(博弈)
Euclid's Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9824 Accepted: 4023 Description Two players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtracts any positive multiple of the lesser of the t原创 2017-11-24 19:25:41 · 238 阅读 · 0 评论 -
HDU3980Paint Chain(尼姆博奕SG)
Aekdycoin and abcdxyzk are playing a game. They get a circle chain with some beads. Initially none of the beads is painted. They take turns to paint the chain. In Each turn one player must paint a unpainted beads. Whoever is unable to paint in his turn los原创 2017-11-16 22:00:45 · 239 阅读 · 0 评论 -
P1290 欧几里德的游戏(博弈,SG)
P1290 欧几里德的游戏 题目描述 欧几里德的两个后代Stan和Ollie正在玩一种数字游戏,这个游戏是他们的祖先欧几里德发明的。给定两个正整数M和N,从Stan开始,从其中较大的一个数,减去较小的数的正整数倍,当然,得到的数不能小于0。然后是Ollie,对刚才得到的数,和M,N中较小的那个数,再进行同样的操作……直到一个人得到了0,他就取得了胜利。下面是他们用(25,7)两个数游戏的过程: ...原创 2018-09-25 20:23:57 · 984 阅读 · 0 评论