HDU 1443解题报告

最新推荐文章于 2020-02-18 22:19:36 发布

jhljx

最新推荐文章于 2020-02-18 22:19:36 发布

阅读量767

点赞数

分类专栏：模拟文章标签： acm algorithm hdu 模拟约瑟夫环

本文链接：https://blog.csdn.net/u012294939/article/details/43983447

版权

这篇博客介绍了一种优化模拟方法解决约瑟夫环问题，通过巧妙使用取模性质降低复杂度，避免TLE。核心公式为：(t+j-1)%num，用于计算下一个被杀的人的位置，从而高效地解决经典ACM算法题目HDU 1443。

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

Joseph

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1768 Accepted Submission(s): 1095

Problem Description

The Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle every mth is going to be executed and only the life of the last remaining person will be saved. Joseph was smart enough to choose the position of the last remaining person, thus saving his life to give us the message about the incident. For example when n = 6 and m = 5 then the people will be executed in the order 5, 4, 6, 2, 3 and 1 will be saved.