约瑟夫环（Joseph）问题的一种描述是：编号为1、2、3……n的n个人按照顺时针方向围坐一圈，没人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值m，从第一个人开始按照顺时针的方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他的顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序。-Josephus (Joseph) a descr iption of the problem is: No. 1, 2, 3 ..., the n individuals sitting around the circle clockwise, no one holds a password (positive integer). One began to Choose a positive integer as the reported number of the upper limit of m, starting from the first person since the number of a start sequence reported in accordance with the clockwise direction, the report m stop the reported number. Reported m the person out of the line, his password as the new values ​ ​ of m, starting from the next person in the clockwise direction from a number off again, and so on, until all all columns so far. Try to design a program to calculate the column order.