2、　　约瑟夫（Josephus）环问题：编号为1,2,3,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值m，从第一个人开始按顺时针方向自1开始顺序报数,报到m时停止。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一人开始重新从1报数，如此下去，直到所有人全部出列为止。

建立n个人的单循环链表存储结构，运行结束后，输出依次出队的人的序号。

-2, Joseph (Josephus) ring problem: Number as 1, 2, 3, ..., n of the n individuals in a clockwise direction around a circle, each holding a password (a positive integer). The beginning optionally reported a positive integer as the number of the upper limit of m since an order number off a clockwise direction, starting from the first person to report m stop. Reported m the man out of the line, his password as the new value of m, start from the next person in the clockwise direction from a reported number, and so on, until all the columns until all. N individual single cycle linked list storage structure, the serial number of the team after the end of the run, the output turn out.