ACM-尼姆博弈之John——hdu1907

最新推荐文章于 2025-09-10 22:15:42 发布

原创

最新推荐文章于 2025-09-10 22:15:42 发布 · 4.9k 阅读

2 ·

CC 4.0 BY-SA版权

文章标签：

#ACM #尼姆博弈 #John #hdu1907

本文深入探讨ACM竞赛中的John问题，即hdu1907题目，解析尼姆博弈的策略与解决方案。

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.