数据结构作业　　约瑟夫（Josephus）环问题：编号为1,2,3,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值m，从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一人开始重新从1报数，如此下去，直到所有人全部出列为止。-2, Joseph (Josephus) loop problem: number 1,2,3, ..., n, n individuals sitting around a circle clockwise, each holding a password (positive integer). Choose the beginning of a positive integer as a limit on the number of reported m, starting from the first person clockwise order starting from a report number, report m, stop. Reported m the person out of the column, his password as the new value of m, in the clockwise direction from his next began to re-reported from a number, it goes on, until everyone all the columns up.