约瑟夫环（Joseph）问题的一种描述是：编号1，2，┉，n的n个人按顺时针方向围坐一圈，每个人持有一个密码（正整数），一开始，任选一个正整数作为报数上线值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1开始报数，如此下去，直至所有人全部出列为止。设计一个程序求出出列顺序。-Joseph Ring (Joseph) a descr iption of the problem is: No. 1,2, ┉, n, n individuals sitting clockwise circle, each person holds a password (positive integer), a start is an optional As the number of on-line newspaper integer values of m, from the first person to embark on the clockwise direction starting from a reported sequence number, to report the number of m stop reported. Those who reported m out of the column, his password as the new m value, from his home in a clockwise direction on the next person started to re-start from a newspaper a few, and so on, until all of the column until all the up. A program designed to find out the column order.