约瑟夫环完整程序代码。从键盘输入整数m，通过creat函数生成一个具有m个结点的单向环表。从键盘输入整数s（1<=s<=m）和n，从环表的第s个结点开始计数为1，当计数到第n个结点时，输出该第n结点对应的编号，将该结点从环表中消除-Josephus complete program code. Enter an integer m　the keyboard, by creat function generates an m-node having unidirectional ring tables. Keyboard input integer s (1 <= s <= m) and n, start counting　the first ring nodes s Table 1, when the count to the n-th node, the output of the first node corresponding to the number n , the node removed　the ring table