ZOJ Problem Set - 3964（nim游戏变形）

「已注销」

于 2018-05-12 11:50:33 发布

阅读量253

点赞数

分类专栏：练习

本文链接：https://blog.csdn.net/Outp0st/article/details/80289974

版权

Alice 和 Bob 玩一款取石子游戏，石头堆有不同的取石限制。Alice 先手，如果双方都最优玩，分析在何种情况下 Alice 能赢得游戏。问题转化为判断特定条件下是否存在A无法获胜的局面。

摘要由CSDN通过智能技术生成

Yet Another Game of Stones

Time Limit: 1 Second Memory Limit: 65536 KB

Alice and Bob are playing yet another game of stones. The rules of this game are as follow:

The game starts with n piles of stones indexed from 1 to n. The i-th pile contains a_i stones and a special constraint indicated as b_i.
The players make their moves alternatively. The allowable moves for the two players are different.
An allowable move of Bob is considered as removal of some positive number of stones from a pile.
An allowable move of Alice is also considered as removal of some positive number of stones from a pile, but is limited by the constraint b_i of that pile.
- If b_i = 0, there are no constraints.
- If b