2048 Game（分治法）

最新推荐文章于 2022-12-19 20:00:41 发布

pioneer 1

最新推荐文章于 2022-12-19 20:00:41 发布

阅读量479

点赞数

分类专栏：分治文章标签：题

本文链接：https://blog.csdn.net/qq_45328552/article/details/101108732

版权

本文介绍了如何运用分治法解决一种2048游戏变种问题，玩家可以选择相同数字进行相加，目标是通过操作使得2048出现在数列中。通过对数字2048进行分解并匹配数列中的元素，可以判断是否能赢得游戏。示例解释了分治策略的应用，展示了一种有效检查是否存在获胜策略的方法。

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

传送门

You are playing a variation of game 2048. Initially you have a multiset ss of nn integers. Every integer in this multiset is a power of two.

You may perform any number (possibly, zero) operations with this multiset.

During each operation you choose two equal integers from ss, remove them from ss and insert the number equal to their sum into ss.

For example, if s={1,2,1,1,4,2,2}s={1,2,1,1,4,2,2} and you choose integers 22 and 22, then the multiset becomes {1,1,1,4,4,2}{1,1,1,4,4,2}.

You win if the number 20482048 belongs to your multiset. For example, if s={1024,512,512,4}s={1024,512,512,4} you can win as follows: choose 512512 and 512512, your multiset turns into {1024,1024,4}{1024,1024,4}. Then choose 10241024 and 10241024, your multiset turns into {2048,4}{2048,4} and you win.

You have to determine if you can win this game.

You have t