编号为1,2,3,…,n的n个人按顺序针方向围坐一张圆桌旁，每个人手中持有

一个密码（正整数）。首先输入一个正整数作为报数上限值m，然后，从第一个人开始按顺序针方向自1开始顺序报数，报到m的人离开桌子，并将他手中的密码作为新的m值，从顺序针方向的下一个就坐在桌旁的人开始重新从1报数，如此下去，直至所有人全部离开桌旁为止。

算法思想：

用单循环链表来解决这一问题，实现的方法首先要定义链表结点，单循环链表的结点结构与一般单链表的结点结构完全相同，只是数据域用一个整数来表示；然后将它们组成一个单循环链表。接下来从位置为1的结点开始数，数到第m-1个结点，就将下一个结点从循环链表中删除，然后再从删去结点的下一个结点开始报数，如此下去，直到所有的人离开桌子。

-Numbered 1,2,3, ..., n, n individuals under the direction of the order of sitting around a round table next to the pin, holding the hands of each person

A password (positive integer). First, enter a positive integer as the number of reported upper limit of m, then, from the first person to embark on the order of pin direction from a starting sequence reported that the number of people leaving the table to report m, and the password in his hand as a new m value, from the Under the direction of the order of one pin on the people sit at the table began to re-reported from a few, and so on, until all leave the table until everyone.

Algorithm idea:

Linked list with one-cycle to solve this problem, the methods to achieve the first node to define linked lists, single cycle nodes linked list structure and the general structure of a single linked list of nodes are identical, only the data field with an integer to represent　then they are the formation of a single round-robin list. Next, f