Joseph环

任务：编号是1，2，……,n的n个人按照顺时针方向围坐一圈，每个人只有一个密码（正整数）。一开始任选一个正整数作为报数上限值m,从第一个人开始顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向的下一个人开始重新从1报数，如此下去，直到所有人全部出列为止。设计一个程序来求出出列顺序。

要求：利用单向循环链表存储结构模拟此过程，按照出列的顺序输出各个人的编号。

-Joseph Ring task: number is 1,2, ... ..., n, n individuals in accordance with clockwise sitting around a circle, each person is only one password (positive integer). Beginning Optional a positive integer as the reported number of upper limit of m, from the first individual to start a clockwise direction from a starting sequence reported that the number, appearance, m stop count off. Reported m the person out of the column, his password as the new m value, from his home in a clockwise direction of the next person start again from a newspaper a few, and so it goes, until everyone all out of the column so far. Design a program to find out the column order. Requirements: the use of a one-way circular linked list storage structure simulation of this process, and follow the column order of output of each individual number.