约瑟夫环：编号为1,2,3,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选

一个正整数作为报数的上限值m，从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止。报m的人出列，

将他的密码作为新的m值，从他在顺时针方向上的下一人开始重新从1报数，如此下去，直到所有人全部出列为

止。编程打印出列顺序。-Joseph Wan: No. 1,2,3, ..., 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 choice at the upper limit of the number 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 m report. 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, so until all the series so far all. Programmed to print out the order.