随笔分类 -  +++博弈

Play Apple(博弈)
摘要：Problem 1604 - Play Apple Time Limit: 1000MS Memory Limit: 65536KB Total Submit: 434 Accepted: 174 Special Judge: No Description There are N apples. T 阅读全文
posted @ 2016-04-09 22:14 handsomecui 阅读(266) 评论(0) 推荐(0) 编辑
ZYB's Game(博弈)
摘要：ZYB's GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 190Accepted Submission(s): 162Problem De... 阅读全文
posted @ 2015-12-06 15:17 handsomecui 阅读(185) 评论(0) 推荐(1) 编辑
Good Luck in CET-4 Everybody!（博弈）
摘要：Good Luck in CET-4 Everybody!Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7016Accepted Submissi... 阅读全文
posted @ 2015-09-26 21:36 handsomecui 阅读(352) 评论(0) 推荐(0) 编辑
kiki's game
摘要：欢迎参加——BestCoder周年纪念赛（高质量题目+多重奖励）kiki's gameTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 40000/10000 K (Java/Others)Total Submission(s): 8013Acc... 阅读全文
posted @ 2015-07-25 14:53 handsomecui 阅读(347) 评论(0) 推荐(0) 编辑
取石子（一）(巴什博弈)
摘要：巴什博弈：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。显然，如果n=m+1，那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次拿走剩余的物品，后者取胜。因此我们发现了如何取胜的法则：如果n=（m+1）r+s，（r为任意自然数，s... 阅读全文
posted @ 2015-06-21 14:39 handsomecui 阅读(332) 评论(0) 推荐(0) 编辑