约瑟夫环问题求解

　　　约瑟夫环问题的具体描述是：设有编号为1，2，……，n的n(n>0)个人围成一个圈，从第1个人开始报数，报到m时停止报数，报m的人出圈，再从他的下一个人起重新报数，报到m时停止报数，报m的出圈，……，如此下去，直到所有人全部出圈为止。当任意给定n和m后，设计算法求n个人出圈的次序。-Josephus Josephus problem solving specific descr iption is: has numbered 1, 2, ...... n n (n>　0) individuals in a circle, from the start of the first personal number off, stop newspaper report m The number of reported m, a circle, and then re-reported number from the next person from his report m stop the reported number reported m circle out ...... and they continue to do so until all the circle until everyone. When any given n and m, design algorithms to find the order of n individuals a circle.