约瑟夫问题的一种描述：编号为1,2....，n 的n个人按顺时针方向围坐一圈，一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，如此下去，直至所有人全部出列为止。利用循环链表为存储结构模拟此过程，按照出列的顺序输出依次出列人的编号。-Joseph, a descr iption of the problem: numbered 1,2 ...., n, n individuals in a clockwise direction around a circle, one begins optionally a positive integer as the upper limit of the number of reported m, from the first person Start clockwise order starting from one number off, stop newspaper report m number. Reported m people out of the column, and so on, until all the columns all so far. The use of circular linked list structure for storage simulate this process, in accordance with the order of the columns in turn outputs the number of people out of the column.