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

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

-2, Joseph (Josephus) Central Question: numbered 1,2,3, ..., n, n individuals sitting clockwise circle, each holding a password (positive integer). An optional start a positive integer as the number of reported upper limit of m, from the first person to embark on the clockwise direction starting from a reported sequence number, to report m stop. Those who reported m out of the column, his password as the new m value, from his home in a clockwise direction, the next began to re-reported from a few, and so it goes, until all of the column until all the up. The establishment of n individual single-loop list storage structure, operation after the end of the output turn out the team' s serial number.