文件名称:Josephus
介绍说明－－下载内容均来自于网络，请自行研究使用
题目描述：设有n个人围坐在一个圆桌周围，现从第s个人开始报数，数到第m的人出列，然后从出列的下一个人重新开始报数，数到第m的人又出列，如此反复直到所有人全部出列为止。最终显示出列人的队列。
这个问题是约瑟夫问题的实例化，运用了循环链表，详细算法描述及测试结果见Readme。-Subject descr iption: has n individuals sitting around a round table, now from the first s personal Countin, number m out of the line, and then re-start at the next person from the column number, the number to the m out of the line, and so forth until all all out of the line so far. Finally showing as people queue. This problem is Joseph instance, the use of a circular linked list algorithm is described in detail and test results to see Readme.
这个问题是约瑟夫问题的实例化，运用了循环链表，详细算法描述及测试结果见Readme。-Subject descr iption: has n individuals sitting around a round table, now from the first s personal Countin, number m out of the line, and then re-start at the next person from the column number, the number to the m out of the line, and so forth until all all out of the line so far. Finally showing as people queue. This problem is Joseph instance, the use of a circular linked list algorithm is described in detail and test results to see Readme.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Josephus\3.cpp
........\3.exe
........\第3题-readme.docx
Josephus