Musical Chairs（约瑟夫问题高效算法）

最新推荐文章于 2021-05-11 10:20:51 发布

Rachel-Zhang

最新推荐文章于 2021-05-11 10:20:51 发布

阅读量3.1k

点赞数

分类专栏： ACM 文章标签：算法 character input each output file

本文链接：https://blog.csdn.net/abcjennifer/article/details/5452563

版权

本文介绍了约瑟夫问题的两种高效算法实现，一种用于求解最后剩下的人的序号，另一种用于输出每次被剔除的人的序号。程序使用C++编写，通过输入参数n（人数）和d（每d个人剔除一人），输出约瑟夫环的结果。

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

In the traditional game of Musical Chairs, N + 1 children run around N chairs (placed in a circle) as long as music is playing. The moment the music stops, children run and try to sit on an available chair. The child still standing leaves the game, a chair is removed, and the game continues with N children. The last child to sit is the winner.

In an attempt to create a similar game on these days' game consoles, you modify the game in the following manner: N Children are seated on N chairs arranged around a circle. The chairs are numbered from 1 to N . Your program pre-selects a positive number D . The program starts going in circles counting the children starting with the first chair. Once the count reaches D , that child leaves the game, removing his/her chair. The program starts counting again, beginning with the next chair in the circle. The last child remaining in the circle is the winner.

For example, consider