![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM-博弈论
AC_way
这个作者很懒,什么都没留下…
展开
-
hdu 5011 Game(2014 西安网络赛)
GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 258 Accepted Submission(s): 200Problem DescriptionHere is a game for two原创 2014-09-15 17:56:03 · 539 阅读 · 0 评论 -
poj 2599 A funny game
A funny gameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1907 Accepted: 804DescriptionThere are several airports in one country, and there are flight原创 2014-10-30 10:25:45 · 998 阅读 · 0 评论 -
(k倍动态减法游戏)zoj 3599 hdu 2486
A simple stone gameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 359 Accepted Submission(s): 190Problem DescriptionAfter he原创 2014-10-30 16:56:52 · 1150 阅读 · 0 评论 -
hdu 5088 Revenge of Nim II(BestCoder Round #16)
Revenge of Nim II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2014-11-02 08:47:41 · 1182 阅读 · 0 评论 -
zoj 3882 Help Bob(zoj 2015年7月月赛)
Help BobTime Limit: 2 Seconds Memory Limit: 65536 KBThere is a game very popular in ZJU at present, Bob didn't meant to participate in it. But he decided to join it after discovering a lo原创 2015-07-28 09:00:08 · 4553 阅读 · 0 评论 -
51nod Bash游戏(V1,V2,V3,V4(斐波那契博弈))
Bash游戏V1有一堆石子共有N个。A B两个人轮流拿,A先拿。每次最少拿1颗,最多拿K颗,拿到最后1颗石子的人获胜。假设A B都非常聪明,拿石子的过程中不会出现失误。给出N和K,问最后谁能赢得比赛。例如N = 3,K = 2。无论A如何拿,B都可以拿到最后1颗石子。Input第1行:一个数T,表示后面用作输入测试的数的数量。(1 <=原创 2015-08-21 22:31:49 · 5395 阅读 · 0 评论