约瑟夫环（Joseph）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始人选一个正整数作为报数上限值m，从...

约瑟夫环（Joseph）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始人选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从它在顺时针方向的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序-Joseph Central (Joseph) a description of the problem is: numbered 1,2, ..., n of n individuals according to a clockwise direction around a circle, each holding a password (positive integer). The beginning of a positive integer as a candidate at a number of upper limit of m, from the first individual to embark on the clockwise direction since the beginning of the order of 1 is reported the number of stops required to report back at a few m. Those who reported m out of his password as the new value of m, in a clockwise direction from the next person to start off again from the 1, and so on, until all that out until all. Try to design a procedure to derive the column order