本文探讨了一种解决复杂博弈问题的方法，强调了在特定情况下，仅通过求和无法得到正确答案，而需要迭代所有可能的状态来判断当前局势是否能导向胜利。文章还提到了位操作中的一些常见错误，如在使用“|”操作符时，不能跳过0位直接赋值1位。
The problem is so tricky, we need to indicate the state instead of sum to get the correct answer. So in this problem, we need to do is iterator all state to know if current situation can reach win situation or not.
Error:
- I assume in bit operation, when “|” we need to assign it consequently, I do not know why I cannot skip the 0th bit and assign 1st bit directly.
扫一扫
257
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
