约瑟夫问题的一种描述是：编号为1,2,...,n 的n 个人按顺时针方向围坐一

圈，每人持有一个密码(正整数)。一开始任选一个正整数作为报数上限值 m，

从第一个人开始。按顺时针方向自 1 开始顺序报数，报到m 时停止报数。报m

的人出列，将他的密码作为新的m 值, 从他在顺时针方向上的下一个人开始重

新从1 报数，如此下去，直至所有人全部出列为止。试设计程序求出出列顺

序。

-Joseph a descr iption of the problem: numbered 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 upper limit m at the number, 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. Trial design procedure to derive the column order.