文件名称:Josephus
介绍说明－－下载内容均来自于网络，请自行研究使用
2、 约瑟夫（Josephus）环问题：编号为1,2,3,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值m，从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一人开始重新从1报数，如此下去，直到所有人全部出列为止。
建立n个人的单循环链表存储结构，运行结束后，输出依次出队的人的序号。
-Josephus: The numbers 1, 2, 3, ..., of n of n individuals sitting around a circle in a clockwise direction, the person holding a code (positive integer). Opened
Beginning to Choose a positive integer m as the upper limit of the reported number of start from the first person in a clockwise direction since a start sequence number off the report m stop.
Reported m the person out of the line, the password as the new values of m from the next person in the clockwise direction from a number off again, it goes straight
To all until all the columns.
Single cycle of the n individuals linked list storage structure, after the end of the run, the output followed by the serial number of the team.
建立n个人的单循环链表存储结构，运行结束后，输出依次出队的人的序号。
-Josephus: The numbers 1, 2, 3, ..., of n of n individuals sitting around a circle in a clockwise direction, the person holding a code (positive integer). Opened
Beginning to Choose a positive integer m as the upper limit of the reported number of start from the first person in a clockwise direction since a start sequence number off the report m stop.
Reported m the person out of the line, the password as the new values of m from the next person in the clockwise direction from a number off again, it goes straight
To all until all the columns.
Single cycle of the n individuals linked list storage structure, after the end of the run, the output followed by the serial number of the team.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
约瑟夫（Josephus）环问题 .cpp