约瑟夫（Joeph）问题的一种描述是：编号为1,2,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序。-Joseph (Joeph) a descr iption of the problem is: number is 1,2, ..., n of n individuals sitting around the circle clockwise, each holding a password (positive integer). Choose a positive integer beginning, as the reported upper limit of the number of m, starting from the first person clockwise order starting from a report number, report the number of m, to stop reporting. Who reported m out of the column, his password as the new m values in the clockwise direction from his next start back from a reported personal number, and so on, until everyone up all the columns. Try to design a program calculated the column order.