文件名称:Josephus-Problem
介绍说明--下载内容均来自于网络,请自行研究使用
约瑟夫问题:编号为1,2,……,n的n个人按顺时针方向围坐一圈,每人持有一个密码(正整数)。一开始任选一个正整数作为报数上限值m,从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止报数。报m的人出列,将他的密码作为新的m值,从他在顺时针方向上的下一个人开始重新从1报数,如此下去,直至所有人全部出列为止。试设计一个程序求出出列顺序。-Joseph: Number as 1, 2, ......, n n individuals in a clockwise direction around a circle, each holding a password (positive integer). The beginning optionally a positive integer as the number off the upper limit m, starting from the first person in a clockwise direction starting from a sequence number of newspaper report m the number of stop message. The reported m people out of the line, his password as the new value of m, starting from the next person in a clockwise direction from a number of reported again, and so on until all all out of the line so far. Design of a test procedure to derive the column order.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Josephus Problem.doc