博弈
HonniLin
double fighting
展开
-
HDU 4764-Stone(博弈)
题意: J 和 T 轮流说数字原创 2014-09-12 13:03:27 · 595 阅读 · 0 评论 -
HDU 5011-Game(博弈)
Problem Description Here is a game for two players. The rule of the game is described below: ● In the beginning of the game, there are a lot of piles of beads. ● Players take turns to play. E原创 2014-09-15 09:52:41 · 616 阅读 · 0 评论 -
HDU 1907- John(NImm博弈)
Problem Description 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原创 2014-09-15 17:36:56 · 535 阅读 · 0 评论 -
HDU 4642 - Fliping game(博弈)
题目: http://acm.hdu.edu.cn/showproblem.php?pid=4642 题意: 给你一个n*m的矩阵,上面有正面或者反面的棋子, 每一次只能选(x,y)正面的棋子进行翻转, 区域(x,y)-(n,m) 中的棋子都会被翻转. A,B一块玩, A先,最后要使得所有的棋子都是反面的. 求出谁会赢得比赛. 思路: 博弈. 因为每一次翻转都会翻到格子(n,m), 最原创 2015-03-31 19:57:08 · 590 阅读 · 0 评论 -
Codeforces Round #124 (Div. 2) A. Plate Game(博弈)
http://codeforces.com/problemset/problem/197/A 这题竟是div2的A题,比赛的时候完全卡壳了T^T 题意:给出长a宽b的矩阵,两个人轮流在矩阵上放半径为r的圆,不能重叠,两人都采用最优策略,求出谁会赢。 思路:判断是否可以在中间放一个圆,若可以放,便可以在矩阵中以圆为对称放圆,则先手 赢。 若不能放圆,则后手赢。 AC. #include原创 2015-07-10 14:45:47 · 490 阅读 · 0 评论 -
*Looksery Cup 2015 C. The Game Of Parity
题目: http://codeforces.com/problemset/problem/549/C 题意: n个数,S和D轮流取(n-k)个数,若剩下的k个数的总和为奇数,则S赢,为偶数则D赢。S先取。 思路: 由题分析,题目只与奇数个数odd 和偶数个数even 有关,设S能取n1个,D取n2个。 分情况讨论: 1.如果n=k则 odd为奇数则S赢,偶数个为D赢。 2.n原创 2015-07-17 11:17:48 · 538 阅读 · 0 评论