SWUSTOJ #536 The Josephus Problem

最新推荐文章于 2022-06-14 10:56:01 发布

oafseoases

最新推荐文章于 2022-06-14 10:56:01 发布

阅读量1.7k

点赞数 4

分类专栏： SWUST OJ 题解系列文章标签： SWUSTOJ SWUST OJ C++ 题解

本文链接：https://blog.csdn.net/qq_44475551/article/details/106957902

版权

博客探讨了著名的Josephus问题，源自历史人物Flavius Josephus的故事。问题描述了一群人在洞穴中通过互相淘汰的方式求生存，任务是计算在初始n人中最后幸存者的初始位置。博客提供了输入、输出格式的说明，样例输入输出以及C++实现的源代码。

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

题目

The problem is named after Flavius Josephus, a Jewish historian who participated in and chronicled the Jewish revolt of 66-70C.E. against the Romans. Josephus, as a general, managed to hold the fortress of Jotapata for 47days, but after the fall of the city he took refuge with 40 diehards in a nearby cave. There the rebels voted to perish rather than surrender. Josephus proposed that each man in turn should dispatch his neighbor, the order to be determined by casting lots. Josephus contrived to draw the last lot, and as one of the two surviving men in the cave, he prevailed upon his intended victim to surrender to the Romans. Your task:computint the position of the survivor when there are initially n people.