约瑟夫问题：有ｎ只猴子，按顺时针方向围成一圈选大王（编号从１到ｎ），从第１号开始报数，一直数到ｍ，数到ｍ的猴子退出圈外，剩下的猴子再接着从1开始报数。就这样，直到圈内只剩下一只猴子时，这个猴子就是猴王，编程求输入ｎ，ｍ后，输出最后-Joseph questions: Have n monkeys, according to election clockwise circle king (No. from 1 to n), from No. 1 to start off, has been the number to m, to m the number of monkeys outside exit, the remaining monkeys followed by one to start off from. In this way, until the circle is only a monkey, this monkey is the Monkey King, programming for input n, m, the output of the final