约瑟夫(Josephus)环问题

设n个人围坐在一个圆桌周围，现在从第s个人开始报数，数到第m个人，让他出局；然后从出局的下一个人重新开始报数，数到第m个人，再让他出局，如此反复直到所有的人全部出局为止。

下面要解决的约瑟夫(Josephus)环问题是：对于任意给定的n，s和m，求出这n个人的出局序列。要求以单循环链表作为存储结构，实现约瑟夫环问题。然后使用n=9，s=1，m=5，以及n=9，s=1，m=10作为输入数据，检查你的程序的正确性和健壮性。

-Joseph (Josephus,) Central problem set of n individuals sitting around a round table around, from the s personal number off, count to the m-th individual, let him out　then start again from out the next person reported that the number, the number to m individuals, to let him out, and so forth until all the people all out so far. The following to solve Joseph (Josephus,) ring question is: for any given n, s and m, find out the sequence of the n individuals. Requirements as a single cycle linked list storage structure, the Josephus problem. And then use the n = 9, s = 1, m = 5 and n = 9, s = 1, m = 10 as input data to check the correctness and robustness of your program.