约瑟夫(Joseph)问题的一种描述是:编号为1,2,..., n 的n 个人按顺

时针方向围坐一圈, 每人持有一个密码(正整数)。一开始选任一个正整数作为报数上限值m， 从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将它的密码作为新的m值，再从下个人开始新一轮报数，如此反复，直到剩下最后一人则为获胜者。试设计一个程序求出出列顺序。-Joseph (Joseph) a descr iption of the problem is: numbered 1,2 ,..., n of n individuals sitting around a circle clockwise, each holding a password (positive integer). The beginning of a positive integer as the selection of the number of reported upper limit of m, starting from the first person clockwise order starting from a number of newspaper, newspaper to report the number of m to stop. Who reported m out of line, it' s password as the new m value, and then start a new one from the reported number of individuals, and so forth, until the last one remaining was the winner. Design a program list find out the order.