ACM-尼姆博弈之John——hdu1907

最新推荐文章于 2020-09-11 12:40:40 发布

VIP文章 ltree98

最新推荐文章于 2020-09-11 12:40:40 发布

阅读量4.7k

点赞数 3

分类专栏： ACM-博弈漫漫刷题路文章标签： ACM 尼姆博弈 John hdu1907

本文链接：https://blog.csdn.net/lttree/article/details/24874819

版权

John

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 2577 Accepted Submission(s): 1400

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. Then his opponent has to make a turn. And so on. Please note that each player has to eat at least one M&M during his turn. If John (or his brother) will eat the last M&M from the box he will be considered as a looser and he will have to buy a new candy box.

Both of players are using optimal game strategy. John starts first always. You will be given information about M&Ms and your task is to determine a winner of such a beautiful game.